TSTP Solution File: NUM504+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM504+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:26:34 EDT 2024
% Result : ContradictoryAxioms 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 15 unt; 0 def)
% Number of atoms : 127 ( 47 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 128 ( 34 ~; 27 |; 61 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 12 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 16 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2414,hypothesis,
( sdtasdt0(xn,xm) != sdtasdt0(xp,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(sdtasdt0(xn,xm),X1) = sdtasdt0(xp,xm) )
& sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))
& sdtasdt0(xp,xm) != sdtasdt0(xp,xk)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(sdtasdt0(xp,xm),X1) = sdtasdt0(xp,xk) )
& sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2414) ).
fof(m__2362,hypothesis,
( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xr,X1) = xk )
& ? [X1] :
( aNaturalNumber0(X1)
& sdtasdt0(xn,xm) = sdtasdt0(xr,X1) )
& doDivides0(xr,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2362) ).
fof(m__2342,hypothesis,
( aNaturalNumber0(xr)
& ? [X1] :
( aNaturalNumber0(X1)
& xk = sdtasdt0(xr,X1) )
& doDivides0(xr,xk)
& xr != sz00
& xr != sz10
& ! [X1] :
( ( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& xr = sdtasdt0(X1,X2) )
| doDivides0(X1,xr) ) )
=> ( X1 = sz10
| X1 = xr ) )
& isPrime0(xr) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2342) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__2306,hypothesis,
( aNaturalNumber0(xk)
& sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
& xk = sdtsldt0(sdtasdt0(xn,xm),xp) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2306) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(mLEAsym,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLEAsym) ).
fof(c_0_7,hypothesis,
( sdtasdt0(xn,xm) != sdtasdt0(xp,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(sdtasdt0(xn,xm),X1) = sdtasdt0(xp,xm) )
& sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))
& sdtasdt0(xp,xm) != sdtasdt0(xp,xk)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(sdtasdt0(xp,xm),X1) = sdtasdt0(xp,xk) )
& sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk)) ),
inference(fof_simplification,[status(thm)],[m__2414]) ).
fof(c_0_8,hypothesis,
( aNaturalNumber0(esk13_0)
& sdtpldt0(xr,esk13_0) = xk
& aNaturalNumber0(esk14_0)
& sdtasdt0(xn,xm) = sdtasdt0(xr,esk14_0)
& doDivides0(xr,sdtasdt0(xn,xm)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2362])]) ).
fof(c_0_9,hypothesis,
( aNaturalNumber0(xr)
& ? [X1] :
( aNaturalNumber0(X1)
& xk = sdtasdt0(xr,X1) )
& doDivides0(xr,xk)
& xr != sz00
& xr != sz10
& ! [X1] :
( ( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& xr = sdtasdt0(X1,X2) )
| doDivides0(X1,xr) ) )
=> ( X1 = sz10
| X1 = xr ) )
& isPrime0(xr) ),
inference(fof_simplification,[status(thm)],[m__2342]) ).
fof(c_0_10,hypothesis,
( sdtasdt0(xn,xm) != sdtasdt0(xp,xm)
& aNaturalNumber0(esk16_0)
& sdtpldt0(sdtasdt0(xn,xm),esk16_0) = sdtasdt0(xp,xm)
& sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))
& sdtasdt0(xp,xm) != sdtasdt0(xp,xk)
& aNaturalNumber0(esk17_0)
& sdtpldt0(sdtasdt0(xp,xm),esk17_0) = sdtasdt0(xp,xk)
& sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,plain,
! [X9,X10] :
( ~ aNaturalNumber0(X9)
| ~ aNaturalNumber0(X10)
| aNaturalNumber0(sdtasdt0(X9,X10)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_12,hypothesis,
sdtasdt0(xn,xm) = sdtasdt0(xr,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
sdtasdt0(xn,xm) = sdtasdt0(xp,xk),
inference(split_conjunct,[status(thm)],[m__2306]) ).
fof(c_0_14,hypothesis,
! [X107,X108] :
( aNaturalNumber0(xr)
& aNaturalNumber0(esk12_0)
& xk = sdtasdt0(xr,esk12_0)
& doDivides0(xr,xk)
& xr != sz00
& xr != sz10
& ( ~ aNaturalNumber0(X108)
| xr != sdtasdt0(X107,X108)
| ~ aNaturalNumber0(X107)
| X107 = sz10
| X107 = xr )
& ( ~ doDivides0(X107,xr)
| ~ aNaturalNumber0(X107)
| X107 = sz10
| X107 = xr )
& isPrime0(xr) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
fof(c_0_15,plain,
! [X7,X8] :
( ~ aNaturalNumber0(X7)
| ~ aNaturalNumber0(X8)
| aNaturalNumber0(sdtpldt0(X7,X8)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
cnf(c_0_16,hypothesis,
sdtpldt0(sdtasdt0(xn,xm),esk16_0) = sdtasdt0(xp,xm),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,hypothesis,
sdtasdt0(xr,esk14_0) = sdtasdt0(xp,xk),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,hypothesis,
aNaturalNumber0(esk14_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X45,X46] :
( ~ aNaturalNumber0(X45)
| ~ aNaturalNumber0(X46)
| ~ sdtlseqdt0(X45,X46)
| ~ sdtlseqdt0(X46,X45)
| X45 = X46 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEAsym])])]) ).
cnf(c_0_22,hypothesis,
sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,hypothesis,
sdtpldt0(sdtasdt0(xp,xk),esk16_0) = sdtasdt0(xp,xm),
inference(rw,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,hypothesis,
aNaturalNumber0(sdtasdt0(xp,xk)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_27,plain,
( X1 = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,hypothesis,
sdtlseqdt0(sdtasdt0(xp,xk),sdtasdt0(xp,xm)),
inference(rw,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_29,hypothesis,
sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,hypothesis,
aNaturalNumber0(sdtasdt0(xp,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_31,hypothesis,
sdtasdt0(xp,xm) != sdtasdt0(xp,xk),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_26]),c_0_30])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : NUM504+3 : TPTP v8.2.0. Released v4.0.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n011.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 : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 03:49:23 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.46 # Version: 3.1.0
% 0.15/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 # Starting sh5l with 300s (1) cores
% 0.15/0.46 # sh5l with pid 23671 completed with status 8
% 0.15/0.46 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 23668 completed with status 0
% 0.15/0.46 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 # No SInE strategy applied
% 0.15/0.46 # Search class: FGHSF-FSLM32-SFFFFFNN
% 0.15/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 811s (1) cores
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.46 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.46 # Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 0.15/0.46 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 136s (1) cores
% 0.15/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with pid 23681 completed with status 0
% 0.15/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 0.15/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 # No SInE strategy applied
% 0.15/0.46 # Search class: FGHSF-FSLM32-SFFFFFNN
% 0.15/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 811s (1) cores
% 0.15/0.46 # Preprocessing time : 0.004 s
% 0.15/0.46 # Presaturation interreduction done
% 0.15/0.46
% 0.15/0.46 # Proof found!
% 0.15/0.46 # SZS status ContradictoryAxioms
% 0.15/0.46 # SZS output start CNFRefutation
% See solution above
% 0.15/0.46 # Parsed axioms : 52
% 0.15/0.46 # Removed by relevancy pruning/SinE : 0
% 0.15/0.46 # Initial clauses : 252
% 0.15/0.46 # Removed in clause preprocessing : 4
% 0.15/0.46 # Initial clauses in saturation : 248
% 0.15/0.46 # Processed clauses : 358
% 0.15/0.46 # ...of these trivial : 2
% 0.15/0.46 # ...subsumed : 20
% 0.15/0.46 # ...remaining for further processing : 336
% 0.15/0.46 # Other redundant clauses eliminated : 13
% 0.15/0.46 # Clauses deleted for lack of memory : 0
% 0.15/0.46 # Backward-subsumed : 0
% 0.15/0.46 # Backward-rewritten : 1
% 0.15/0.46 # Generated clauses : 89
% 0.15/0.46 # ...of the previous two non-redundant : 71
% 0.15/0.46 # ...aggressively subsumed : 0
% 0.15/0.46 # Contextual simplify-reflections : 6
% 0.15/0.46 # Paramodulations : 75
% 0.15/0.46 # Factorizations : 0
% 0.15/0.46 # NegExts : 0
% 0.15/0.46 # Equation resolutions : 14
% 0.15/0.46 # Disequality decompositions : 0
% 0.15/0.46 # Total rewrite steps : 148
% 0.15/0.46 # ...of those cached : 128
% 0.15/0.46 # Propositional unsat checks : 0
% 0.15/0.46 # Propositional check models : 0
% 0.15/0.46 # Propositional check unsatisfiable : 0
% 0.15/0.46 # Propositional clauses : 0
% 0.15/0.46 # Propositional clauses after purity: 0
% 0.15/0.46 # Propositional unsat core size : 0
% 0.15/0.46 # Propositional preprocessing time : 0.000
% 0.15/0.46 # Propositional encoding time : 0.000
% 0.15/0.46 # Propositional solver time : 0.000
% 0.15/0.46 # Success case prop preproc time : 0.000
% 0.15/0.46 # Success case prop encoding time : 0.000
% 0.15/0.46 # Success case prop solver time : 0.000
% 0.15/0.46 # Current number of processed clauses : 84
% 0.15/0.46 # Positive orientable unit clauses : 44
% 0.15/0.46 # Positive unorientable unit clauses: 0
% 0.15/0.46 # Negative unit clauses : 16
% 0.15/0.46 # Non-unit-clauses : 24
% 0.15/0.46 # Current number of unprocessed clauses: 199
% 0.15/0.46 # ...number of literals in the above : 1559
% 0.15/0.46 # Current number of archived formulas : 0
% 0.15/0.46 # Current number of archived clauses : 241
% 0.15/0.46 # Clause-clause subsumption calls (NU) : 25069
% 0.15/0.46 # Rec. Clause-clause subsumption calls : 152
% 0.15/0.46 # Non-unit clause-clause subsumptions : 11
% 0.15/0.46 # Unit Clause-clause subsumption calls : 105
% 0.15/0.46 # Rewrite failures with RHS unbound : 0
% 0.15/0.46 # BW rewrite match attempts : 1
% 0.15/0.46 # BW rewrite match successes : 1
% 0.15/0.46 # Condensation attempts : 0
% 0.15/0.46 # Condensation successes : 0
% 0.15/0.46 # Termbank termtop insertions : 23078
% 0.15/0.46 # Search garbage collected termcells : 2437
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.043 s
% 0.15/0.46 # System time : 0.004 s
% 0.15/0.46 # Total time : 0.047 s
% 0.15/0.46 # Maximum resident set size: 2392 pages
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.202 s
% 0.15/0.46 # System time : 0.013 s
% 0.15/0.46 # Total time : 0.214 s
% 0.15/0.46 # Maximum resident set size: 1760 pages
% 0.15/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------