TSTP Solution File: NUM464+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM464+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:07:15 EDT 2023
% Result : Timeout 408.18s 300.15s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 40 ( 16 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 38 ( 16 ~; 13 |; 5 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn; 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
file('/export/starexec/sandbox/tmp/tmp.zJZYKFlq7K/E---3.1_9122.p',m__) ).
fof(mLENTr,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sz00
| X1 = sz10
| ( sz10 != X1
& sdtlseqdt0(sz10,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zJZYKFlq7K/E---3.1_9122.p',mLENTr) ).
fof(m__987,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/tmp/tmp.zJZYKFlq7K/E---3.1_9122.p',m__987) ).
fof(mLERefl,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> sdtlseqdt0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.zJZYKFlq7K/E---3.1_9122.p',mLERefl) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/tmp/tmp.zJZYKFlq7K/E---3.1_9122.p',mSortsC_01) ).
fof(c_0_5,negated_conjecture,
~ ( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
( xm != sz00
& ~ sdtlseqdt0(sz10,xm) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X23] :
( ( sz10 != X23
| X23 = sz00
| X23 = sz10
| ~ aNaturalNumber0(X23) )
& ( sdtlseqdt0(sz10,X23)
| X23 = sz00
| X23 = sz10
| ~ aNaturalNumber0(X23) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLENTr])])]) ).
cnf(c_0_8,negated_conjecture,
~ sdtlseqdt0(sz10,xm),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( sdtlseqdt0(sz10,X1)
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__987]) ).
cnf(c_0_11,negated_conjecture,
xm != sz00,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
xm = sz10,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]) ).
fof(c_0_13,plain,
! [X8] :
( ~ aNaturalNumber0(X8)
| sdtlseqdt0(X8,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLERefl])]) ).
cnf(c_0_14,negated_conjecture,
~ sdtlseqdt0(sz10,sz10),
inference(rw,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_15,plain,
( sdtlseqdt0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : NUM464+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n006.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 13:24:25 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.41 Running first-order model finding
% 0.14/0.41 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.zJZYKFlq7K/E---3.1_9122.p
% 408.18/300.15 # Version: 3.1pre001
% 408.18/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.18/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.18/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.18/300.15 # Starting new_bool_3 with 300s (1) cores
% 408.18/300.15 # Starting new_bool_1 with 300s (1) cores
% 408.18/300.15 # Starting sh5l with 300s (1) cores
% 408.18/300.15 # new_bool_3 with pid 9200 completed with status 0
% 408.18/300.15 # Result found by new_bool_3
% 408.18/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.18/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.18/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.18/300.15 # Starting new_bool_3 with 300s (1) cores
% 408.18/300.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.18/300.15 # Search class: FGUSF-FFMS22-SFFFFFNN
% 408.18/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.18/300.15 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.18/300.15 # SAT001_MinMin_p005000_rr_RG with pid 9204 completed with status 0
% 408.18/300.15 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.18/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.18/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.18/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.18/300.15 # Starting new_bool_3 with 300s (1) cores
% 408.18/300.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.18/300.15 # Search class: FGUSF-FFMS22-SFFFFFNN
% 408.18/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.18/300.15 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.18/300.15 # Preprocessing time : 0.001 s
% 408.18/300.15 # Presaturation interreduction done
% 408.18/300.15
% 408.18/300.15 # Proof found!
% 408.18/300.15 # SZS status Theorem
% 408.18/300.15 # SZS output start CNFRefutation
% See solution above
% 408.18/300.15 # Parsed axioms : 28
% 408.18/300.15 # Removed by relevancy pruning/SinE : 1
% 408.18/300.15 # Initial clauses : 47
% 408.18/300.15 # Removed in clause preprocessing : 2
% 408.18/300.15 # Initial clauses in saturation : 45
% 408.18/300.15 # Processed clauses : 63
% 408.18/300.15 # ...of these trivial : 0
% 408.18/300.15 # ...subsumed : 6
% 408.18/300.15 # ...remaining for further processing : 57
% 408.18/300.15 # Other redundant clauses eliminated : 2
% 408.18/300.15 # Clauses deleted for lack of memory : 0
% 408.18/300.15 # Backward-subsumed : 0
% 408.18/300.15 # Backward-rewritten : 3
% 408.18/300.15 # Generated clauses : 4
% 408.18/300.15 # ...of the previous two non-redundant : 5
% 408.18/300.15 # ...aggressively subsumed : 0
% 408.18/300.15 # Contextual simplify-reflections : 1
% 408.18/300.15 # Paramodulations : 2
% 408.18/300.15 # Factorizations : 0
% 408.18/300.15 # NegExts : 0
% 408.18/300.15 # Equation resolutions : 2
% 408.18/300.15 # Total rewrite steps : 6
% 408.18/300.15 # Propositional unsat checks : 0
% 408.18/300.15 # Propositional check models : 0
% 408.18/300.15 # Propositional check unsatisfiable : 0
% 408.18/300.15 # Propositional clauses : 0
% 408.18/300.15 # Propositional clauses after purity: 0
% 408.18/300.15 # Propositional unsat core size : 0
% 408.18/300.15 # Propositional preprocessing time : 0.000
% 408.18/300.15 # Propositional encoding time : 0.000
% 408.18/300.15 # Propositional solver time : 0.000
% 408.18/300.15 # Success case prop preproc time : 0.000
% 408.18/300.15 # Success case prop encoding time : 0.000
% 408.18/300.15 # Success case prop solver time : 0.000
% 408.18/300.15 # Current number of processed clauses : 12
% 408.18/300.15 # Positive orientable unit clauses : 4
% 408.18/300.15 # Positive unorientable unit clauses: 0
% 408.18/300.15 # Negative unit clauses : 2
% 408.18/300.15 # Non-unit-clauses : 6
% 408.18/300.15 # Current number of unprocessed clauses: 27
% 408.18/300.15 # ...number of literals in the above : 119
% 408.18/300.15 # Current number of archived formulas : 0
% 408.18/300.15 # Current number of archived clauses : 43
% 408.18/300.15 # Clause-clause subsumption calls (NU) : 215
% 408.18/300.15 # Rec. Clause-clause subsumption calls : 82
% 408.18/300.15 # Non-unit clause-clause subsumptions : 6
% 408.18/300.15 # Unit Clause-clause subsumption calls : 3
% 408.18/300.15 # Rewrite failures with RHS unbound : 0
% 408.18/300.15 # BW rewrite match attempts : 1
% 408.18/300.15 # BW rewrite match successes : 1
% 408.18/300.15 # Condensation attempts : 0
% 408.18/300.15 # Condensation successes : 0
% 408.18/300.15 # Termbank termtop insertions : 3166
% 408.18/300.15
% 408.18/300.15 # -------------------------------------------------
% 408.18/300.15 # User time : 0.006 s
% 408.18/300.15 # System time : 0.002 s
% 408.18/300.15 # Total time : 0.008 s
% 408.18/300.15 # Maximum resident set size: 1904 pages
% 408.18/300.15
% 408.18/300.15 # -------------------------------------------------
% 408.18/300.15 # User time : 0.008 s
% 408.18/300.15 # System time : 0.004 s
% 408.18/300.15 # Total time : 0.012 s
% 408.18/300.15 # Maximum resident set size: 1704 pages
% 408.18/300.15 % E---3.1 exiting
%------------------------------------------------------------------------------