TSTP Solution File: LCL103-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL103-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:23:44 EDT 2023
% Result : Unsatisfiable 44.58s 6.01s
% Output : CNFRefutation 44.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 4
% Syntax : Number of clauses : 39 ( 18 unt; 0 nHn; 20 RR)
% Number of literals : 65 ( 0 equ; 28 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 : 128 ( 0 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.nSl4pJyt3e/E---3.1_22132.p',condensed_detachment) ).
cnf(q_3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)),X3)),
file('/export/starexec/sandbox2/tmp/tmp.nSl4pJyt3e/E---3.1_22132.p',q_3) ).
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/sandbox2/tmp/tmp.nSl4pJyt3e/E---3.1_22132.p',p_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/sandbox2/tmp/tmp.nSl4pJyt3e/E---3.1_22132.p',prove_lg_2) ).
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(X1,X2),equivalent(equivalent(X2,X1),X3)),X3)),
q_3 ).
cnf(c_0_6,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3)))),
p_1 ).
cnf(c_0_7,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,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_6]) ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_11,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_12,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_4,c_0_11]) ).
cnf(c_0_13,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_12,c_0_5]) ).
cnf(c_0_14,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_12,c_0_10]) ).
cnf(c_0_15,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_7,c_0_13]) ).
cnf(c_0_16,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_14,c_0_10]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,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_17]) ).
cnf(c_0_19,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X1))),
inference(spm,[status(thm)],[c_0_18,c_0_6]) ).
cnf(c_0_20,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_4,c_0_16]) ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X3),X1),X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_22,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_4,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1)))),
inference(spm,[status(thm)],[c_0_21,c_0_6]) ).
cnf(c_0_24,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_8]) ).
cnf(c_0_25,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_22,c_0_23]) ).
cnf(c_0_26,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_24,c_0_5]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X4,equivalent(X3,X2)),equivalent(X4,X1))))),
inference(spm,[status(thm)],[c_0_25,c_0_10]) ).
cnf(c_0_28,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_14,c_0_26]) ).
cnf(c_0_29,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_18,c_0_27]) ).
cnf(c_0_30,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X5,X2),equivalent(equivalent(X1,X5),X3)),X4)) ),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_31,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_28,c_0_5]) ).
cnf(c_0_32,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_22,c_0_29]) ).
cnf(c_0_33,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_30,c_0_31]) ).
cnf(c_0_34,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_18,c_0_26]) ).
cnf(c_0_35,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_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
prove_lg_2 ).
cnf(c_0_37,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_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.07 % Problem : LCL103-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.08 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n002.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 2400
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Mon Oct 2 12:35:29 EDT 2023
% 0.07/0.27 % CPUTime :
% 0.11/0.34 Running first-order model finding
% 0.11/0.34 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.nSl4pJyt3e/E---3.1_22132.p
% 44.58/6.01 # Version: 3.1pre001
% 44.58/6.01 # Preprocessing class: FSSSSMSSSSSNFFN.
% 44.58/6.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.58/6.01 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 44.58/6.01 # Starting new_bool_3 with 300s (1) cores
% 44.58/6.01 # Starting new_bool_1 with 300s (1) cores
% 44.58/6.01 # Starting sh5l with 300s (1) cores
% 44.58/6.01 # new_bool_1 with pid 22226 completed with status 0
% 44.58/6.01 # Result found by new_bool_1
% 44.58/6.01 # Preprocessing class: FSSSSMSSSSSNFFN.
% 44.58/6.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.58/6.01 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 44.58/6.01 # Starting new_bool_3 with 300s (1) cores
% 44.58/6.01 # Starting new_bool_1 with 300s (1) cores
% 44.58/6.01 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 44.58/6.01 # Search class: FHUNS-FFSF22-MFFFFFNN
% 44.58/6.01 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 44.58/6.01 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 44.58/6.01 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 22231 completed with status 0
% 44.58/6.01 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 44.58/6.01 # Preprocessing class: FSSSSMSSSSSNFFN.
% 44.58/6.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.58/6.01 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 44.58/6.01 # Starting new_bool_3 with 300s (1) cores
% 44.58/6.01 # Starting new_bool_1 with 300s (1) cores
% 44.58/6.01 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 44.58/6.01 # Search class: FHUNS-FFSF22-MFFFFFNN
% 44.58/6.01 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 44.58/6.01 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 44.58/6.01 # Preprocessing time : 0.001 s
% 44.58/6.01
% 44.58/6.01 # Proof found!
% 44.58/6.01 # SZS status Unsatisfiable
% 44.58/6.01 # SZS output start CNFRefutation
% See solution above
% 44.58/6.01 # Parsed axioms : 4
% 44.58/6.01 # Removed by relevancy pruning/SinE : 0
% 44.58/6.01 # Initial clauses : 4
% 44.58/6.01 # Removed in clause preprocessing : 0
% 44.58/6.01 # Initial clauses in saturation : 4
% 44.58/6.01 # Processed clauses : 95280
% 44.58/6.01 # ...of these trivial : 1394
% 44.58/6.01 # ...subsumed : 91871
% 44.58/6.01 # ...remaining for further processing : 2015
% 44.58/6.01 # Other redundant clauses eliminated : 0
% 44.58/6.01 # Clauses deleted for lack of memory : 0
% 44.58/6.01 # Backward-subsumed : 0
% 44.58/6.01 # Backward-rewritten : 1
% 44.58/6.01 # Generated clauses : 759431
% 44.58/6.01 # ...of the previous two non-redundant : 596371
% 44.58/6.01 # ...aggressively subsumed : 0
% 44.58/6.01 # Contextual simplify-reflections : 0
% 44.58/6.01 # Paramodulations : 759431
% 44.58/6.01 # Factorizations : 0
% 44.58/6.01 # NegExts : 0
% 44.58/6.01 # Equation resolutions : 0
% 44.58/6.01 # Total rewrite steps : 222642
% 44.58/6.01 # Propositional unsat checks : 0
% 44.58/6.01 # Propositional check models : 0
% 44.58/6.01 # Propositional check unsatisfiable : 0
% 44.58/6.01 # Propositional clauses : 0
% 44.58/6.01 # Propositional clauses after purity: 0
% 44.58/6.01 # Propositional unsat core size : 0
% 44.58/6.01 # Propositional preprocessing time : 0.000
% 44.58/6.01 # Propositional encoding time : 0.000
% 44.58/6.01 # Propositional solver time : 0.000
% 44.58/6.01 # Success case prop preproc time : 0.000
% 44.58/6.01 # Success case prop encoding time : 0.000
% 44.58/6.01 # Success case prop solver time : 0.000
% 44.58/6.01 # Current number of processed clauses : 2014
% 44.58/6.01 # Positive orientable unit clauses : 467
% 44.58/6.01 # Positive unorientable unit clauses: 0
% 44.58/6.01 # Negative unit clauses : 0
% 44.58/6.01 # Non-unit-clauses : 1547
% 44.58/6.01 # Current number of unprocessed clauses: 501095
% 44.58/6.01 # ...number of literals in the above : 803789
% 44.58/6.01 # Current number of archived formulas : 0
% 44.58/6.01 # Current number of archived clauses : 1
% 44.58/6.01 # Clause-clause subsumption calls (NU) : 6087747
% 44.58/6.01 # Rec. Clause-clause subsumption calls : 6081036
% 44.58/6.01 # Non-unit clause-clause subsumptions : 91871
% 44.58/6.01 # Unit Clause-clause subsumption calls : 130
% 44.58/6.01 # Rewrite failures with RHS unbound : 0
% 44.58/6.01 # BW rewrite match attempts : 112619
% 44.58/6.01 # BW rewrite match successes : 1
% 44.58/6.01 # Condensation attempts : 95280
% 44.58/6.01 # Condensation successes : 0
% 44.58/6.01 # Termbank termtop insertions : 10558019
% 44.58/6.01
% 44.58/6.01 # -------------------------------------------------
% 44.58/6.01 # User time : 5.421 s
% 44.58/6.01 # System time : 0.151 s
% 44.58/6.01 # Total time : 5.572 s
% 44.58/6.01 # Maximum resident set size: 1648 pages
% 44.58/6.01
% 44.58/6.01 # -------------------------------------------------
% 44.58/6.01 # User time : 5.421 s
% 44.58/6.01 # System time : 0.153 s
% 44.58/6.01 # Total time : 5.574 s
% 44.58/6.01 # Maximum resident set size: 1680 pages
% 44.58/6.01 % E---3.1 exiting
%------------------------------------------------------------------------------