TSTP Solution File: SYO038-1.003.003 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYO038-1.003.003 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 20:43:11 EDT 2023
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of clauses : 38 ( 32 unt; 0 nHn; 29 RR)
% Number of literals : 44 ( 14 equ; 21 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 16 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax3,axiom,
f(s(X1),s(X2)) = f(X1,f(s(X1),X2)),
file('/export/starexec/sandbox/tmp/tmp.gMRYGt68kn/E---3.1_16823.p',ax3) ).
cnf(ax1,axiom,
f(X1,one) = s(one),
file('/export/starexec/sandbox/tmp/tmp.gMRYGt68kn/E---3.1_16823.p',ax1) ).
cnf(ax5,axiom,
( d(s(X1))
| ~ d(X1) ),
file('/export/starexec/sandbox/tmp/tmp.gMRYGt68kn/E---3.1_16823.p',ax5) ).
cnf(ax2,axiom,
f(one,s(X1)) = s(s(f(one,X1))),
file('/export/starexec/sandbox/tmp/tmp.gMRYGt68kn/E---3.1_16823.p',ax2) ).
cnf(conj,negated_conjecture,
~ d(f(s(s(one)),s(s(one)))),
file('/export/starexec/sandbox/tmp/tmp.gMRYGt68kn/E---3.1_16823.p',conj) ).
cnf(ax4,axiom,
d(one),
file('/export/starexec/sandbox/tmp/tmp.gMRYGt68kn/E---3.1_16823.p',ax4) ).
cnf(c_0_6,axiom,
f(s(X1),s(X2)) = f(X1,f(s(X1),X2)),
ax3 ).
cnf(c_0_7,axiom,
f(X1,one) = s(one),
ax1 ).
cnf(c_0_8,plain,
f(s(X1),s(one)) = f(X1,s(one)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
( d(s(X1))
| ~ d(X1) ),
ax5 ).
cnf(c_0_10,axiom,
f(one,s(X1)) = s(s(f(one,X1))),
ax2 ).
cnf(c_0_11,plain,
f(X1,f(X1,s(one))) = f(s(X1),s(s(one))),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_12,plain,
( d(f(one,s(X1)))
| ~ d(s(f(one,X1))) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
f(one,s(one)) = s(s(s(one))),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_14,plain,
f(s(X1),f(X1,s(one))) = f(s(s(X1)),s(s(one))),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_15,plain,
( d(f(one,f(one,s(X1))))
| ~ d(s(f(one,s(f(one,X1))))) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_16,plain,
f(s(one),s(s(one))) = f(one,s(s(s(one)))),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ d(f(s(s(one)),s(s(one)))),
conj ).
cnf(c_0_18,plain,
f(s(s(one)),s(s(one))) = f(s(one),s(s(s(one)))),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_19,plain,
( d(f(one,f(one,s(X1))))
| ~ d(f(one,s(f(one,X1)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_20,plain,
f(one,f(one,s(s(s(one))))) = f(s(one),s(s(s(one)))),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_21,plain,
f(one,s(s(one))) = s(s(s(s(s(one))))),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
~ d(f(s(one),s(s(s(one))))),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
~ d(f(one,s(s(s(s(s(s(one)))))))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_24,plain,
~ d(s(f(one,s(s(s(s(s(one)))))))),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_25,plain,
~ d(f(one,s(s(s(s(s(one))))))),
inference(spm,[status(thm)],[c_0_24,c_0_9]) ).
cnf(c_0_26,plain,
~ d(s(f(one,s(s(s(s(one))))))),
inference(spm,[status(thm)],[c_0_25,c_0_12]) ).
cnf(c_0_27,plain,
~ d(f(one,s(s(s(s(one)))))),
inference(spm,[status(thm)],[c_0_26,c_0_9]) ).
cnf(c_0_28,plain,
~ d(s(f(one,s(s(s(one)))))),
inference(spm,[status(thm)],[c_0_27,c_0_12]) ).
cnf(c_0_29,plain,
~ d(f(one,s(s(s(one))))),
inference(spm,[status(thm)],[c_0_28,c_0_9]) ).
cnf(c_0_30,plain,
( d(f(one,s(s(s(one)))))
| ~ d(s(s(s(s(s(one)))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_7]),c_0_21]) ).
cnf(c_0_31,plain,
~ d(s(s(s(s(s(one)))))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
~ d(s(s(s(s(one))))),
inference(spm,[status(thm)],[c_0_31,c_0_9]) ).
cnf(c_0_33,plain,
~ d(s(s(s(one)))),
inference(spm,[status(thm)],[c_0_32,c_0_9]) ).
cnf(c_0_34,plain,
~ d(s(s(one))),
inference(spm,[status(thm)],[c_0_33,c_0_9]) ).
cnf(c_0_35,plain,
~ d(s(one)),
inference(spm,[status(thm)],[c_0_34,c_0_9]) ).
cnf(c_0_36,axiom,
d(one),
ax4 ).
cnf(c_0_37,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_9]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYO038-1.003.003 : TPTP v8.1.2. Released v5.3.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n021.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon Oct 2 16:16:59 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/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.gMRYGt68kn/E---3.1_16823.p
% 0.22/0.52 # Version: 3.1pre001
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # new_bool_3 with pid 16903 completed with status 0
% 0.22/0.52 # Result found by new_bool_3
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FHUSS-FFSF21-MFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 121s (1) cores
% 0.22/0.52 # SAT001_MinMin_p005000_rr_RG with pid 16907 completed with status 0
% 0.22/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FHUSS-FFSF21-MFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 121s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 6
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 6
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 6
% 0.22/0.52 # Processed clauses : 53
% 0.22/0.52 # ...of these trivial : 1
% 0.22/0.52 # ...subsumed : 5
% 0.22/0.52 # ...remaining for further processing : 47
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 1
% 0.22/0.52 # Backward-rewritten : 2
% 0.22/0.52 # Generated clauses : 122
% 0.22/0.52 # ...of the previous two non-redundant : 102
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 122
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Total rewrite steps : 173
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 38
% 0.22/0.52 # Positive orientable unit clauses : 20
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 13
% 0.22/0.52 # Non-unit-clauses : 5
% 0.22/0.52 # Current number of unprocessed clauses: 61
% 0.22/0.52 # ...number of literals in the above : 76
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 9
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 17
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 17
% 0.22/0.52 # Non-unit clause-clause subsumptions : 5
% 0.22/0.52 # Unit Clause-clause subsumption calls : 79
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 11
% 0.22/0.52 # BW rewrite match successes : 2
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 2830
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.005 s
% 0.22/0.52 # System time : 0.002 s
% 0.22/0.52 # Total time : 0.007 s
% 0.22/0.52 # Maximum resident set size: 1656 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.005 s
% 0.22/0.52 # System time : 0.005 s
% 0.22/0.52 # Total time : 0.010 s
% 0.22/0.52 # Maximum resident set size: 1676 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------