TSTP Solution File: LCL006-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL006-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 May 20 23:55:05 EDT 2024
% Result : Unsatisfiable 1.18s 0.62s
% Output : CNFRefutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of clauses : 39 ( 29 unt; 0 nHn; 12 RR)
% Number of literals : 53 ( 0 equ; 17 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 : 95 ( 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/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(ec_4,axiom,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.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/benchmark/theBenchmark.p',prove_ec_1) ).
cnf(c_0_4,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_5,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_4 ).
cnf(c_0_6,axiom,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
ec_4 ).
cnf(c_0_7,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X1,equivalent(X2,X3)))),
ec_5 ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,X2),X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( is_a_theorem(equivalent(X1,equivalent(X1,X2)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X1,equivalent(X2,X3))))),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_15,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X2)),X3)),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_16,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X1,equivalent(X2,X3)))))),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X3,X1),X2),X3))),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_19,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X1,X2)))),X3)),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_21,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(X3,X1),X2),X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_18]) ).
cnf(c_0_22,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,equivalent(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_23,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,equivalent(X1,X2))),X3))),
inference(spm,[status(thm)],[c_0_9,c_0_20]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),X1),X2)),X3)),
inference(spm,[status(thm)],[c_0_8,c_0_21]) ).
cnf(c_0_25,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X3,X1))),X2)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),X1),X2),X3))),
inference(spm,[status(thm)],[c_0_9,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X3,X1)),X2))),
inference(spm,[status(thm)],[c_0_9,c_0_25]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X3),X1),X2)),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X3,X2)),X1)),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_30,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,equivalent(X1,X3)),X3),X2))),
inference(spm,[status(thm)],[c_0_8,c_0_28]) ).
cnf(c_0_31,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X3,X2),X1))),
inference(spm,[status(thm)],[c_0_9,c_0_29]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X2,X3)),X3),X1)),
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
inference(fof_simplification,[status(thm)],[prove_ec_1]) ).
cnf(c_0_34,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_31]) ).
cnf(c_0_35,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X2,X3)),equivalent(X3,X1))),
inference(spm,[status(thm)],[c_0_9,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
c_0_33 ).
cnf(c_0_37,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X1)),equivalent(X2,X3))),
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.11/0.12 % Problem : LCL006-1 : TPTP v8.2.0. Released v1.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 02:15:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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/benchmark/theBenchmark.p
% 1.18/0.62 # Version: 3.1.0
% 1.18/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.18/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.18/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.18/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.18/0.62 # Starting sh5l with 300s (1) cores
% 1.18/0.62 # new_bool_1 with pid 29022 completed with status 0
% 1.18/0.62 # Result found by new_bool_1
% 1.18/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.18/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.18/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.18/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.18/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.18/0.62 # Search class: FHUNS-FFSF22-MFFFFFNN
% 1.18/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.18/0.62 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 1.18/0.62 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 29029 completed with status 0
% 1.18/0.62 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 1.18/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.18/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.18/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.18/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.18/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.18/0.62 # Search class: FHUNS-FFSF22-MFFFFFNN
% 1.18/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.18/0.62 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 1.18/0.62 # Preprocessing time : 0.001 s
% 1.18/0.62
% 1.18/0.62 # Proof found!
% 1.18/0.62 # SZS status Unsatisfiable
% 1.18/0.62 # SZS output start CNFRefutation
% See solution above
% 1.18/0.62 # Parsed axioms : 4
% 1.18/0.62 # Removed by relevancy pruning/SinE : 0
% 1.18/0.62 # Initial clauses : 4
% 1.18/0.62 # Removed in clause preprocessing : 0
% 1.18/0.62 # Initial clauses in saturation : 4
% 1.18/0.62 # Processed clauses : 841
% 1.18/0.62 # ...of these trivial : 79
% 1.18/0.62 # ...subsumed : 212
% 1.18/0.62 # ...remaining for further processing : 550
% 1.18/0.62 # Other redundant clauses eliminated : 0
% 1.18/0.62 # Clauses deleted for lack of memory : 0
% 1.18/0.62 # Backward-subsumed : 0
% 1.18/0.62 # Backward-rewritten : 1
% 1.18/0.62 # Generated clauses : 12147
% 1.18/0.62 # ...of the previous two non-redundant : 4486
% 1.18/0.62 # ...aggressively subsumed : 0
% 1.18/0.62 # Contextual simplify-reflections : 0
% 1.18/0.62 # Paramodulations : 12147
% 1.18/0.62 # Factorizations : 0
% 1.18/0.62 # NegExts : 0
% 1.18/0.62 # Equation resolutions : 0
% 1.18/0.62 # Disequality decompositions : 0
% 1.18/0.62 # Total rewrite steps : 7778
% 1.18/0.62 # ...of those cached : 7267
% 1.18/0.62 # Propositional unsat checks : 0
% 1.18/0.62 # Propositional check models : 0
% 1.18/0.62 # Propositional check unsatisfiable : 0
% 1.18/0.62 # Propositional clauses : 0
% 1.18/0.62 # Propositional clauses after purity: 0
% 1.18/0.62 # Propositional unsat core size : 0
% 1.18/0.62 # Propositional preprocessing time : 0.000
% 1.18/0.62 # Propositional encoding time : 0.000
% 1.18/0.62 # Propositional solver time : 0.000
% 1.18/0.62 # Success case prop preproc time : 0.000
% 1.18/0.62 # Success case prop encoding time : 0.000
% 1.18/0.62 # Success case prop solver time : 0.000
% 1.18/0.62 # Current number of processed clauses : 549
% 1.18/0.62 # Positive orientable unit clauses : 497
% 1.18/0.62 # Positive unorientable unit clauses: 0
% 1.18/0.62 # Negative unit clauses : 0
% 1.18/0.62 # Non-unit-clauses : 52
% 1.18/0.62 # Current number of unprocessed clauses: 3649
% 1.18/0.62 # ...number of literals in the above : 4639
% 1.18/0.62 # Current number of archived formulas : 0
% 1.18/0.62 # Current number of archived clauses : 1
% 1.18/0.62 # Clause-clause subsumption calls (NU) : 3409
% 1.18/0.62 # Rec. Clause-clause subsumption calls : 3409
% 1.18/0.62 # Non-unit clause-clause subsumptions : 212
% 1.18/0.62 # Unit Clause-clause subsumption calls : 3
% 1.18/0.62 # Rewrite failures with RHS unbound : 0
% 1.18/0.62 # BW rewrite match attempts : 69262
% 1.18/0.62 # BW rewrite match successes : 1
% 1.18/0.62 # Condensation attempts : 841
% 1.18/0.62 # Condensation successes : 0
% 1.18/0.62 # Termbank termtop insertions : 117688
% 1.18/0.62 # Search garbage collected termcells : 8
% 1.18/0.62
% 1.18/0.62 # -------------------------------------------------
% 1.18/0.62 # User time : 0.118 s
% 1.18/0.62 # System time : 0.010 s
% 1.18/0.62 # Total time : 0.128 s
% 1.18/0.62 # Maximum resident set size: 1624 pages
% 1.18/0.62
% 1.18/0.62 # -------------------------------------------------
% 1.18/0.62 # User time : 0.119 s
% 1.18/0.62 # System time : 0.012 s
% 1.18/0.62 # Total time : 0.132 s
% 1.18/0.62 # Maximum resident set size: 1692 pages
% 1.18/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------