TSTP Solution File: LCL428-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL428-1 : TPTP v8.1.2. Bugfixed v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:24:50 EDT 2023
% Result : Unsatisfiable 0.14s 0.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 29 ( 16 unt; 0 nHn; 14 RR)
% Number of literals : 50 ( 0 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 18 ( 18 usr; 17 con; 0-2 aty)
% Number of variables : 59 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.cXXJ3TdaHH/E---3.1_2623.p',condensed_detachment) ).
cnf(mv2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.cXXJ3TdaHH/E---3.1_2623.p',mv2) ).
cnf(mv3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
file('/export/starexec/sandbox2/tmp/tmp.cXXJ3TdaHH/E---3.1_2623.p',mv3) ).
cnf(mv1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.cXXJ3TdaHH/E---3.1_2623.p',mv1) ).
cnf(prove_hr,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16)),
file('/export/starexec/sandbox2/tmp/tmp.cXXJ3TdaHH/E---3.1_2623.p',prove_hr) ).
cnf(mv5,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X2,X1)),implies(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.cXXJ3TdaHH/E---3.1_2623.p',mv5) ).
cnf(c_0_6,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
mv2 ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
mv3 ).
cnf(c_0_9,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
mv1 ).
cnf(c_0_10,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X2,X1),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(implies(X1,implies(X2,X3)),X3))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16)),
prove_hr ).
cnf(c_0_18,plain,
( is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X4))),X4))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(X1,implies(implies(X3,X2),X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_20,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9]),c_0_9])]) ).
cnf(c_0_21,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X2,X1)),implies(X2,X1))),
mv5 ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_24,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_21])]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_8])]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_25,c_0_7]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_9]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : LCL428-1 : TPTP v8.1.2. Bugfixed v5.5.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n008.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 13:03:58 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.40 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.cXXJ3TdaHH/E---3.1_2623.p
% 0.14/0.49 # Version: 3.1pre001
% 0.14/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 # Starting sh5l with 300s (1) cores
% 0.14/0.49 # new_bool_3 with pid 2701 completed with status 0
% 0.14/0.49 # Result found by new_bool_3
% 0.14/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49 # Search class: FHUNM-FFSF22-DFFFFFNN
% 0.14/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.49 # SAT001_MinMin_p005000_rr_RG with pid 2706 completed with status 0
% 0.14/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49 # Search class: FHUNM-FFSF22-DFFFFFNN
% 0.14/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.49 # Preprocessing time : 0.001 s
% 0.14/0.49 # Presaturation interreduction done
% 0.14/0.49
% 0.14/0.49 # Proof found!
% 0.14/0.49 # SZS status Unsatisfiable
% 0.14/0.49 # SZS output start CNFRefutation
% See solution above
% 0.14/0.49 # Parsed axioms : 6
% 0.14/0.49 # Removed by relevancy pruning/SinE : 0
% 0.14/0.49 # Initial clauses : 6
% 0.14/0.49 # Removed in clause preprocessing : 0
% 0.14/0.49 # Initial clauses in saturation : 6
% 0.14/0.49 # Processed clauses : 1134
% 0.14/0.49 # ...of these trivial : 5
% 0.14/0.49 # ...subsumed : 935
% 0.14/0.49 # ...remaining for further processing : 194
% 0.14/0.49 # Other redundant clauses eliminated : 0
% 0.14/0.49 # Clauses deleted for lack of memory : 0
% 0.14/0.49 # Backward-subsumed : 5
% 0.14/0.49 # Backward-rewritten : 4
% 0.14/0.49 # Generated clauses : 6490
% 0.14/0.49 # ...of the previous two non-redundant : 5855
% 0.14/0.49 # ...aggressively subsumed : 0
% 0.14/0.49 # Contextual simplify-reflections : 0
% 0.14/0.49 # Paramodulations : 6490
% 0.14/0.49 # Factorizations : 0
% 0.14/0.49 # NegExts : 0
% 0.14/0.49 # Equation resolutions : 0
% 0.14/0.49 # Total rewrite steps : 583
% 0.14/0.49 # Propositional unsat checks : 0
% 0.14/0.49 # Propositional check models : 0
% 0.14/0.49 # Propositional check unsatisfiable : 0
% 0.14/0.49 # Propositional clauses : 0
% 0.14/0.49 # Propositional clauses after purity: 0
% 0.14/0.49 # Propositional unsat core size : 0
% 0.14/0.49 # Propositional preprocessing time : 0.000
% 0.14/0.49 # Propositional encoding time : 0.000
% 0.14/0.49 # Propositional solver time : 0.000
% 0.14/0.49 # Success case prop preproc time : 0.000
% 0.14/0.49 # Success case prop encoding time : 0.000
% 0.14/0.49 # Success case prop solver time : 0.000
% 0.14/0.49 # Current number of processed clauses : 179
% 0.14/0.49 # Positive orientable unit clauses : 22
% 0.14/0.49 # Positive unorientable unit clauses: 0
% 0.14/0.49 # Negative unit clauses : 7
% 0.14/0.49 # Non-unit-clauses : 150
% 0.14/0.49 # Current number of unprocessed clauses: 4651
% 0.14/0.49 # ...number of literals in the above : 11814
% 0.14/0.49 # Current number of archived formulas : 0
% 0.14/0.49 # Current number of archived clauses : 15
% 0.14/0.49 # Clause-clause subsumption calls (NU) : 13076
% 0.14/0.49 # Rec. Clause-clause subsumption calls : 10193
% 0.14/0.49 # Non-unit clause-clause subsumptions : 940
% 0.14/0.49 # Unit Clause-clause subsumption calls : 251
% 0.14/0.49 # Rewrite failures with RHS unbound : 0
% 0.14/0.49 # BW rewrite match attempts : 742
% 0.14/0.49 # BW rewrite match successes : 4
% 0.14/0.49 # Condensation attempts : 0
% 0.14/0.49 # Condensation successes : 0
% 0.14/0.49 # Termbank termtop insertions : 76989
% 0.14/0.49
% 0.14/0.49 # -------------------------------------------------
% 0.14/0.49 # User time : 0.080 s
% 0.14/0.49 # System time : 0.004 s
% 0.14/0.49 # Total time : 0.084 s
% 0.14/0.49 # Maximum resident set size: 1648 pages
% 0.14/0.49
% 0.14/0.49 # -------------------------------------------------
% 0.14/0.49 # User time : 0.082 s
% 0.14/0.49 # System time : 0.005 s
% 0.14/0.49 # Total time : 0.087 s
% 0.14/0.49 # Maximum resident set size: 1696 pages
% 0.14/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------