TSTP Solution File: NUM458+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM458+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:55:51 EDT 2023
% Result : Timeout 408.06s 300.25s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 5 unt; 0 def)
% Number of atoms : 25 ( 9 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 22 ( 9 ~; 7 |; 5 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn; 3 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = xm )
| sdtlseqdt0(xm,xm) ),
file('/export/starexec/sandbox/tmp/tmp.kL8wc7z3Ja/E---3.1_13397.p',m__) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.kL8wc7z3Ja/E---3.1_13397.p',m_AddZero) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/tmp.kL8wc7z3Ja/E---3.1_13397.p',mSortsC) ).
fof(m__718,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/tmp.kL8wc7z3Ja/E---3.1_13397.p',m__718) ).
fof(c_0_4,negated_conjecture,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = xm )
| sdtlseqdt0(xm,xm) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X4] :
( ( ~ aNaturalNumber0(X4)
| sdtpldt0(xm,X4) != xm )
& ~ sdtlseqdt0(xm,xm) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X16] :
( ( sdtpldt0(X16,sz00) = X16
| ~ aNaturalNumber0(X16) )
& ( X16 = sdtpldt0(sz00,X16)
| ~ aNaturalNumber0(X16) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtpldt0(xm,X1) != xm ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_10,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__718]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : NUM458+2 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n025.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 2400
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Mon Oct 2 13:44:06 EDT 2023
% 0.11/0.34 % CPUTime :
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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.kL8wc7z3Ja/E---3.1_13397.p
% 408.06/300.25 # Version: 3.1pre001
% 408.06/300.25 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.06/300.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.06/300.25 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.06/300.25 # Starting new_bool_3 with 300s (1) cores
% 408.06/300.25 # Starting new_bool_1 with 300s (1) cores
% 408.06/300.25 # Starting sh5l with 300s (1) cores
% 408.06/300.25 # new_bool_3 with pid 13478 completed with status 0
% 408.06/300.25 # Result found by new_bool_3
% 408.06/300.25 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.06/300.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.06/300.25 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.06/300.25 # Starting new_bool_3 with 300s (1) cores
% 408.06/300.25 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.06/300.25 # Search class: FGHSF-FFMF22-SFFFFFNN
% 408.06/300.25 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.06/300.25 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.06/300.25 # SAT001_MinMin_p005000_rr_RG with pid 13483 completed with status 0
% 408.06/300.25 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.06/300.25 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.06/300.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.06/300.25 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.06/300.25 # Starting new_bool_3 with 300s (1) cores
% 408.06/300.25 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.06/300.25 # Search class: FGHSF-FFMF22-SFFFFFNN
% 408.06/300.25 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.06/300.25 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.06/300.25 # Preprocessing time : 0.001 s
% 408.06/300.25 # Presaturation interreduction done
% 408.06/300.25
% 408.06/300.25 # Proof found!
% 408.06/300.25 # SZS status Theorem
% 408.06/300.25 # SZS output start CNFRefutation
% See solution above
% 408.06/300.25 # Parsed axioms : 21
% 408.06/300.25 # Removed by relevancy pruning/SinE : 3
% 408.06/300.25 # Initial clauses : 27
% 408.06/300.25 # Removed in clause preprocessing : 1
% 408.06/300.25 # Initial clauses in saturation : 26
% 408.06/300.25 # Processed clauses : 33
% 408.06/300.25 # ...of these trivial : 0
% 408.06/300.25 # ...subsumed : 0
% 408.06/300.25 # ...remaining for further processing : 33
% 408.06/300.25 # Other redundant clauses eliminated : 1
% 408.06/300.25 # Clauses deleted for lack of memory : 0
% 408.06/300.25 # Backward-subsumed : 0
% 408.06/300.25 # Backward-rewritten : 0
% 408.06/300.25 # Generated clauses : 2
% 408.06/300.25 # ...of the previous two non-redundant : 1
% 408.06/300.25 # ...aggressively subsumed : 0
% 408.06/300.25 # Contextual simplify-reflections : 1
% 408.06/300.25 # Paramodulations : 1
% 408.06/300.25 # Factorizations : 0
% 408.06/300.25 # NegExts : 0
% 408.06/300.25 # Equation resolutions : 1
% 408.06/300.25 # Total rewrite steps : 2
% 408.06/300.25 # Propositional unsat checks : 0
% 408.06/300.25 # Propositional check models : 0
% 408.06/300.25 # Propositional check unsatisfiable : 0
% 408.06/300.25 # Propositional clauses : 0
% 408.06/300.25 # Propositional clauses after purity: 0
% 408.06/300.25 # Propositional unsat core size : 0
% 408.06/300.25 # Propositional preprocessing time : 0.000
% 408.06/300.25 # Propositional encoding time : 0.000
% 408.06/300.25 # Propositional solver time : 0.000
% 408.06/300.25 # Success case prop preproc time : 0.000
% 408.06/300.25 # Success case prop encoding time : 0.000
% 408.06/300.25 # Success case prop solver time : 0.000
% 408.06/300.25 # Current number of processed clauses : 6
% 408.06/300.25 # Positive orientable unit clauses : 2
% 408.06/300.25 # Positive unorientable unit clauses: 0
% 408.06/300.25 # Negative unit clauses : 1
% 408.06/300.25 # Non-unit-clauses : 3
% 408.06/300.25 # Current number of unprocessed clauses: 20
% 408.06/300.25 # ...number of literals in the above : 78
% 408.06/300.25 # Current number of archived formulas : 0
% 408.06/300.25 # Current number of archived clauses : 26
% 408.06/300.25 # Clause-clause subsumption calls (NU) : 71
% 408.06/300.25 # Rec. Clause-clause subsumption calls : 53
% 408.06/300.25 # Non-unit clause-clause subsumptions : 1
% 408.06/300.25 # Unit Clause-clause subsumption calls : 0
% 408.06/300.25 # Rewrite failures with RHS unbound : 0
% 408.06/300.25 # BW rewrite match attempts : 0
% 408.06/300.25 # BW rewrite match successes : 0
% 408.06/300.25 # Condensation attempts : 0
% 408.06/300.25 # Condensation successes : 0
% 408.06/300.25 # Termbank termtop insertions : 1923
% 408.06/300.25
% 408.06/300.25 # -------------------------------------------------
% 408.06/300.25 # User time : 0.006 s
% 408.06/300.25 # System time : 0.001 s
% 408.06/300.25 # Total time : 0.007 s
% 408.06/300.25 # Maximum resident set size: 1844 pages
% 408.06/300.25
% 408.06/300.25 # -------------------------------------------------
% 408.06/300.25 # User time : 0.009 s
% 408.06/300.25 # System time : 0.001 s
% 408.06/300.25 # Total time : 0.010 s
% 408.06/300.25 # Maximum resident set size: 1692 pages
% 408.06/300.25 % E---3.1 exiting
% 408.06/300.25 % E---3.1 exiting
%------------------------------------------------------------------------------