TSTP Solution File: SYN128-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN128-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : Sat May 4 10:06:33 EDT 2024
% Result : Unsatisfiable 0.89s 0.61s
% Output : CNFRefutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 17 unt; 0 nHn; 37 RR)
% Number of literals : 87 ( 0 equ; 43 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 80 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_014,axiom,
( m1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',rule_014) ).
cnf(rule_150,axiom,
( p2(X1,X1,X1)
| ~ m1(X2,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',rule_150) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',axiom_19) ).
cnf(rule_238,axiom,
( m3(X1,X1,X1)
| ~ p2(X1,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',rule_238) ).
cnf(rule_295,axiom,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1)
| ~ m3(X4,X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',rule_295) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',rule_085) ).
cnf(rule_206,axiom,
( k3(X1,X2,X1)
| ~ p2(X2,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',rule_206) ).
cnf(rule_181,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',rule_181) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',axiom_14) ).
cnf(rule_302,axiom,
( l5(X1)
| ~ q4(X2,X2)
| ~ k1(X1) ),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',rule_302) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',rule_001) ).
cnf(prove_this,negated_conjecture,
~ l5(c),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',prove_this) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p',axiom_26) ).
cnf(c_0_13,plain,
( m1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_014]) ).
cnf(c_0_14,plain,
( p2(X1,X1,X1)
| ~ m1(X2,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_150]) ).
cnf(c_0_15,plain,
( m1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
c_0_13 ).
cnf(c_0_16,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_17,plain,
( m3(X1,X1,X1)
| ~ p2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_238]) ).
cnf(c_0_18,plain,
( p2(X1,X1,X1)
| ~ m1(X2,X2,X1) ),
c_0_14 ).
cnf(c_0_19,plain,
m1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1)
| ~ m3(X4,X5,X4) ),
inference(fof_simplification,[status(thm)],[rule_295]) ).
cnf(c_0_21,plain,
( m3(X1,X1,X1)
| ~ p2(X1,X1,X1) ),
c_0_17 ).
cnf(c_0_22,plain,
p2(X1,X1,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_24,plain,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1)
| ~ m3(X4,X5,X4) ),
c_0_20 ).
cnf(c_0_25,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_26,plain,
( k3(X1,X2,X1)
| ~ p2(X2,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_206]) ).
cnf(c_0_27,plain,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_181]) ).
cnf(c_0_28,plain,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
c_0_23 ).
cnf(c_0_29,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_30,plain,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( k3(X1,X2,X1)
| ~ p2(X2,X1,X1) ),
c_0_26 ).
cnf(c_0_32,plain,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
c_0_27 ).
cnf(c_0_33,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( l5(X1)
| ~ q4(X2,X2)
| ~ k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_302]) ).
cnf(c_0_35,plain,
( q4(X1,X2)
| ~ q2(X3,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22])]) ).
cnf(c_0_36,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_37,plain,
( k1(X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_38,negated_conjecture,
~ l5(c),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_39,plain,
( l5(X1)
| ~ q4(X2,X2)
| ~ k1(X1) ),
c_0_34 ).
cnf(c_0_40,plain,
q4(X1,X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( k1(X1)
| ~ n0(X2,X1) ),
c_0_37 ).
cnf(c_0_42,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_43,negated_conjecture,
~ l5(c),
c_0_38 ).
cnf(c_0_44,plain,
( l5(X1)
| ~ k1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_45,plain,
k1(c),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SYN128-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.16 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n031.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 11:06:31 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.51 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.pIPhswqyo1/E---3.1_32143.p
% 0.89/0.61 # Version: 3.1.0
% 0.89/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.89/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.89/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.89/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.89/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.89/0.61 # Starting sh5l with 300s (1) cores
% 0.89/0.61 # new_bool_1 with pid 32223 completed with status 0
% 0.89/0.61 # Result found by new_bool_1
% 0.89/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.89/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.89/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.89/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.89/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.89/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.89/0.61 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.89/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.89/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.89/0.61 # SAT001_MinMin_p005000_rr_RG with pid 32225 completed with status 0
% 0.89/0.61 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.89/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.89/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.89/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.89/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.89/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.89/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.89/0.61 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.89/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.89/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.89/0.61 # Preprocessing time : 0.005 s
% 0.89/0.61 # Presaturation interreduction done
% 0.89/0.61
% 0.89/0.61 # Proof found!
% 0.89/0.61 # SZS status Unsatisfiable
% 0.89/0.61 # SZS output start CNFRefutation
% See solution above
% 0.89/0.61 # Parsed axioms : 369
% 0.89/0.61 # Removed by relevancy pruning/SinE : 46
% 0.89/0.61 # Initial clauses : 323
% 0.89/0.61 # Removed in clause preprocessing : 7
% 0.89/0.61 # Initial clauses in saturation : 316
% 0.89/0.61 # Processed clauses : 1121
% 0.89/0.61 # ...of these trivial : 63
% 0.89/0.61 # ...subsumed : 63
% 0.89/0.61 # ...remaining for further processing : 995
% 0.89/0.61 # Other redundant clauses eliminated : 0
% 0.89/0.61 # Clauses deleted for lack of memory : 0
% 0.89/0.61 # Backward-subsumed : 61
% 0.89/0.61 # Backward-rewritten : 250
% 0.89/0.61 # Generated clauses : 1471
% 0.89/0.61 # ...of the previous two non-redundant : 946
% 0.89/0.61 # ...aggressively subsumed : 0
% 0.89/0.61 # Contextual simplify-reflections : 2
% 0.89/0.61 # Paramodulations : 1471
% 0.89/0.61 # Factorizations : 0
% 0.89/0.61 # NegExts : 0
% 0.89/0.61 # Equation resolutions : 0
% 0.89/0.61 # Disequality decompositions : 0
% 0.89/0.61 # Total rewrite steps : 1162
% 0.89/0.61 # ...of those cached : 837
% 0.89/0.61 # Propositional unsat checks : 0
% 0.89/0.61 # Propositional check models : 0
% 0.89/0.61 # Propositional check unsatisfiable : 0
% 0.89/0.61 # Propositional clauses : 0
% 0.89/0.61 # Propositional clauses after purity: 0
% 0.89/0.61 # Propositional unsat core size : 0
% 0.89/0.61 # Propositional preprocessing time : 0.000
% 0.89/0.61 # Propositional encoding time : 0.000
% 0.89/0.61 # Propositional solver time : 0.000
% 0.89/0.61 # Success case prop preproc time : 0.000
% 0.89/0.61 # Success case prop encoding time : 0.000
% 0.89/0.61 # Success case prop solver time : 0.000
% 0.89/0.61 # Current number of processed clauses : 400
% 0.89/0.61 # Positive orientable unit clauses : 191
% 0.89/0.61 # Positive unorientable unit clauses: 0
% 0.89/0.61 # Negative unit clauses : 1
% 0.89/0.61 # Non-unit-clauses : 208
% 0.89/0.61 # Current number of unprocessed clauses: 224
% 0.89/0.61 # ...number of literals in the above : 658
% 0.89/0.61 # Current number of archived formulas : 0
% 0.89/0.61 # Current number of archived clauses : 595
% 0.89/0.61 # Clause-clause subsumption calls (NU) : 40958
% 0.89/0.61 # Rec. Clause-clause subsumption calls : 29306
% 0.89/0.61 # Non-unit clause-clause subsumptions : 121
% 0.89/0.61 # Unit Clause-clause subsumption calls : 3672
% 0.89/0.61 # Rewrite failures with RHS unbound : 0
% 0.89/0.61 # BW rewrite match attempts : 467
% 0.89/0.61 # BW rewrite match successes : 178
% 0.89/0.61 # Condensation attempts : 0
% 0.89/0.61 # Condensation successes : 0
% 0.89/0.61 # Termbank termtop insertions : 27995
% 0.89/0.61 # Search garbage collected termcells : 1509
% 0.89/0.61
% 0.89/0.61 # -------------------------------------------------
% 0.89/0.61 # User time : 0.084 s
% 0.89/0.61 # System time : 0.006 s
% 0.89/0.61 # Total time : 0.090 s
% 0.89/0.61 # Maximum resident set size: 2604 pages
% 0.89/0.61
% 0.89/0.61 # -------------------------------------------------
% 0.89/0.61 # User time : 0.090 s
% 0.89/0.61 # System time : 0.009 s
% 0.89/0.61 # Total time : 0.098 s
% 0.89/0.61 # Maximum resident set size: 2012 pages
% 0.89/0.61 % E---3.1 exiting
% 0.89/0.61 % E exiting
%------------------------------------------------------------------------------