TSTP Solution File: LCL105-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL105-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : Sat May 4 08:26:23 EDT 2024
% Result : Unsatisfiable 231.15s 29.67s
% Output : CNFRefutation 231.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 45
% Number of leaves : 5
% Syntax : Number of clauses : 99 ( 46 unt; 0 nHn; 40 RR)
% Number of literals : 162 ( 0 equ; 66 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% 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 : 351 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.nlkuvq9gyt/E---3.1_27577.p',condensed_detachment) ).
cnf(q_2,axiom,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
file('/export/starexec/sandbox/tmp/tmp.nlkuvq9gyt/E---3.1_27577.p',q_2) ).
cnf(q_3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)),X3)),
file('/export/starexec/sandbox/tmp/tmp.nlkuvq9gyt/E---3.1_27577.p',q_3) ).
cnf(q_1,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1)))),
file('/export/starexec/sandbox/tmp/tmp.nlkuvq9gyt/E---3.1_27577.p',q_1) ).
cnf(prove_lg_2,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
file('/export/starexec/sandbox/tmp/tmp.nlkuvq9gyt/E---3.1_27577.p',prove_lg_2) ).
cnf(c_0_5,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_6,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_5 ).
cnf(c_0_7,axiom,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
q_2 ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)),X3)),
q_3 ).
cnf(c_0_11,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_12,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1))) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,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_11,c_0_8]) ).
cnf(c_0_14,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1)))),
q_1 ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),equivalent(X3,X3)))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(equivalent(X1,X1),equivalent(X2,X2))),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_18,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X3)))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(equivalent(X1,X1),X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X3),X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_20,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X3)))
| ~ is_a_theorem(equivalent(equivalent(X4,X2),equivalent(X4,X1))) ),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_21,plain,
is_a_theorem(equivalent(equivalent(X1,X1),equivalent(equivalent(X2,X2),equivalent(X3,X3)))),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),equivalent(X2,X2)),equivalent(X3,X3))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_24,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X1),equivalent(X2,X2)),X3))
| ~ is_a_theorem(equivalent(equivalent(X4,X4),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_27,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X1),equivalent(X2,X2)),X3))
| ~ is_a_theorem(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_28,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X2),equivalent(X3,X3)),X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_29,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X3))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X4,X4)),X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_30,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X3)),equivalent(X2,X1))),
inference(spm,[status(thm)],[c_0_29,c_0_10]) ).
cnf(c_0_31,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X3,X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_30]) ).
cnf(c_0_32,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_31,c_0_13]) ).
cnf(c_0_33,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)),X4))
| ~ is_a_theorem(equivalent(X3,X4)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_34,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4))
| ~ is_a_theorem(equivalent(X3,equivalent(equivalent(X2,X1),X4))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,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_11,c_0_34]) ).
cnf(c_0_36,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,equivalent(X3,X2)),X4))),X4)),
inference(spm,[status(thm)],[c_0_35,c_0_10]) ).
cnf(c_0_37,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,equivalent(X2,X1)),equivalent(X3,X4))),X4)),
inference(spm,[status(thm)],[c_0_32,c_0_36]) ).
cnf(c_0_38,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X4,X4))),equivalent(X3,X2))),
inference(spm,[status(thm)],[c_0_31,c_0_37]) ).
cnf(c_0_39,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,equivalent(X2,X1)),equivalent(X3,equivalent(X4,X4)))) ),
inference(spm,[status(thm)],[c_0_6,c_0_38]) ).
cnf(c_0_40,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X3))
| ~ is_a_theorem(equivalent(X3,equivalent(X4,X4))) ),
inference(spm,[status(thm)],[c_0_39,c_0_25]) ).
cnf(c_0_41,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(equivalent(equivalent(X3,X4),X2),equivalent(X4,X3)),X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_33]) ).
cnf(c_0_42,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,equivalent(X4,X1)),equivalent(X3,equivalent(X4,X2))))),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_43,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X2),equivalent(X3,X1)),equivalent(X4,X4))) ),
inference(spm,[status(thm)],[c_0_40,c_0_7]) ).
cnf(c_0_44,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_9,c_0_8]) ).
cnf(c_0_45,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,equivalent(X4,X1)),equivalent(X3,equivalent(X4,X2)))) ),
inference(spm,[status(thm)],[c_0_43,c_0_13]) ).
cnf(c_0_47,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X4),equivalent(equivalent(X4,X3),X1)),X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_48,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_44,c_0_45]) ).
cnf(c_0_49,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_46,c_0_25]) ).
cnf(c_0_50,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X3,X2),equivalent(X4,X4)))) ),
inference(spm,[status(thm)],[c_0_31,c_0_34]) ).
cnf(c_0_51,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X4),X1),equivalent(X4,X3))) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,equivalent(X2,X1)),equivalent(X4,X4))),X3)),
inference(spm,[status(thm)],[c_0_31,c_0_36]) ).
cnf(c_0_53,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X1)),equivalent(X4,X2))) ),
inference(spm,[status(thm)],[c_0_49,c_0_7]) ).
cnf(c_0_54,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X2,equivalent(equivalent(X4,X3),X1))))),
inference(spm,[status(thm)],[c_0_47,c_0_7]) ).
cnf(c_0_55,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),equivalent(X4,X4))) ),
inference(spm,[status(thm)],[c_0_50,c_0_13]) ).
cnf(c_0_56,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),X4)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X2),X1),X4)) ),
inference(spm,[status(thm)],[c_0_47,c_0_8]) ).
cnf(c_0_57,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X4,X4)),equivalent(X3,X2))),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(equivalent(X4,X3),equivalent(X4,X2)))) ),
inference(spm,[status(thm)],[c_0_53,c_0_34]) ).
cnf(c_0_59,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X4),equivalent(equivalent(X2,equivalent(X4,X3)),X1))))),
inference(spm,[status(thm)],[c_0_32,c_0_54]) ).
cnf(c_0_60,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(equivalent(X4,X2),equivalent(X4,X3))) ),
inference(spm,[status(thm)],[c_0_55,c_0_13]) ).
cnf(c_0_61,plain,
is_a_theorem(equivalent(equivalent(X1,X1),equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),X4),equivalent(X3,X2)),equivalent(X4,X1)))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X4,X2),equivalent(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_51,c_0_34]) ).
cnf(c_0_64,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4))),equivalent(X1,equivalent(X3,X4)))),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(X3,equivalent(equivalent(X2,X1),X4)))),
inference(spm,[status(thm)],[c_0_35,c_0_62]) ).
cnf(c_0_66,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X4))),equivalent(X2,X4))),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),X5))
| ~ is_a_theorem(equivalent(equivalent(X3,equivalent(equivalent(X2,X1),X4)),X5)) ),
inference(spm,[status(thm)],[c_0_9,c_0_65]) ).
cnf(c_0_68,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X4)),X5)))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(equivalent(X4,X3),X1)),X5)) ),
inference(spm,[status(thm)],[c_0_47,c_0_13]) ).
cnf(c_0_69,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X4,equivalent(X3,X2)),equivalent(equivalent(X1,X4),X5)))),X5)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_70,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X4))))
| ~ is_a_theorem(equivalent(X3,X4)) ),
inference(spm,[status(thm)],[c_0_6,c_0_42]) ).
cnf(c_0_71,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(equivalent(X4,X2),equivalent(X4,X3)))),
inference(spm,[status(thm)],[c_0_56,c_0_66]) ).
cnf(c_0_72,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),X4)))
| ~ is_a_theorem(equivalent(equivalent(X5,equivalent(equivalent(X3,X2),X1)),equivalent(X5,X4))) ),
inference(spm,[status(thm)],[c_0_51,c_0_67]) ).
cnf(c_0_73,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X4,X1),X5)),equivalent(equivalent(X4,equivalent(X2,X3)),X5))),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_74,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X4)))
| ~ is_a_theorem(equivalent(X4,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_70]) ).
cnf(c_0_75,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X4,X3),equivalent(X4,X2))))),
inference(spm,[status(thm)],[c_0_56,c_0_71]) ).
cnf(c_0_76,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_9,c_0_45]) ).
cnf(c_0_77,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X1))),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X5,X3),equivalent(X5,X2)),X4)) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_32,c_0_73]) ).
cnf(c_0_80,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,X5)))
| ~ is_a_theorem(equivalent(equivalent(X2,X5),X4)) ),
inference(spm,[status(thm)],[c_0_44,c_0_76]) ).
cnf(c_0_81,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X2,equivalent(X3,X3)),X1)))),
inference(spm,[status(thm)],[c_0_51,c_0_77]) ).
cnf(c_0_82,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)))
| ~ is_a_theorem(equivalent(equivalent(X5,X2),equivalent(equivalent(X3,X5),X4))) ),
inference(spm,[status(thm)],[c_0_78,c_0_34]) ).
cnf(c_0_83,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X2)),X3)),X3)),
inference(spm,[status(thm)],[c_0_35,c_0_79]) ).
cnf(c_0_84,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(equivalent(X1,equivalent(X5,X5)),X3)),X4)) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X3)),equivalent(equivalent(X4,X2),X5))),equivalent(equivalent(X4,X1),X5))),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_86,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X3,X4),equivalent(equivalent(X4,X3),X2)))) ),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_87,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)),equivalent(equivalent(X3,X2),X4))),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_88,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X2,X3),X4))),X4)),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_89,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(equivalent(X3,X2),X4))),X4)),
inference(spm,[status(thm)],[c_0_32,c_0_37]) ).
cnf(c_0_90,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3))),
inference(spm,[status(thm)],[c_0_68,c_0_88]) ).
cnf(c_0_91,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X4),X5))
| ~ is_a_theorem(equivalent(X4,equivalent(X1,equivalent(equivalent(X3,X2),X5)))) ),
inference(spm,[status(thm)],[c_0_44,c_0_89]) ).
cnf(c_0_92,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X3,X2),equivalent(X3,X1)),X4)),X4)),
inference(spm,[status(thm)],[c_0_86,c_0_90]) ).
cnf(c_0_93,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
inference(fof_simplification,[status(thm)],[prove_lg_2]) ).
cnf(c_0_94,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4))
| ~ is_a_theorem(equivalent(equivalent(X5,X3),equivalent(X5,equivalent(equivalent(X2,X1),X4)))) ),
inference(spm,[status(thm)],[c_0_11,c_0_91]) ).
cnf(c_0_95,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(equivalent(X4,X2),equivalent(X4,X3))),X1))),
inference(spm,[status(thm)],[c_0_68,c_0_92]) ).
cnf(c_0_96,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
c_0_93 ).
cnf(c_0_97,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL105-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n027.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 May 3 09:29:20 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.nlkuvq9gyt/E---3.1_27577.p
% 231.15/29.67 # Version: 3.1.0
% 231.15/29.67 # Preprocessing class: FSSSSMSSSSSNFFN.
% 231.15/29.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 231.15/29.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 231.15/29.67 # Starting new_bool_3 with 300s (1) cores
% 231.15/29.67 # Starting new_bool_1 with 300s (1) cores
% 231.15/29.67 # Starting sh5l with 300s (1) cores
% 231.15/29.67 # sh5l with pid 27658 completed with status 0
% 231.15/29.67 # Result found by sh5l
% 231.15/29.67 # Preprocessing class: FSSSSMSSSSSNFFN.
% 231.15/29.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 231.15/29.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 231.15/29.67 # Starting new_bool_3 with 300s (1) cores
% 231.15/29.67 # Starting new_bool_1 with 300s (1) cores
% 231.15/29.67 # Starting sh5l with 300s (1) cores
% 231.15/29.67 # SinE strategy is gf500_gu_R04_F100_L20000
% 231.15/29.67 # Search class: FHUNS-FFSF22-MFFFFFNN
% 231.15/29.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 231.15/29.67 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 163s (1) cores
% 231.15/29.67 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 27665 completed with status 0
% 231.15/29.67 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 231.15/29.67 # Preprocessing class: FSSSSMSSSSSNFFN.
% 231.15/29.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 231.15/29.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 231.15/29.67 # Starting new_bool_3 with 300s (1) cores
% 231.15/29.67 # Starting new_bool_1 with 300s (1) cores
% 231.15/29.67 # Starting sh5l with 300s (1) cores
% 231.15/29.67 # SinE strategy is gf500_gu_R04_F100_L20000
% 231.15/29.67 # Search class: FHUNS-FFSF22-MFFFFFNN
% 231.15/29.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 231.15/29.67 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 163s (1) cores
% 231.15/29.67 # Preprocessing time : 0.001 s
% 231.15/29.67
% 231.15/29.67 # Proof found!
% 231.15/29.67 # SZS status Unsatisfiable
% 231.15/29.67 # SZS output start CNFRefutation
% See solution above
% 231.15/29.67 # Parsed axioms : 5
% 231.15/29.67 # Removed by relevancy pruning/SinE : 0
% 231.15/29.67 # Initial clauses : 5
% 231.15/29.67 # Removed in clause preprocessing : 0
% 231.15/29.67 # Initial clauses in saturation : 5
% 231.15/29.67 # Processed clauses : 232802
% 231.15/29.67 # ...of these trivial : 27133
% 231.15/29.67 # ...subsumed : 201740
% 231.15/29.67 # ...remaining for further processing : 3929
% 231.15/29.67 # Other redundant clauses eliminated : 0
% 231.15/29.67 # Clauses deleted for lack of memory : 0
% 231.15/29.67 # Backward-subsumed : 35
% 231.15/29.67 # Backward-rewritten : 186
% 231.15/29.67 # Generated clauses : 2894003
% 231.15/29.67 # ...of the previous two non-redundant : 2257862
% 231.15/29.67 # ...aggressively subsumed : 0
% 231.15/29.67 # Contextual simplify-reflections : 0
% 231.15/29.67 # Paramodulations : 2894003
% 231.15/29.67 # Factorizations : 0
% 231.15/29.67 # NegExts : 0
% 231.15/29.67 # Equation resolutions : 0
% 231.15/29.67 # Disequality decompositions : 0
% 231.15/29.67 # Total rewrite steps : 832311
% 231.15/29.67 # ...of those cached : 823957
% 231.15/29.67 # Propositional unsat checks : 0
% 231.15/29.67 # Propositional check models : 0
% 231.15/29.67 # Propositional check unsatisfiable : 0
% 231.15/29.67 # Propositional clauses : 0
% 231.15/29.67 # Propositional clauses after purity: 0
% 231.15/29.67 # Propositional unsat core size : 0
% 231.15/29.67 # Propositional preprocessing time : 0.000
% 231.15/29.67 # Propositional encoding time : 0.000
% 231.15/29.67 # Propositional solver time : 0.000
% 231.15/29.67 # Success case prop preproc time : 0.000
% 231.15/29.67 # Success case prop encoding time : 0.000
% 231.15/29.67 # Success case prop solver time : 0.000
% 231.15/29.67 # Current number of processed clauses : 3708
% 231.15/29.67 # Positive orientable unit clauses : 1531
% 231.15/29.67 # Positive unorientable unit clauses: 0
% 231.15/29.67 # Negative unit clauses : 0
% 231.15/29.67 # Non-unit-clauses : 2177
% 231.15/29.67 # Current number of unprocessed clauses: 2022270
% 231.15/29.67 # ...number of literals in the above : 3139477
% 231.15/29.67 # Current number of archived formulas : 0
% 231.15/29.67 # Current number of archived clauses : 221
% 231.15/29.67 # Clause-clause subsumption calls (NU) : 14605259
% 231.15/29.67 # Rec. Clause-clause subsumption calls : 14584260
% 231.15/29.67 # Non-unit clause-clause subsumptions : 201775
% 231.15/29.67 # Unit Clause-clause subsumption calls : 10712
% 231.15/29.67 # Rewrite failures with RHS unbound : 0
% 231.15/29.67 # BW rewrite match attempts : 1789702
% 231.15/29.67 # BW rewrite match successes : 186
% 231.15/29.67 # Condensation attempts : 232802
% 231.15/29.67 # Condensation successes : 0
% 231.15/29.67 # Termbank termtop insertions : 43340536
% 231.15/29.67 # Search garbage collected termcells : 8
% 231.15/29.67
% 231.15/29.67 # -------------------------------------------------
% 231.15/29.67 # User time : 28.044 s
% 231.15/29.67 # System time : 0.807 s
% 231.15/29.67 # Total time : 28.851 s
% 231.15/29.67 # Maximum resident set size: 1696 pages
% 231.15/29.67
% 231.15/29.67 # -------------------------------------------------
% 231.15/29.67 # User time : 28.045 s
% 231.15/29.67 # System time : 0.810 s
% 231.15/29.67 # Total time : 28.855 s
% 231.15/29.67 # Maximum resident set size: 1752 pages
% 231.15/29.67 % E---3.1 exiting
%------------------------------------------------------------------------------