TSTP Solution File: COM010-2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COM010-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Fri Jul 15 01:44:15 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 8 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(u,v),c_Pair(c_UNITY_OActs(u,v),c_UNITY_OAllowedActs(u,v),tc_set(tc_set(tc_prod(v,v))),tc_set(tc_set(tc_prod(v,v)))),tc_set(v),tc_prod(tc_set(tc_set(tc_prod(v,v))),tc_set(tc_set(tc_prod(v,v))))),v),u),
file('COM010-2.p',unknown),
[] ).
cnf(2,axiom,
equal(c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_F,t_a)),
file('COM010-2.p',unknown),
[] ).
cnf(3,axiom,
equal(c_UNITY_OActs(v_G,t_a),c_UNITY_OActs(v_F,t_a)),
file('COM010-2.p',unknown),
[] ).
cnf(4,axiom,
equal(c_UNITY_OAllowedActs(v_G,t_a),c_UNITY_OAllowedActs(v_F,t_a)),
file('COM010-2.p',unknown),
[] ).
cnf(5,axiom,
~ equal(v_G,v_F),
file('COM010-2.p',unknown),
[] ).
cnf(12,plain,
equal(c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(v_F,t_a),c_Pair(c_UNITY_OActs(v_G,t_a),c_UNITY_OAllowedActs(v_G,t_a),tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a)))),tc_set(t_a),tc_prod(tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a))))),t_a),v_G),
inference(spr,[status(thm),theory(equality)],[2,1]),
[iquote('0:SpR:2.0,1.0')] ).
cnf(13,plain,
equal(v_G,v_F),
inference(rew,[status(thm),theory(equality)],[1,12,3,4]),
[iquote('0:Rew:1.0,12.0,3.0,12.0,4.0,12.0')] ).
cnf(14,plain,
$false,
inference(mrr,[status(thm)],[13,5]),
[iquote('0:MRR:13.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : COM010-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 16 16:51:20 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.41
% 0.20/0.41 SPASS V 3.9
% 0.20/0.41 SPASS beiseite: Proof found.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 8 clauses.
% 0.20/0.41 SPASS allocated 63115 KBytes.
% 0.20/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.41 0:00:00.04 for the input.
% 0.20/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.41 0:00:00.00 for inferences.
% 0.20/0.41 0:00:00.00 for the backtracking.
% 0.20/0.41 0:00:00.00 for the reduction.
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Here is a proof with depth 1, length 8 :
% 0.20/0.41 % SZS output start Refutation
% See solution above
% 0.20/0.42 Formulae used in the proof : cls_UNITY_Osurjective__mk__program_0 cls_conjecture_0 cls_conjecture_1 cls_conjecture_2 cls_conjecture_3
% 0.20/0.42
%------------------------------------------------------------------------------