TSTP Solution File: NUM837+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM837+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 19:08:37 EDT 2023
% Result : Timeout 272.24s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 7 unt; 0 def)
% Number of atoms : 15 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 3 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 1 sgn; 8 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qe(171)',conjecture,
? [X1] : vd269 = vplus(vd268,X1),
file('/export/starexec/sandbox/tmp/tmp.A9LdmsUQnR/E---3.1_2707.p','qe(171)') ).
fof('def(cond(conseq(axiom(3)), 12), 1)',axiom,
! [X16,X17] :
( less(X17,X16)
<=> ? [X18] : X16 = vplus(X17,X18) ),
file('/export/starexec/sandbox/tmp/tmp.A9LdmsUQnR/E---3.1_2707.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof('holds(conjunct1(170), 270, 0)',axiom,
less(vd268,vd269),
file('/export/starexec/sandbox/tmp/tmp.A9LdmsUQnR/E---3.1_2707.p','holds(conjunct1(170), 270, 0)') ).
fof(c_0_3,negated_conjecture,
~ ? [X1] : vd269 = vplus(vd268,X1),
inference(assume_negation,[status(cth)],['qe(171)']) ).
fof(c_0_4,negated_conjecture,
! [X48] : vd269 != vplus(vd268,X48),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_5,plain,
! [X83,X84,X86,X87,X88] :
( ( ~ less(X84,X83)
| X83 = vplus(X84,esk3_2(X83,X84)) )
& ( X86 != vplus(X87,X88)
| less(X87,X86) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 12), 1)'])])])])]) ).
cnf(c_0_6,negated_conjecture,
vd269 != vplus(vd268,X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X2 = vplus(X1,esk3_2(X2,X1))
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
less(vd268,vd269),
inference(split_conjunct,[status(thm)],['holds(conjunct1(170), 270, 0)']) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7])]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : NUM837+1 : TPTP v8.1.2. Released v4.1.0.
% 0.09/0.14 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 14:44:31 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.47 Running first-order model finding
% 0.18/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.A9LdmsUQnR/E---3.1_2707.p
% 272.24/300.16 # Version: 3.1pre001
% 272.24/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.24/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.24/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.24/300.16 # Starting new_bool_3 with 300s (1) cores
% 272.24/300.16 # Starting new_bool_1 with 300s (1) cores
% 272.24/300.16 # Starting sh5l with 300s (1) cores
% 272.24/300.16 # new_bool_1 with pid 2787 completed with status 0
% 272.24/300.16 # Result found by new_bool_1
% 272.24/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.24/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.24/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.24/300.16 # Starting new_bool_3 with 300s (1) cores
% 272.24/300.16 # Starting new_bool_1 with 300s (1) cores
% 272.24/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.24/300.16 # Search class: FGHSS-FFSF22-SFFFFFNN
% 272.24/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.24/300.16 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 272.24/300.16 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 2789 completed with status 0
% 272.24/300.16 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 272.24/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.24/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.24/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.24/300.16 # Starting new_bool_3 with 300s (1) cores
% 272.24/300.16 # Starting new_bool_1 with 300s (1) cores
% 272.24/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.24/300.16 # Search class: FGHSS-FFSF22-SFFFFFNN
% 272.24/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.24/300.16 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 272.24/300.16 # Preprocessing time : 0.001 s
% 272.24/300.16 # Presaturation interreduction done
% 272.24/300.16
% 272.24/300.16 # Proof found!
% 272.24/300.16 # SZS status Theorem
% 272.24/300.16 # SZS output start CNFRefutation
% See solution above
% 272.24/300.16 # Parsed axioms : 31
% 272.24/300.16 # Removed by relevancy pruning/SinE : 13
% 272.24/300.16 # Initial clauses : 20
% 272.24/300.16 # Removed in clause preprocessing : 0
% 272.24/300.16 # Initial clauses in saturation : 20
% 272.24/300.16 # Processed clauses : 92
% 272.24/300.16 # ...of these trivial : 11
% 272.24/300.16 # ...subsumed : 18
% 272.24/300.16 # ...remaining for further processing : 63
% 272.24/300.16 # Other redundant clauses eliminated : 10
% 272.24/300.16 # Clauses deleted for lack of memory : 0
% 272.24/300.16 # Backward-subsumed : 0
% 272.24/300.16 # Backward-rewritten : 0
% 272.24/300.16 # Generated clauses : 226
% 272.24/300.16 # ...of the previous two non-redundant : 171
% 272.24/300.16 # ...aggressively subsumed : 0
% 272.24/300.16 # Contextual simplify-reflections : 0
% 272.24/300.16 # Paramodulations : 214
% 272.24/300.16 # Factorizations : 2
% 272.24/300.16 # NegExts : 0
% 272.24/300.16 # Equation resolutions : 10
% 272.24/300.16 # Total rewrite steps : 113
% 272.24/300.16 # Propositional unsat checks : 0
% 272.24/300.16 # Propositional check models : 0
% 272.24/300.16 # Propositional check unsatisfiable : 0
% 272.24/300.16 # Propositional clauses : 0
% 272.24/300.16 # Propositional clauses after purity: 0
% 272.24/300.16 # Propositional unsat core size : 0
% 272.24/300.16 # Propositional preprocessing time : 0.000
% 272.24/300.16 # Propositional encoding time : 0.000
% 272.24/300.16 # Propositional solver time : 0.000
% 272.24/300.16 # Success case prop preproc time : 0.000
% 272.24/300.16 # Success case prop encoding time : 0.000
% 272.24/300.16 # Success case prop solver time : 0.000
% 272.24/300.16 # Current number of processed clauses : 38
% 272.24/300.16 # Positive orientable unit clauses : 18
% 272.24/300.16 # Positive unorientable unit clauses: 1
% 272.24/300.16 # Negative unit clauses : 12
% 272.24/300.16 # Non-unit-clauses : 7
% 272.24/300.16 # Current number of unprocessed clauses: 92
% 272.24/300.16 # ...number of literals in the above : 96
% 272.24/300.16 # Current number of archived formulas : 0
% 272.24/300.16 # Current number of archived clauses : 18
% 272.24/300.16 # Clause-clause subsumption calls (NU) : 4
% 272.24/300.16 # Rec. Clause-clause subsumption calls : 4
% 272.24/300.16 # Non-unit clause-clause subsumptions : 0
% 272.24/300.16 # Unit Clause-clause subsumption calls : 16
% 272.24/300.16 # Rewrite failures with RHS unbound : 0
% 272.24/300.16 # BW rewrite match attempts : 33
% 272.24/300.16 # BW rewrite match successes : 12
% 272.24/300.16 # Condensation attempts : 0
% 272.24/300.16 # Condensation successes : 0
% 272.24/300.16 # Termbank termtop insertions : 2310
% 272.24/300.16
% 272.24/300.16 # -------------------------------------------------
% 272.24/300.16 # User time : 0.006 s
% 272.24/300.16 # System time : 0.001 s
% 272.24/300.16 # Total time : 0.007 s
% 272.24/300.16 # Maximum resident set size: 1732 pages
% 272.24/300.16
% 272.24/300.16 # -------------------------------------------------
% 272.24/300.16 # User time : 0.008 s
% 272.24/300.16 # System time : 0.003 s
% 272.24/300.16 # Total time : 0.010 s
% 272.24/300.16 # Maximum resident set size: 1728 pages
% 272.24/300.16 % E---3.1 exiting
%------------------------------------------------------------------------------