TSTP Solution File: LCL024-10 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL024-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:11:17 EDT 2023
% Result : Unsatisfiable 189.16s 24.94s
% Output : CNFRefutation 189.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 4
% Syntax : Number of clauses : 77 ( 77 unt; 0 nHn; 3 RR)
% Number of literals : 77 ( 76 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 249 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
ifeq(is_a_theorem(equivalent(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.Tjq56S6SHu/E---3.1_12154.p',condensed_detachment) ).
cnf(xgk,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2)))) = true,
file('/export/starexec/sandbox2/tmp/tmp.Tjq56S6SHu/E---3.1_12154.p',xgk) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.Tjq56S6SHu/E---3.1_12154.p',ifeq_axiom) ).
cnf(prove_pyo,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))) != true,
file('/export/starexec/sandbox2/tmp/tmp.Tjq56S6SHu/E---3.1_12154.p',prove_pyo) ).
cnf(c_0_4,axiom,
ifeq(is_a_theorem(equivalent(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
condensed_detachment ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2)))) = true,
xgk ).
cnf(c_0_6,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_7,plain,
ifeq(is_a_theorem(X1),true,is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_8,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_9,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(equivalent(X4,equivalent(X5,X3)),equivalent(X5,X4))))),equivalent(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_6]) ).
cnf(c_0_10,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,X1)),equivalent(X3,X4)),X4)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_6]) ).
cnf(c_0_11,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,X1)),equivalent(X3,X4))),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_10]),c_0_6]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(X1,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_6]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X3))),equivalent(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_6]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_6]) ).
cnf(c_0_15,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,equivalent(X3,X4)),X4))),equivalent(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_14]),c_0_6]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X2,X1)),X3)),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_15]),c_0_6]) ).
cnf(c_0_17,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X3)))),true,is_a_theorem(equivalent(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_13]),c_0_6]) ).
cnf(c_0_18,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X2,X1)),X3))),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_16]),c_0_6]) ).
cnf(c_0_19,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X1,equivalent(X3,X3)))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_6]) ).
cnf(c_0_20,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X1,X2)),X2),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_14]),c_0_6]) ).
cnf(c_0_21,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),equivalent(X2,equivalent(X3,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_6]) ).
cnf(c_0_22,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(equivalent(X4,equivalent(X5,X3)),equivalent(X5,X4)))))),true,is_a_theorem(equivalent(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_6]) ).
cnf(c_0_23,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,equivalent(X3,X2)),equivalent(X1,equivalent(X4,X4)))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_6]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X1,equivalent(equivalent(X3,equivalent(X3,X4)),X4)))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_6]) ).
cnf(c_0_25,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X1)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_21]),c_0_6]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X3,equivalent(X3,X1)))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_6]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,equivalent(X4,equivalent(X5,X5))),equivalent(X4,X3)))),equivalent(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_6]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,equivalent(X3,X2)),X1)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_24]),c_0_6]) ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X4,equivalent(X4,X3))))),equivalent(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_25]),c_0_6]) ).
cnf(c_0_30,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X3,equivalent(X3,X1))))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_26]),c_0_6]) ).
cnf(c_0_31,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,equivalent(X1,equivalent(X3,X3))),X4)),X4)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_27]),c_0_6]) ).
cnf(c_0_32,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,equivalent(X3,X4)),X4)))),true,is_a_theorem(equivalent(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_15]),c_0_6]) ).
cnf(c_0_33,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),equivalent(equivalent(X3,equivalent(X4,X2)),equivalent(X4,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_28]),c_0_6]) ).
cnf(c_0_34,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X1,X2)),equivalent(X2,X3)),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_29]),c_0_6]) ).
cnf(c_0_35,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X3))),equivalent(X4,equivalent(X4,equivalent(X2,X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_6]) ).
cnf(c_0_36,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,equivalent(X1,equivalent(X3,X3))),X4))),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_31]),c_0_6]) ).
cnf(c_0_37,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X2,X1)),X3)),equivalent(X4,equivalent(X4,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_6]) ).
cnf(c_0_38,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X3,X2)),equivalent(X4,equivalent(X1,equivalent(X5,X5)))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_10]),c_0_6]) ).
cnf(c_0_39,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_6]) ).
cnf(c_0_40,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),equivalent(X2,X3))),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_34]),c_0_6]) ).
cnf(c_0_41,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,equivalent(X2,X1)),equivalent(X4,X4))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_35]),c_0_6]) ).
cnf(c_0_42,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X1,X2)),X3),equivalent(X2,equivalent(X4,X4))),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_6]) ).
cnf(c_0_43,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,X1)),equivalent(X4,equivalent(X4,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_38]),c_0_6]) ).
cnf(c_0_44,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(X2,X2))),true,is_a_theorem(X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_39]),c_0_6]) ).
cnf(c_0_45,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X3,equivalent(X2,X1))))),equivalent(X4,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_6]) ).
cnf(c_0_46,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X1,X2)),X3),equivalent(X2,equivalent(X4,X4)))),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_42]),c_0_6]) ).
cnf(c_0_47,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,equivalent(X1,X3)),equivalent(X4,X4))),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_43]),c_0_6]) ).
cnf(c_0_48,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X3,equivalent(X2,X1)))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_6]) ).
cnf(c_0_49,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,equivalent(X2,equivalent(X3,X3)))),equivalent(X4,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_6]) ).
cnf(c_0_50,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X3,equivalent(X2,X1))))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_48]),c_0_6]) ).
cnf(c_0_51,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,equivalent(X2,equivalent(X3,X3))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_49]),c_0_6]) ).
cnf(c_0_52,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,equivalent(X1,X3)),equivalent(X4,X4)))),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_47]),c_0_6]) ).
cnf(c_0_53,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,equivalent(X3,equivalent(X2,X1)))),equivalent(X4,X4)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_6]) ).
cnf(c_0_54,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,X1),X2)),true,is_a_theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_12]),c_0_6]) ).
cnf(c_0_55,plain,
ifeq(is_a_theorem(equivalent(X1,X2)),true,is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X3)))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_51]),c_0_6]) ).
cnf(c_0_56,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X1,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_6]) ).
cnf(c_0_57,plain,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(X2,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_13]),c_0_6]) ).
cnf(c_0_58,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,X2)),equivalent(X3,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_6]) ).
cnf(c_0_59,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X3,equivalent(X4,X4))))),equivalent(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_57]),c_0_6]) ).
cnf(c_0_60,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X1)),X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_58]),c_0_6]) ).
cnf(c_0_61,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X1,equivalent(X3,equivalent(X3,equivalent(X4,X4)))))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_59]),c_0_6]) ).
cnf(c_0_62,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,equivalent(X4,X3)),X4))),equivalent(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_60]),c_0_6]) ).
cnf(c_0_63,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X3)),equivalent(X2,X1)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_61]),c_0_6]) ).
cnf(c_0_64,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,X2)),X3)),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_62]),c_0_6]) ).
cnf(c_0_65,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),equivalent(equivalent(X3,equivalent(X4,X1)),equivalent(X4,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_63]),c_0_6]) ).
cnf(c_0_66,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,X2)),X3))),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_64]),c_0_6]) ).
cnf(c_0_67,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),equivalent(X3,equivalent(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_26]),c_0_6]) ).
cnf(c_0_68,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(X2,X2))),true,is_a_theorem(equivalent(equivalent(X3,equivalent(X4,X1)),equivalent(X4,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_65]),c_0_6]) ).
cnf(c_0_69,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X2,X1)),equivalent(X3,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_41]),c_0_6]) ).
cnf(c_0_70,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X1,X2)),equivalent(X3,equivalent(X3,X2))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_67]),c_0_6]) ).
cnf(c_0_71,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X4),equivalent(X4,X3)))),equivalent(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_6]) ).
cnf(c_0_72,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X3,equivalent(X2,X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_6]) ).
cnf(c_0_73,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X3,equivalent(X2,X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_72]),c_0_6]) ).
cnf(c_0_74,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))) != true,
prove_pyo ).
cnf(c_0_75,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X3),equivalent(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_73]),c_0_6]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL024-10 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 13:00:51 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.Tjq56S6SHu/E---3.1_12154.p
% 189.16/24.94 # Version: 3.1pre001
% 189.16/24.94 # Preprocessing class: FSSSSMSSSSSNFFN.
% 189.16/24.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 189.16/24.94 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 189.16/24.94 # Starting new_bool_3 with 300s (1) cores
% 189.16/24.94 # Starting new_bool_1 with 300s (1) cores
% 189.16/24.94 # Starting sh5l with 300s (1) cores
% 189.16/24.94 # sh5l with pid 12235 completed with status 0
% 189.16/24.94 # Result found by sh5l
% 189.16/24.94 # Preprocessing class: FSSSSMSSSSSNFFN.
% 189.16/24.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 189.16/24.94 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 189.16/24.94 # Starting new_bool_3 with 300s (1) cores
% 189.16/24.94 # Starting new_bool_1 with 300s (1) cores
% 189.16/24.94 # Starting sh5l with 300s (1) cores
% 189.16/24.94 # SinE strategy is gf500_gu_R04_F100_L20000
% 189.16/24.94 # Search class: FUUPS-FFSF32-MFFFFFNN
% 189.16/24.94 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 189.16/24.94 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 189.16/24.94 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 12239 completed with status 0
% 189.16/24.94 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 189.16/24.94 # Preprocessing class: FSSSSMSSSSSNFFN.
% 189.16/24.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 189.16/24.94 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 189.16/24.94 # Starting new_bool_3 with 300s (1) cores
% 189.16/24.94 # Starting new_bool_1 with 300s (1) cores
% 189.16/24.94 # Starting sh5l with 300s (1) cores
% 189.16/24.94 # SinE strategy is gf500_gu_R04_F100_L20000
% 189.16/24.94 # Search class: FUUPS-FFSF32-MFFFFFNN
% 189.16/24.94 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 189.16/24.94 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 189.16/24.94 # Preprocessing time : 0.001 s
% 189.16/24.94 # Presaturation interreduction done
% 189.16/24.94
% 189.16/24.94 # Proof found!
% 189.16/24.94 # SZS status Unsatisfiable
% 189.16/24.94 # SZS output start CNFRefutation
% See solution above
% 189.16/24.94 # Parsed axioms : 4
% 189.16/24.94 # Removed by relevancy pruning/SinE : 0
% 189.16/24.94 # Initial clauses : 4
% 189.16/24.94 # Removed in clause preprocessing : 0
% 189.16/24.94 # Initial clauses in saturation : 4
% 189.16/24.94 # Processed clauses : 6004
% 189.16/24.94 # ...of these trivial : 3512
% 189.16/24.94 # ...subsumed : 0
% 189.16/24.94 # ...remaining for further processing : 2492
% 189.16/24.94 # Other redundant clauses eliminated : 0
% 189.16/24.94 # Clauses deleted for lack of memory : 0
% 189.16/24.94 # Backward-subsumed : 0
% 189.16/24.94 # Backward-rewritten : 27
% 189.16/24.94 # Generated clauses : 1561241
% 189.16/24.94 # ...of the previous two non-redundant : 1133223
% 189.16/24.94 # ...aggressively subsumed : 0
% 189.16/24.94 # Contextual simplify-reflections : 0
% 189.16/24.94 # Paramodulations : 1561241
% 189.16/24.94 # Factorizations : 0
% 189.16/24.94 # NegExts : 0
% 189.16/24.94 # Equation resolutions : 0
% 189.16/24.94 # Total rewrite steps : 1457958
% 189.16/24.94 # Propositional unsat checks : 0
% 189.16/24.94 # Propositional check models : 0
% 189.16/24.94 # Propositional check unsatisfiable : 0
% 189.16/24.94 # Propositional clauses : 0
% 189.16/24.94 # Propositional clauses after purity: 0
% 189.16/24.94 # Propositional unsat core size : 0
% 189.16/24.94 # Propositional preprocessing time : 0.000
% 189.16/24.94 # Propositional encoding time : 0.000
% 189.16/24.94 # Propositional solver time : 0.000
% 189.16/24.94 # Success case prop preproc time : 0.000
% 189.16/24.94 # Success case prop encoding time : 0.000
% 189.16/24.94 # Success case prop solver time : 0.000
% 189.16/24.94 # Current number of processed clauses : 2461
% 189.16/24.94 # Positive orientable unit clauses : 2461
% 189.16/24.94 # Positive unorientable unit clauses: 0
% 189.16/24.94 # Negative unit clauses : 0
% 189.16/24.94 # Non-unit-clauses : 0
% 189.16/24.94 # Current number of unprocessed clauses: 1127223
% 189.16/24.94 # ...number of literals in the above : 1127223
% 189.16/24.94 # Current number of archived formulas : 0
% 189.16/24.94 # Current number of archived clauses : 31
% 189.16/24.94 # Clause-clause subsumption calls (NU) : 0
% 189.16/24.94 # Rec. Clause-clause subsumption calls : 0
% 189.16/24.94 # Non-unit clause-clause subsumptions : 0
% 189.16/24.94 # Unit Clause-clause subsumption calls : 0
% 189.16/24.94 # Rewrite failures with RHS unbound : 0
% 189.16/24.94 # BW rewrite match attempts : 1495759
% 189.16/24.94 # BW rewrite match successes : 27
% 189.16/24.94 # Condensation attempts : 0
% 189.16/24.94 # Condensation successes : 0
% 189.16/24.94 # Termbank termtop insertions : 25574134
% 189.16/24.94
% 189.16/24.94 # -------------------------------------------------
% 189.16/24.94 # User time : 22.946 s
% 189.16/24.94 # System time : 0.773 s
% 189.16/24.94 # Total time : 23.719 s
% 189.16/24.94 # Maximum resident set size: 1612 pages
% 189.16/24.94
% 189.16/24.94 # -------------------------------------------------
% 189.16/24.94 # User time : 22.946 s
% 189.16/24.94 # System time : 0.777 s
% 189.16/24.94 # Total time : 23.723 s
% 189.16/24.94 # Maximum resident set size: 1672 pages
% 189.16/24.94 % E---3.1 exiting
% 189.16/24.94 % E---3.1 exiting
%------------------------------------------------------------------------------