TSTP Solution File: LCL167-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL167-1 : TPTP v8.1.2. Released v1.0.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:46 EDT 2023
% Result : Unsatisfiable 2.56s 0.75s
% Output : CNFRefutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 3
% Syntax : Number of clauses : 56 ( 15 unt; 0 nHn; 32 RR)
% Number of literals : 125 ( 0 equ; 71 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 149 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.EZVZAkvTfZ/E---3.1_24697.p',condensed_detachment) ).
cnf(xhk,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,X3),X2)))),
file('/export/starexec/sandbox2/tmp/tmp.EZVZAkvTfZ/E---3.1_24697.p',xhk) ).
cnf(prove_yro,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(c,b),a)))),
file('/export/starexec/sandbox2/tmp/tmp.EZVZAkvTfZ/E---3.1_24697.p',prove_yro) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,X3),X2)))),
xhk ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),X4)))
| ~ is_a_theorem(equivalent(X4,X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_10,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_11,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X4,X3),X2)))
| ~ is_a_theorem(equivalent(X1,X4)) ),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_12,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X4,X3),X2))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_13,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_5]) ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X1,X3),X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_4]) ).
cnf(c_0_18,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_4]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_20,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X3,X4),X2),X1)),X4))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_4]) ).
cnf(c_0_22,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X3),X1),X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_5]) ).
cnf(c_0_23,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(equivalent(equivalent(X4,X3),X2),X1)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X2),X3))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X1)),X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_4]) ).
cnf(c_0_26,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X2))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_24]) ).
cnf(c_0_27,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_28,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_4]) ).
cnf(c_0_29,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X1))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_4]) ).
cnf(c_0_30,plain,
( is_a_theorem(equivalent(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_31,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_4]) ).
cnf(c_0_33,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),X1)),X3)),
inference(spm,[status(thm)],[c_0_33,c_0_4]) ).
cnf(c_0_35,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_34]) ).
cnf(c_0_36,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X3,X3),X2),X1))),
inference(spm,[status(thm)],[c_0_35,c_0_4]) ).
cnf(c_0_37,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X1),X2),X3),equivalent(X3,X2))),
inference(spm,[status(thm)],[c_0_33,c_0_36]) ).
cnf(c_0_38,plain,
( is_a_theorem(equivalent(equivalent(X1,X1),X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_37]) ).
cnf(c_0_39,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(equivalent(X3,X2),X1))) ),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_40,plain,
is_a_theorem(equivalent(equivalent(X1,X1),equivalent(equivalent(equivalent(X2,X3),X3),X2))),
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_41,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X1),X2)),
inference(spm,[status(thm)],[c_0_39,c_0_4]) ).
cnf(c_0_42,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_20,c_0_29]) ).
cnf(c_0_43,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_40]),c_0_32])]) ).
cnf(c_0_44,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_41]) ).
cnf(c_0_45,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X2),X3))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X2,X1))) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X1),X3))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_41]) ).
cnf(c_0_48,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(equivalent(X3,X2),X3),X1))) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
inference(spm,[status(thm)],[c_0_48,c_0_4]) ).
cnf(c_0_50,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_49]) ).
cnf(c_0_51,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X3,X2)),X1)),
inference(spm,[status(thm)],[c_0_50,c_0_34]) ).
cnf(c_0_52,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(c,b),a)))),
prove_yro ).
cnf(c_0_54,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(equivalent(X3,X2),X1)))),
inference(spm,[status(thm)],[c_0_52,c_0_34]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL167-1 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 13:12:21 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.EZVZAkvTfZ/E---3.1_24697.p
% 2.56/0.75 # Version: 3.1pre001
% 2.56/0.75 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.56/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.56/0.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.56/0.75 # Starting new_bool_3 with 300s (1) cores
% 2.56/0.75 # Starting new_bool_1 with 300s (1) cores
% 2.56/0.75 # Starting sh5l with 300s (1) cores
% 2.56/0.75 # sh5l with pid 24778 completed with status 0
% 2.56/0.75 # Result found by sh5l
% 2.56/0.75 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.56/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.56/0.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.56/0.75 # Starting new_bool_3 with 300s (1) cores
% 2.56/0.75 # Starting new_bool_1 with 300s (1) cores
% 2.56/0.75 # Starting sh5l with 300s (1) cores
% 2.56/0.75 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.56/0.75 # Search class: FHUNF-FFSF22-MFFFFFNN
% 2.56/0.75 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.56/0.75 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 2.56/0.75 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 24786 completed with status 0
% 2.56/0.75 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 2.56/0.75 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.56/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.56/0.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.56/0.75 # Starting new_bool_3 with 300s (1) cores
% 2.56/0.75 # Starting new_bool_1 with 300s (1) cores
% 2.56/0.75 # Starting sh5l with 300s (1) cores
% 2.56/0.75 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.56/0.75 # Search class: FHUNF-FFSF22-MFFFFFNN
% 2.56/0.75 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.56/0.75 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 2.56/0.75 # Preprocessing time : 0.001 s
% 2.56/0.75
% 2.56/0.75 # Proof found!
% 2.56/0.75 # SZS status Unsatisfiable
% 2.56/0.75 # SZS output start CNFRefutation
% See solution above
% 2.56/0.75 # Parsed axioms : 3
% 2.56/0.75 # Removed by relevancy pruning/SinE : 0
% 2.56/0.75 # Initial clauses : 3
% 2.56/0.75 # Removed in clause preprocessing : 0
% 2.56/0.75 # Initial clauses in saturation : 3
% 2.56/0.75 # Processed clauses : 6157
% 2.56/0.75 # ...of these trivial : 797
% 2.56/0.75 # ...subsumed : 4750
% 2.56/0.75 # ...remaining for further processing : 610
% 2.56/0.75 # Other redundant clauses eliminated : 0
% 2.56/0.75 # Clauses deleted for lack of memory : 0
% 2.56/0.75 # Backward-subsumed : 4
% 2.56/0.75 # Backward-rewritten : 3
% 2.56/0.75 # Generated clauses : 43398
% 2.56/0.75 # ...of the previous two non-redundant : 26336
% 2.56/0.75 # ...aggressively subsumed : 0
% 2.56/0.75 # Contextual simplify-reflections : 0
% 2.56/0.75 # Paramodulations : 43398
% 2.56/0.75 # Factorizations : 0
% 2.56/0.75 # NegExts : 0
% 2.56/0.75 # Equation resolutions : 0
% 2.56/0.75 # Total rewrite steps : 18655
% 2.56/0.75 # Propositional unsat checks : 0
% 2.56/0.75 # Propositional check models : 0
% 2.56/0.75 # Propositional check unsatisfiable : 0
% 2.56/0.75 # Propositional clauses : 0
% 2.56/0.75 # Propositional clauses after purity: 0
% 2.56/0.75 # Propositional unsat core size : 0
% 2.56/0.75 # Propositional preprocessing time : 0.000
% 2.56/0.75 # Propositional encoding time : 0.000
% 2.56/0.75 # Propositional solver time : 0.000
% 2.56/0.75 # Success case prop preproc time : 0.000
% 2.56/0.75 # Success case prop encoding time : 0.000
% 2.56/0.75 # Success case prop solver time : 0.000
% 2.56/0.75 # Current number of processed clauses : 603
% 2.56/0.75 # Positive orientable unit clauses : 343
% 2.56/0.75 # Positive unorientable unit clauses: 0
% 2.56/0.75 # Negative unit clauses : 0
% 2.56/0.75 # Non-unit-clauses : 260
% 2.56/0.75 # Current number of unprocessed clauses: 20142
% 2.56/0.75 # ...number of literals in the above : 42334
% 2.56/0.75 # Current number of archived formulas : 0
% 2.56/0.75 # Current number of archived clauses : 7
% 2.56/0.75 # Clause-clause subsumption calls (NU) : 53340
% 2.56/0.75 # Rec. Clause-clause subsumption calls : 53086
% 2.56/0.75 # Non-unit clause-clause subsumptions : 4754
% 2.56/0.75 # Unit Clause-clause subsumption calls : 1244
% 2.56/0.75 # Rewrite failures with RHS unbound : 0
% 2.56/0.75 # BW rewrite match attempts : 53606
% 2.56/0.75 # BW rewrite match successes : 3
% 2.56/0.75 # Condensation attempts : 0
% 2.56/0.75 # Condensation successes : 0
% 2.56/0.75 # Termbank termtop insertions : 420197
% 2.56/0.75
% 2.56/0.75 # -------------------------------------------------
% 2.56/0.75 # User time : 0.315 s
% 2.56/0.75 # System time : 0.006 s
% 2.56/0.75 # Total time : 0.321 s
% 2.56/0.75 # Maximum resident set size: 1628 pages
% 2.56/0.75
% 2.56/0.75 # -------------------------------------------------
% 2.56/0.75 # User time : 0.315 s
% 2.56/0.75 # System time : 0.008 s
% 2.56/0.75 # Total time : 0.324 s
% 2.56/0.75 # Maximum resident set size: 1676 pages
% 2.56/0.75 % E---3.1 exiting
% 2.56/0.75 % E---3.1 exiting
%------------------------------------------------------------------------------