TSTP Solution File: NUM482+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM482+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:20 EDT 2023
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 68 ( 11 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 77 ( 31 ~; 27 |; 13 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn; 12 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wskXheaPOh/E---3.1_16265.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.wskXheaPOh/E---3.1_16265.p',mSortsB_02) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.wskXheaPOh/E---3.1_16265.p',m_MulUnit) ).
fof(m__,conjecture,
( isPrime0(xk)
=> ? [X1] :
( aNaturalNumber0(X1)
& doDivides0(X1,xk)
& isPrime0(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.wskXheaPOh/E---3.1_16265.p',m__) ).
fof(m__1716,hypothesis,
aNaturalNumber0(xk),
file('/export/starexec/sandbox/tmp/tmp.wskXheaPOh/E---3.1_16265.p',m__1716) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/tmp/tmp.wskXheaPOh/E---3.1_16265.p',mSortsC_01) ).
fof(c_0_6,plain,
! [X10,X11,X13] :
( ( aNaturalNumber0(esk3_2(X10,X11))
| ~ doDivides0(X10,X11)
| ~ aNaturalNumber0(X10)
| ~ aNaturalNumber0(X11) )
& ( X11 = sdtasdt0(X10,esk3_2(X10,X11))
| ~ doDivides0(X10,X11)
| ~ aNaturalNumber0(X10)
| ~ aNaturalNumber0(X11) )
& ( ~ aNaturalNumber0(X13)
| X11 != sdtasdt0(X10,X13)
| doDivides0(X10,X11)
| ~ aNaturalNumber0(X10)
| ~ aNaturalNumber0(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])]) ).
fof(c_0_7,plain,
! [X43,X44] :
( ~ aNaturalNumber0(X43)
| ~ aNaturalNumber0(X44)
| aNaturalNumber0(sdtasdt0(X43,X44)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
fof(c_0_8,plain,
! [X27] :
( ( sdtasdt0(X27,sz10) = X27
| ~ aNaturalNumber0(X27) )
& ( X27 = sdtasdt0(sz10,X27)
| ~ aNaturalNumber0(X27) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])]) ).
fof(c_0_9,negated_conjecture,
~ ( isPrime0(xk)
=> ? [X1] :
( aNaturalNumber0(X1)
& doDivides0(X1,xk)
& isPrime0(X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_10,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aNaturalNumber0(xk),
inference(split_conjunct,[status(thm)],[m__1716]) ).
fof(c_0_14,negated_conjecture,
! [X6] :
( isPrime0(xk)
& ( ~ aNaturalNumber0(X6)
| ~ doDivides0(X6,xk)
| ~ isPrime0(X6) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_15,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_10]),c_0_11]) ).
cnf(c_0_16,hypothesis,
sdtasdt0(xk,sz10) = xk,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_18,negated_conjecture,
( ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,xk)
| ~ isPrime0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
doDivides0(xk,xk),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13]),c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
isPrime0(xk),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : NUM482+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.08/0.30 % Computer : n031.cluster.edu
% 0.08/0.30 % Model : x86_64 x86_64
% 0.08/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.30 % Memory : 8042.1875MB
% 0.08/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.30 % CPULimit : 2400
% 0.08/0.30 % WCLimit : 300
% 0.08/0.30 % DateTime : Mon Oct 2 15:03:28 EDT 2023
% 0.08/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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.wskXheaPOh/E---3.1_16265.p
% 0.15/0.45 # Version: 3.1pre001
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # new_bool_1 with pid 16397 completed with status 0
% 0.15/0.45 # Result found by new_bool_1
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.15/0.45 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 16402 completed with status 0
% 0.15/0.45 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.15/0.45 # Preprocessing time : 0.001 s
% 0.15/0.45 # Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 # Proof found!
% 0.15/0.45 # SZS status Theorem
% 0.15/0.45 # SZS output start CNFRefutation
% See solution above
% 0.15/0.45 # Parsed axioms : 41
% 0.15/0.45 # Removed by relevancy pruning/SinE : 3
% 0.15/0.45 # Initial clauses : 68
% 0.15/0.45 # Removed in clause preprocessing : 3
% 0.15/0.45 # Initial clauses in saturation : 65
% 0.15/0.45 # Processed clauses : 159
% 0.15/0.45 # ...of these trivial : 0
% 0.15/0.45 # ...subsumed : 7
% 0.15/0.45 # ...remaining for further processing : 152
% 0.15/0.45 # Other redundant clauses eliminated : 5
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 0
% 0.15/0.45 # Backward-rewritten : 0
% 0.15/0.45 # Generated clauses : 281
% 0.15/0.45 # ...of the previous two non-redundant : 250
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 2
% 0.15/0.45 # Paramodulations : 276
% 0.15/0.45 # Factorizations : 0
% 0.15/0.45 # NegExts : 0
% 0.15/0.45 # Equation resolutions : 5
% 0.15/0.45 # Total rewrite steps : 99
% 0.15/0.45 # Propositional unsat checks : 0
% 0.15/0.45 # Propositional check models : 0
% 0.15/0.45 # Propositional check unsatisfiable : 0
% 0.15/0.45 # Propositional clauses : 0
% 0.15/0.45 # Propositional clauses after purity: 0
% 0.15/0.45 # Propositional unsat core size : 0
% 0.15/0.45 # Propositional preprocessing time : 0.000
% 0.15/0.45 # Propositional encoding time : 0.000
% 0.15/0.45 # Propositional solver time : 0.000
% 0.15/0.45 # Success case prop preproc time : 0.000
% 0.15/0.45 # Success case prop encoding time : 0.000
% 0.15/0.45 # Success case prop solver time : 0.000
% 0.15/0.45 # Current number of processed clauses : 87
% 0.15/0.45 # Positive orientable unit clauses : 18
% 0.15/0.45 # Positive unorientable unit clauses: 0
% 0.15/0.45 # Negative unit clauses : 7
% 0.15/0.45 # Non-unit-clauses : 62
% 0.15/0.45 # Current number of unprocessed clauses: 214
% 0.15/0.45 # ...number of literals in the above : 905
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 60
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 729
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 183
% 0.15/0.45 # Non-unit clause-clause subsumptions : 8
% 0.15/0.45 # Unit Clause-clause subsumption calls : 172
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 0
% 0.15/0.45 # BW rewrite match successes : 0
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 9271
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.011 s
% 0.15/0.45 # System time : 0.003 s
% 0.15/0.45 # Total time : 0.014 s
% 0.15/0.45 # Maximum resident set size: 1972 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.012 s
% 0.15/0.45 # System time : 0.006 s
% 0.15/0.45 # Total time : 0.018 s
% 0.15/0.45 # Maximum resident set size: 1720 pages
% 0.15/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------