TSTP Solution File: LCL096-10 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : LCL096-10 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : Mon Jun 24 10:43:19 EDT 2024
% Result : Unsatisfiable 18.09s 2.75s
% Output : CNFRefutation 18.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 4 RR)
% Number of literals : 47 ( 46 equ; 3 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 : 149 ( 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.HVkhLbLhud/E---3.1_22597.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)) = true,
file('/export/starexec/sandbox2/tmp/tmp.HVkhLbLhud/E---3.1_22597.p',lg_2) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.HVkhLbLhud/E---3.1_22597.p',ifeq_axiom) ).
cnf(lg_4,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))) = true,
file('/export/starexec/sandbox2/tmp/tmp.HVkhLbLhud/E---3.1_22597.p',lg_4) ).
cnf(lg_3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)) = true,
file('/export/starexec/sandbox2/tmp/tmp.HVkhLbLhud/E---3.1_22597.p',lg_3) ).
cnf(prove_lg_1,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)) != true,
file('/export/starexec/sandbox2/tmp/tmp.HVkhLbLhud/E---3.1_22597.p',prove_lg_1) ).
cnf(c_0_6,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_7,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)) = true,
lg_2 ).
cnf(c_0_8,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_9,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))) = true,
lg_4 ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(equivalent(X4,X2),equivalent(X4,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]) ).
cnf(c_0_12,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3))),true,is_a_theorem(equivalent(equivalent(X4,X2),equivalent(X4,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_8]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_8]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_8]) ).
cnf(c_0_15,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3))),true,is_a_theorem(equivalent(X2,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_14]),c_0_8]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_8]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_8]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(X1,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_8]) ).
cnf(c_0_19,plain,
is_a_theorem(equivalent(equivalent(X1,X1),equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_17]),c_0_8]) ).
cnf(c_0_20,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_6,c_0_18]),c_0_8]) ).
cnf(c_0_21,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)) = true,
lg_3 ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4))),equivalent(X1,equivalent(X3,X4)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_8]) ).
cnf(c_0_23,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4),X5)),true,is_a_theorem(X5),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_8]) ).
cnf(c_0_25,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4)))),true,is_a_theorem(equivalent(X1,equivalent(X3,X4))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_22]),c_0_8]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_8]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_10]),c_0_8]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)),equivalent(equivalent(X3,X2),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_8]) ).
cnf(c_0_29,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X2),X1)),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_17]),c_0_8]) ).
cnf(c_0_30,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(equivalent(X2,X4),X1),equivalent(X4,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_27]),c_0_8]) ).
cnf(c_0_31,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X2),X3)),equivalent(X1,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_28]),c_0_8]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X1),X2),X3),equivalent(X2,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_8]) ).
cnf(c_0_33,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_27]),c_0_8]) ).
cnf(c_0_34,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X3))),true,is_a_theorem(equivalent(X1,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_31]),c_0_8]) ).
cnf(c_0_35,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X3)),true,is_a_theorem(equivalent(X2,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_32]),c_0_8]) ).
cnf(c_0_36,plain,
ifeq(is_a_theorem(equivalent(X1,X2)),true,is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_33]),c_0_8]) ).
cnf(c_0_37,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_28]),c_0_8]) ).
cnf(c_0_38,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_35,c_0_33]),c_0_8]) ).
cnf(c_0_39,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X4))),equivalent(X1,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_8]) ).
cnf(c_0_40,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,equivalent(X3,equivalent(equivalent(X3,equivalent(X4,X4)),X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_38]),c_0_8]) ).
cnf(c_0_41,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)) != true,
inference(fof_simplification,[status(thm)],[prove_lg_1]) ).
cnf(c_0_42,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X4)))),true,is_a_theorem(equivalent(X1,X4)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_39]),c_0_8]) ).
cnf(c_0_43,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,equivalent(equivalent(X1,equivalent(X4,X4)),X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_40]),c_0_8]) ).
cnf(c_0_44,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)) != true,
c_0_41 ).
cnf(c_0_45,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,X2),X1)),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_8]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL096-10 : TPTP v8.2.0. Released v7.3.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.31 % Computer : n029.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Sat Jun 22 16:22:24 EDT 2024
% 0.12/0.31 % CPUTime :
% 0.18/0.48 Running first-order theorem proving
% 0.18/0.48 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.HVkhLbLhud/E---3.1_22597.p
% 18.09/2.75 # Version: 3.2.0
% 18.09/2.75 # Preprocessing class: FSSSSMSSSSSNFFN.
% 18.09/2.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.09/2.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 18.09/2.75 # Starting new_bool_3 with 300s (1) cores
% 18.09/2.75 # Starting new_bool_1 with 300s (1) cores
% 18.09/2.75 # Starting sh5l with 300s (1) cores
% 18.09/2.75 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 22678 completed with status 0
% 18.09/2.75 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 18.09/2.75 # Preprocessing class: FSSSSMSSSSSNFFN.
% 18.09/2.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.09/2.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 18.09/2.75 # No SInE strategy applied
% 18.09/2.75 # Search class: FUUPM-FFSF32-DFFFFFNN
% 18.09/2.75 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.09/2.75 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN with 811s (1) cores
% 18.09/2.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 18.09/2.75 # Starting new_bool_3 with 136s (1) cores
% 18.09/2.75 # Starting new_bool_1 with 136s (1) cores
% 18.09/2.75 # Starting sh5l with 136s (1) cores
% 18.09/2.75 # G----_X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN with pid 22682 completed with status 0
% 18.09/2.75 # Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN
% 18.09/2.75 # Preprocessing class: FSSSSMSSSSSNFFN.
% 18.09/2.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.09/2.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 18.09/2.75 # No SInE strategy applied
% 18.09/2.75 # Search class: FUUPM-FFSF32-DFFFFFNN
% 18.09/2.75 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.09/2.75 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN with 811s (1) cores
% 18.09/2.75 # Preprocessing time : 0.001 s
% 18.09/2.75 # Presaturation interreduction done
% 18.09/2.75
% 18.09/2.75 # Proof found!
% 18.09/2.75 # SZS status Unsatisfiable
% 18.09/2.75 # SZS output start CNFRefutation
% See solution above
% 18.09/2.75 # Parsed axioms : 6
% 18.09/2.75 # Removed by relevancy pruning/SinE : 0
% 18.09/2.75 # Initial clauses : 6
% 18.09/2.75 # Removed in clause preprocessing : 0
% 18.09/2.75 # Initial clauses in saturation : 6
% 18.09/2.75 # Processed clauses : 1317
% 18.09/2.75 # ...of these trivial : 543
% 18.09/2.75 # ...subsumed : 0
% 18.09/2.75 # ...remaining for further processing : 774
% 18.09/2.75 # Other redundant clauses eliminated : 0
% 18.09/2.75 # Clauses deleted for lack of memory : 0
% 18.09/2.75 # Backward-subsumed : 0
% 18.09/2.75 # Backward-rewritten : 24
% 18.09/2.75 # Generated clauses : 210389
% 18.09/2.75 # ...of the previous two non-redundant : 134094
% 18.09/2.75 # ...aggressively subsumed : 0
% 18.09/2.75 # Contextual simplify-reflections : 0
% 18.09/2.75 # Paramodulations : 210389
% 18.09/2.75 # Factorizations : 0
% 18.09/2.75 # NegExts : 0
% 18.09/2.75 # Equation resolutions : 0
% 18.09/2.75 # Disequality decompositions : 0
% 18.09/2.75 # Total rewrite steps : 224051
% 18.09/2.75 # ...of those cached : 160582
% 18.09/2.75 # Propositional unsat checks : 0
% 18.09/2.75 # Propositional check models : 0
% 18.09/2.75 # Propositional check unsatisfiable : 0
% 18.09/2.75 # Propositional clauses : 0
% 18.09/2.75 # Propositional clauses after purity: 0
% 18.09/2.75 # Propositional unsat core size : 0
% 18.09/2.75 # Propositional preprocessing time : 0.000
% 18.09/2.75 # Propositional encoding time : 0.000
% 18.09/2.75 # Propositional solver time : 0.000
% 18.09/2.75 # Success case prop preproc time : 0.000
% 18.09/2.75 # Success case prop encoding time : 0.000
% 18.09/2.75 # Success case prop solver time : 0.000
% 18.09/2.75 # Current number of processed clauses : 744
% 18.09/2.75 # Positive orientable unit clauses : 744
% 18.09/2.75 # Positive unorientable unit clauses: 0
% 18.09/2.75 # Negative unit clauses : 0
% 18.09/2.75 # Non-unit-clauses : 0
% 18.09/2.75 # Current number of unprocessed clauses: 132778
% 18.09/2.75 # ...number of literals in the above : 132778
% 18.09/2.75 # Current number of archived formulas : 0
% 18.09/2.75 # Current number of archived clauses : 30
% 18.09/2.75 # Clause-clause subsumption calls (NU) : 0
% 18.09/2.75 # Rec. Clause-clause subsumption calls : 0
% 18.09/2.75 # Non-unit clause-clause subsumptions : 0
% 18.09/2.75 # Unit Clause-clause subsumption calls : 0
% 18.09/2.75 # Rewrite failures with RHS unbound : 0
% 18.09/2.75 # BW rewrite match attempts : 133814
% 18.09/2.75 # BW rewrite match successes : 24
% 18.09/2.75 # Condensation attempts : 0
% 18.09/2.75 # Condensation successes : 0
% 18.09/2.75 # Termbank termtop insertions : 3301848
% 18.09/2.75 # Search garbage collected termcells : 2
% 18.09/2.75
% 18.09/2.75 # -------------------------------------------------
% 18.09/2.75 # User time : 2.118 s
% 18.09/2.75 # System time : 0.095 s
% 18.09/2.75 # Total time : 2.213 s
% 18.09/2.75 # Maximum resident set size: 1552 pages
% 18.09/2.75
% 18.09/2.75 # -------------------------------------------------
% 18.09/2.75 # User time : 10.988 s
% 18.09/2.75 # System time : 0.187 s
% 18.09/2.75 # Total time : 11.175 s
% 18.09/2.75 # Maximum resident set size: 1688 pages
% 18.09/2.75 % E---3.1 exiting
% 18.09/2.75 % E exiting
%------------------------------------------------------------------------------