TSTP Solution File: LCL006-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL006-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:26 EDT 2023
% Result : Unsatisfiable 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of clauses : 37 ( 28 unt; 0 nHn; 10 RR)
% Number of literals : 49 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 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 : 93 ( 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.ZF8akq2tGy/E---3.1_27015.p',condensed_detachment) ).
cnf(ec_4,axiom,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.ZF8akq2tGy/E---3.1_27015.p',ec_4) ).
cnf(ec_5,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X1,equivalent(X2,X3)))),
file('/export/starexec/sandbox/tmp/tmp.ZF8akq2tGy/E---3.1_27015.p',ec_5) ).
cnf(prove_ec_1,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
file('/export/starexec/sandbox/tmp/tmp.ZF8akq2tGy/E---3.1_27015.p',prove_ec_1) ).
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(X1,X2),equivalent(X2,X1))),
ec_4 ).
cnf(c_0_6,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X1,equivalent(X2,X3)))),
ec_5 ).
cnf(c_0_7,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_9,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_10,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,X2),X3)))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(X1,equivalent(X1,X2)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X1,equivalent(X2,X3))))),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X2)),X3)),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X1,equivalent(X2,X3)))))),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X3,X1),X2),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_18,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_15]) ).
cnf(c_0_19,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X1,X2)))),X3)),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(X3,X1),X2),X3)))),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,equivalent(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,equivalent(X1,X2))),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_23,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),X1),X2)),X3)),
inference(spm,[status(thm)],[c_0_7,c_0_20]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X3,X1))),X2)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),X1),X2),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X3,X1)),X2))),
inference(spm,[status(thm)],[c_0_8,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X3),X1),X2)),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X3,X2)),X1)),
inference(spm,[status(thm)],[c_0_21,c_0_26]) ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,equivalent(X1,X3)),X3),X2))),
inference(spm,[status(thm)],[c_0_7,c_0_27]) ).
cnf(c_0_30,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X3,X2),X1))),
inference(spm,[status(thm)],[c_0_8,c_0_28]) ).
cnf(c_0_31,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X2,X3)),X3),X1)),
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_32,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_33,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X2,X3)),equivalent(X3,X1))),
inference(spm,[status(thm)],[c_0_8,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
prove_ec_1 ).
cnf(c_0_35,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X1)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL006-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 13:10:06 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.ZF8akq2tGy/E---3.1_27015.p
% 0.19/0.57 # Version: 3.1pre001
% 0.19/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.57 # Starting sh5l with 300s (1) cores
% 0.19/0.57 # new_bool_1 with pid 27094 completed with status 0
% 0.19/0.57 # Result found by new_bool_1
% 0.19/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.57 # Search class: FHUNS-FFSF22-MFFFFFNN
% 0.19/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.57 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 0.19/0.57 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 27101 completed with status 0
% 0.19/0.57 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.19/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.57 # Search class: FHUNS-FFSF22-MFFFFFNN
% 0.19/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.57 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 0.19/0.57 # Preprocessing time : 0.001 s
% 0.19/0.57
% 0.19/0.57 # Proof found!
% 0.19/0.57 # SZS status Unsatisfiable
% 0.19/0.57 # SZS output start CNFRefutation
% See solution above
% 0.19/0.57 # Parsed axioms : 4
% 0.19/0.57 # Removed by relevancy pruning/SinE : 0
% 0.19/0.57 # Initial clauses : 4
% 0.19/0.57 # Removed in clause preprocessing : 0
% 0.19/0.57 # Initial clauses in saturation : 4
% 0.19/0.57 # Processed clauses : 841
% 0.19/0.57 # ...of these trivial : 79
% 0.19/0.57 # ...subsumed : 212
% 0.19/0.57 # ...remaining for further processing : 550
% 0.19/0.57 # Other redundant clauses eliminated : 0
% 0.19/0.57 # Clauses deleted for lack of memory : 0
% 0.19/0.57 # Backward-subsumed : 0
% 0.19/0.57 # Backward-rewritten : 1
% 0.19/0.57 # Generated clauses : 12147
% 0.19/0.57 # ...of the previous two non-redundant : 4486
% 0.19/0.57 # ...aggressively subsumed : 0
% 0.19/0.57 # Contextual simplify-reflections : 0
% 0.19/0.57 # Paramodulations : 12147
% 0.19/0.57 # Factorizations : 0
% 0.19/0.57 # NegExts : 0
% 0.19/0.57 # Equation resolutions : 0
% 0.19/0.57 # Total rewrite steps : 7778
% 0.19/0.57 # Propositional unsat checks : 0
% 0.19/0.57 # Propositional check models : 0
% 0.19/0.57 # Propositional check unsatisfiable : 0
% 0.19/0.57 # Propositional clauses : 0
% 0.19/0.57 # Propositional clauses after purity: 0
% 0.19/0.57 # Propositional unsat core size : 0
% 0.19/0.57 # Propositional preprocessing time : 0.000
% 0.19/0.57 # Propositional encoding time : 0.000
% 0.19/0.57 # Propositional solver time : 0.000
% 0.19/0.57 # Success case prop preproc time : 0.000
% 0.19/0.57 # Success case prop encoding time : 0.000
% 0.19/0.57 # Success case prop solver time : 0.000
% 0.19/0.57 # Current number of processed clauses : 549
% 0.19/0.57 # Positive orientable unit clauses : 497
% 0.19/0.57 # Positive unorientable unit clauses: 0
% 0.19/0.57 # Negative unit clauses : 0
% 0.19/0.57 # Non-unit-clauses : 52
% 0.19/0.57 # Current number of unprocessed clauses: 3649
% 0.19/0.57 # ...number of literals in the above : 4639
% 0.19/0.57 # Current number of archived formulas : 0
% 0.19/0.57 # Current number of archived clauses : 1
% 0.19/0.57 # Clause-clause subsumption calls (NU) : 3409
% 0.19/0.57 # Rec. Clause-clause subsumption calls : 3409
% 0.19/0.57 # Non-unit clause-clause subsumptions : 212
% 0.19/0.57 # Unit Clause-clause subsumption calls : 3
% 0.19/0.57 # Rewrite failures with RHS unbound : 0
% 0.19/0.57 # BW rewrite match attempts : 69262
% 0.19/0.57 # BW rewrite match successes : 1
% 0.19/0.57 # Condensation attempts : 841
% 0.19/0.57 # Condensation successes : 0
% 0.19/0.57 # Termbank termtop insertions : 117675
% 0.19/0.57
% 0.19/0.57 # -------------------------------------------------
% 0.19/0.57 # User time : 0.084 s
% 0.19/0.57 # System time : 0.003 s
% 0.19/0.57 # Total time : 0.087 s
% 0.19/0.57 # Maximum resident set size: 1640 pages
% 0.19/0.57
% 0.19/0.57 # -------------------------------------------------
% 0.19/0.57 # User time : 0.086 s
% 0.19/0.57 # System time : 0.004 s
% 0.19/0.57 # Total time : 0.090 s
% 0.19/0.57 # Maximum resident set size: 1676 pages
% 0.19/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------