TSTP Solution File: NUM464+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM464+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:53 EDT 2023
% Result : Theorem 0.24s 0.55s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 52 ( 25 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 53 ( 21 ~; 18 |; 10 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn; 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( xm != sz00
=> ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(sz10,X1) = xm )
| sdtlseqdt0(sz10,xm) ) ),
file('/export/starexec/sandbox/tmp/tmp.lCwfPDzqFx/E---3.1_24463.p',m__) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.lCwfPDzqFx/E---3.1_24463.p',m_AddZero) ).
fof(mLENTr,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sz00
| X1 = sz10
| ( sz10 != X1
& sdtlseqdt0(sz10,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lCwfPDzqFx/E---3.1_24463.p',mLENTr) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/tmp.lCwfPDzqFx/E---3.1_24463.p',mSortsC) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/tmp/tmp.lCwfPDzqFx/E---3.1_24463.p',mSortsC_01) ).
fof(m__987,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/tmp/tmp.lCwfPDzqFx/E---3.1_24463.p',m__987) ).
fof(c_0_6,negated_conjecture,
~ ( xm != sz00
=> ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(sz10,X1) = xm )
| sdtlseqdt0(sz10,xm) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
! [X4] :
( xm != sz00
& ( ~ aNaturalNumber0(X4)
| sdtpldt0(sz10,X4) != xm )
& ~ sdtlseqdt0(sz10,xm) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X32] :
( ( sdtpldt0(X32,sz00) = X32
| ~ aNaturalNumber0(X32) )
& ( X32 = sdtpldt0(sz00,X32)
| ~ aNaturalNumber0(X32) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])]) ).
fof(c_0_9,plain,
! [X24] :
( ( sz10 != X24
| X24 = sz00
| X24 = sz10
| ~ aNaturalNumber0(X24) )
& ( sdtlseqdt0(sz10,X24)
| X24 = sz00
| X24 = sz10
| ~ aNaturalNumber0(X24) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLENTr])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtpldt0(sz10,X1) != xm ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_13,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_14,negated_conjecture,
~ sdtlseqdt0(sz10,xm),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( sdtlseqdt0(sz10,X1)
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__987]) ).
cnf(c_0_17,negated_conjecture,
xm != sz00,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
xm != sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : NUM464+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n018.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 14:47:53 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.lCwfPDzqFx/E---3.1_24463.p
% 0.24/0.55 # Version: 3.1pre001
% 0.24/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 # Starting sh5l with 300s (1) cores
% 0.24/0.55 # new_bool_3 with pid 24542 completed with status 0
% 0.24/0.55 # Result found by new_bool_3
% 0.24/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.55 # Search class: FGHSF-FFMS22-SFFFFFNN
% 0.24/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.24/0.55 # SAT001_MinMin_p005000_rr_RG with pid 24546 completed with status 0
% 0.24/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.24/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.55 # Search class: FGHSF-FFMS22-SFFFFFNN
% 0.24/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.24/0.55 # Preprocessing time : 0.002 s
% 0.24/0.55 # Presaturation interreduction done
% 0.24/0.55
% 0.24/0.55 # Proof found!
% 0.24/0.55 # SZS status Theorem
% 0.24/0.55 # SZS output start CNFRefutation
% See solution above
% 0.24/0.55 # Parsed axioms : 28
% 0.24/0.55 # Removed by relevancy pruning/SinE : 1
% 0.24/0.55 # Initial clauses : 48
% 0.24/0.55 # Removed in clause preprocessing : 2
% 0.24/0.55 # Initial clauses in saturation : 46
% 0.24/0.55 # Processed clauses : 67
% 0.24/0.55 # ...of these trivial : 0
% 0.24/0.55 # ...subsumed : 5
% 0.24/0.55 # ...remaining for further processing : 62
% 0.24/0.55 # Other redundant clauses eliminated : 2
% 0.24/0.55 # Clauses deleted for lack of memory : 0
% 0.24/0.55 # Backward-subsumed : 0
% 0.24/0.55 # Backward-rewritten : 0
% 0.24/0.55 # Generated clauses : 6
% 0.24/0.55 # ...of the previous two non-redundant : 3
% 0.24/0.55 # ...aggressively subsumed : 0
% 0.24/0.55 # Contextual simplify-reflections : 1
% 0.24/0.55 # Paramodulations : 4
% 0.24/0.55 # Factorizations : 0
% 0.24/0.55 # NegExts : 0
% 0.24/0.55 # Equation resolutions : 2
% 0.24/0.55 # Total rewrite steps : 5
% 0.24/0.55 # Propositional unsat checks : 0
% 0.24/0.55 # Propositional check models : 0
% 0.24/0.55 # Propositional check unsatisfiable : 0
% 0.24/0.55 # Propositional clauses : 0
% 0.24/0.55 # Propositional clauses after purity: 0
% 0.24/0.55 # Propositional unsat core size : 0
% 0.24/0.55 # Propositional preprocessing time : 0.000
% 0.24/0.55 # Propositional encoding time : 0.000
% 0.24/0.55 # Propositional solver time : 0.000
% 0.24/0.55 # Success case prop preproc time : 0.000
% 0.24/0.55 # Success case prop encoding time : 0.000
% 0.24/0.55 # Success case prop solver time : 0.000
% 0.24/0.55 # Current number of processed clauses : 19
% 0.24/0.55 # Positive orientable unit clauses : 4
% 0.24/0.55 # Positive unorientable unit clauses: 0
% 0.24/0.55 # Negative unit clauses : 4
% 0.24/0.55 # Non-unit-clauses : 11
% 0.24/0.55 # Current number of unprocessed clauses: 23
% 0.24/0.55 # ...number of literals in the above : 107
% 0.24/0.55 # Current number of archived formulas : 0
% 0.24/0.55 # Current number of archived clauses : 41
% 0.24/0.55 # Clause-clause subsumption calls (NU) : 250
% 0.24/0.55 # Rec. Clause-clause subsumption calls : 92
% 0.24/0.55 # Non-unit clause-clause subsumptions : 6
% 0.24/0.55 # Unit Clause-clause subsumption calls : 2
% 0.24/0.55 # Rewrite failures with RHS unbound : 0
% 0.24/0.55 # BW rewrite match attempts : 0
% 0.24/0.55 # BW rewrite match successes : 0
% 0.24/0.55 # Condensation attempts : 0
% 0.24/0.55 # Condensation successes : 0
% 0.24/0.55 # Termbank termtop insertions : 3315
% 0.24/0.55
% 0.24/0.55 # -------------------------------------------------
% 0.24/0.55 # User time : 0.011 s
% 0.24/0.55 # System time : 0.000 s
% 0.24/0.55 # Total time : 0.011 s
% 0.24/0.55 # Maximum resident set size: 1860 pages
% 0.24/0.55
% 0.24/0.55 # -------------------------------------------------
% 0.24/0.55 # User time : 0.012 s
% 0.24/0.55 # System time : 0.003 s
% 0.24/0.55 # Total time : 0.015 s
% 0.24/0.55 # Maximum resident set size: 1700 pages
% 0.24/0.55 % E---3.1 exiting
% 0.24/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------