TSTP Solution File: LCL125-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL125-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n016.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 : 300s
% DateTime : Thu Aug 31 06:52:24 EDT 2023
% Result : Unsatisfiable 274.61s 274.61s
% Output : CNFRefutation 274.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 10
% Syntax : Number of formulae : 58 ( 16 unt; 6 typ; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 114 ( 68 ~; 46 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 111 ( 5 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
equivalent: ( $i * $i ) > $i ).
tff(decl_23,type,
is_a_theorem: $i > $o ).
tff(decl_24,type,
a: $i ).
tff(decl_25,type,
b: $i ).
tff(decl_26,type,
c: $i ).
tff(decl_27,type,
e: $i ).
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(q_3,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_3) ).
cnf(q_2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_2) ).
cnf(prove_lg_2,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).
cnf(c_0_4,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)))),
q_3 ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_8,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))),
q_2 ).
cnf(c_0_9,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,X1))))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(X1,X3))) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)),X1)),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_14,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
prove_lg_2 ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(a,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))),a))))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_6]) ).
cnf(c_0_20,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))),a))))
| ~ is_a_theorem(equivalent(a,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_20,c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(equivalent(equivalent(b,e),equivalent(c,e)),equivalent(b,c))),a)),
inference(spm,[status(thm)],[c_0_23,c_0_5]) ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_26,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(equivalent(b,e),equivalent(c,e)),equivalent(b,c)))))
| ~ is_a_theorem(equivalent(a,X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_8]) ).
cnf(c_0_29,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(equivalent(b,e),equivalent(c,e)),equivalent(b,c)))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a)),
inference(spm,[status(thm)],[c_0_29,c_0_5]) ).
cnf(c_0_31,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),X1))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_30,c_0_15]) ).
cnf(c_0_32,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a))
| ~ is_a_theorem(equivalent(a,X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_33,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X4))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),X4)) ),
inference(spm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_34,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e)))))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,c)),a)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X4))) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_36,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(X2,X4)))
| ~ is_a_theorem(equivalent(equivalent(X1,X4),X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_37,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(c,e)),equivalent(b,c)),a))
| ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,e)))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X4))
| ~ is_a_theorem(equivalent(X1,equivalent(X4,equivalent(X3,X2)))) ),
inference(spm,[status(thm)],[c_0_36,c_0_13]) ).
cnf(c_0_39,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(c,e)),equivalent(a,equivalent(c,b))))
| ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,e)))) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,X4)))
| ~ is_a_theorem(equivalent(equivalent(X2,X4),X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_41,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(equivalent(X1,e),equivalent(b,e))))
| ~ is_a_theorem(equivalent(equivalent(X1,c),equivalent(a,equivalent(c,b)))) ),
inference(spm,[status(thm)],[c_0_39,c_0_33]) ).
cnf(c_0_42,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X4))))
| ~ is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_40,c_0_13]) ).
cnf(c_0_43,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(equivalent(X1,e),equivalent(b,e))))
| ~ is_a_theorem(equivalent(a,equivalent(equivalent(X1,c),equivalent(b,c)))) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))))
| ~ is_a_theorem(equivalent(equivalent(X2,X4),X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_8]) ).
cnf(c_0_45,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X3,equivalent(equivalent(X1,X4),equivalent(X2,X4)))) ),
inference(spm,[status(thm)],[c_0_25,c_0_8]) ).
cnf(c_0_46,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(X1,c),equivalent(b,c)))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_47,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,b),a)),
inference(spm,[status(thm)],[c_0_46,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,b),X2))
| ~ is_a_theorem(equivalent(X2,a)) ),
inference(spm,[status(thm)],[c_0_47,c_0_15]) ).
cnf(c_0_49,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(b,X2)),a)),
inference(spm,[status(thm)],[c_0_48,c_0_22]) ).
cnf(c_0_50,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,equivalent(X2,b)))),
inference(spm,[status(thm)],[c_0_49,c_0_38]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_50,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL125-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 25 05:33:40 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.57 start to proof: theBenchmark
% 274.61/274.61 % Version : CSE_E---1.5
% 274.61/274.61 % Problem : theBenchmark.p
% 274.61/274.61 % Proof found
% 274.61/274.61 % SZS status Theorem for theBenchmark.p
% 274.61/274.61 % SZS output start Proof
% See solution above
% 274.61/274.62 % Total time : 274.028000 s
% 274.61/274.62 % SZS output end Proof
% 274.61/274.62 % Total time : 274.041000 s
%------------------------------------------------------------------------------