TSTP Solution File: LCL100-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL100-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 : n029.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:15 EDT 2023
% Result : Unsatisfiable 11.83s 11.89s
% Output : CNFRefutation 11.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 64 ( 25 unt; 7 typ; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 95 ( 54 ~; 41 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 8 ( 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 : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 173 ( 0 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 ).
tff(decl_28,type,
falsehood: $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(lg_2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_2) ).
cnf(p_1,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_1) ).
cnf(prove_lg_3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),e),equivalent(equivalent(b,c),e)),falsehood),falsehood)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_3) ).
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(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
lg_2 ).
cnf(c_0_6,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3)))),
p_1 ).
cnf(c_0_8,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(equivalent(X2,X4),X1),equivalent(X4,X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,X4)))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,X4))) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X4)) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_13,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),e),equivalent(equivalent(b,c),e)),falsehood),falsehood)),
prove_lg_3 ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X1,X4),X3))
| ~ is_a_theorem(equivalent(X2,X4)) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_16,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),X4))
| ~ is_a_theorem(equivalent(X4,equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X1))),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),e),equivalent(equivalent(b,c),e)),X1),falsehood))
| ~ is_a_theorem(equivalent(falsehood,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X4))
| ~ is_a_theorem(equivalent(X4,equivalent(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_16]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),e),equivalent(equivalent(b,c),e)),equivalent(equivalent(X1,X1),falsehood)),falsehood)),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X4,X2),X1)))
| ~ is_a_theorem(equivalent(X4,X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_23,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_24,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X5))))
| ~ is_a_theorem(equivalent(X3,X5)) ),
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_25,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),e),equivalent(equivalent(b,c),e)),X1),falsehood))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X2),falsehood),X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_26,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4))),X5))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X3,X4)),X5)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_27,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X3)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),e),equivalent(equivalent(b,c),e)),equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),falsehood))),falsehood)),
inference(spm,[status(thm)],[c_0_25,c_0_7]) ).
cnf(c_0_30,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4))
| ~ is_a_theorem(equivalent(equivalent(X5,equivalent(X2,X3)),equivalent(X5,X4))) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_31,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(b,c),e),equivalent(equivalent(e,equivalent(equivalent(a,b),equivalent(a,c))),falsehood))),equivalent(X1,falsehood))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( is_a_theorem(equivalent(equivalent(X1,X1),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_17]) ).
cnf(c_0_34,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X3),X1),X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_35,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_31,c_0_7]) ).
cnf(c_0_36,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,c),e),equivalent(equivalent(e,equivalent(equivalent(a,b),equivalent(a,c))),falsehood)),falsehood)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),X4)),X5))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X3,X6)),X5))
| ~ is_a_theorem(equivalent(X4,equivalent(X2,X6))) ),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_38,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X3)),equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,c),e),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),X1)),falsehood))
| ~ is_a_theorem(equivalent(falsehood,equivalent(e,X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X2,equivalent(X3,X3)),X1)))),
inference(spm,[status(thm)],[c_0_13,c_0_38]) ).
cnf(c_0_41,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X5),X1))
| ~ is_a_theorem(equivalent(equivalent(X3,X4),X5)) ),
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_42,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,c),e),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(e,equivalent(X1,X1)),falsehood))),falsehood)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X2,X5)),equivalent(equivalent(X6,X4),equivalent(equivalent(X3,X6),X5))),X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_7]) ).
cnf(c_0_44,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,c),e),equivalent(equivalent(a,c),X1)),falsehood))
| ~ is_a_theorem(equivalent(equivalent(equivalent(e,equivalent(X2,X2)),falsehood),equivalent(equivalent(a,b),X1))) ),
inference(spm,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_45,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1)))),
inference(spm,[status(thm)],[c_0_34,c_0_7]) ).
cnf(c_0_46,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X4))),X5))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X3,X6),X2),equivalent(X6,X4))),X5)) ),
inference(spm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_47,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X5)),X6))
| ~ is_a_theorem(equivalent(equivalent(X1,X5),X6)) ),
inference(spm,[status(thm)],[c_0_15,c_0_5]) ).
cnf(c_0_48,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X4),X2)),equivalent(equivalent(X1,equivalent(X6,X5)),X3))) ),
inference(spm,[status(thm)],[c_0_43,c_0_9]) ).
cnf(c_0_49,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,c),e),equivalent(equivalent(a,c),equivalent(equivalent(b,a),equivalent(equivalent(e,equivalent(X1,X1)),falsehood)))),falsehood)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X4,X2),X5))),X6))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X4,X3),X5)),X6)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_52,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_48,c_0_5]) ).
cnf(c_0_53,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,c),e),equivalent(equivalent(b,c),equivalent(equivalent(e,equivalent(X1,X1)),falsehood))),falsehood)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_6,c_0_51]) ).
cnf(c_0_55,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X2)),X3)),X3)),
inference(spm,[status(thm)],[c_0_10,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL100-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n029.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 07:50:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.57 start to proof: theBenchmark
% 11.83/11.89 % Version : CSE_E---1.5
% 11.83/11.89 % Problem : theBenchmark.p
% 11.83/11.89 % Proof found
% 11.83/11.89 % SZS status Theorem for theBenchmark.p
% 11.83/11.89 % SZS output start Proof
% See solution above
% 11.83/11.90 % Total time : 11.306000 s
% 11.83/11.90 % SZS output end Proof
% 11.83/11.90 % Total time : 11.310000 s
%------------------------------------------------------------------------------