TSTP Solution File: NUM514+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM514+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:38 EDT 2024
% Result : Theorem 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 27 ( 12 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 26 ( 8 ~; 5 |; 11 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn 1 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aNaturalNumber0(sdtsldt0(xn,xr))
& xn = sdtasdt0(xr,sdtsldt0(xn,xr)) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,X1) )
| doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2613,hypothesis,
( aNaturalNumber0(sdtsldt0(xk,xr))
& xk = sdtasdt0(xr,sdtsldt0(xk,xr))
& aNaturalNumber0(sdtsldt0(xn,xr))
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2613) ).
fof(c_0_2,negated_conjecture,
~ ( ( aNaturalNumber0(sdtsldt0(xn,xr))
& xn = sdtasdt0(xr,sdtsldt0(xn,xr)) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,X1) )
| doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,negated_conjecture,
! [X116] :
( aNaturalNumber0(sdtsldt0(xn,xr))
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& ( ~ aNaturalNumber0(X116)
| sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,X116) )
& ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
cnf(c_0_4,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,hypothesis,
sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm),
inference(split_conjunct,[status(thm)],[m__2613]) ).
cnf(c_0_6,negated_conjecture,
( sdtasdt0(xp,sdtsldt0(xk,xr)) != sdtasdt0(xp,X1)
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,hypothesis,
aNaturalNumber0(sdtsldt0(xk,xr)),
inference(split_conjunct,[status(thm)],[m__2613]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM514+3 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 06:52:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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/benchmark/theBenchmark.p
% 0.19/0.54 # Version: 3.1.0
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.54 # Starting sh5l with 300s (1) cores
% 0.19/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 18196 completed with status 0
% 0.19/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # No SInE strategy applied
% 0.19/0.54 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.19/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 # Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.54 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 18207 completed with status 0
% 0.19/0.54 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # No SInE strategy applied
% 0.19/0.54 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.19/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 # Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.54 # Preprocessing time : 0.005 s
% 0.19/0.54 # Presaturation interreduction done
% 0.19/0.54
% 0.19/0.54 # Proof found!
% 0.19/0.54 # SZS status Theorem
% 0.19/0.54 # SZS output start CNFRefutation
% See solution above
% 0.19/0.54 # Parsed axioms : 56
% 0.19/0.54 # Removed by relevancy pruning/SinE : 0
% 0.19/0.54 # Initial clauses : 279
% 0.19/0.54 # Removed in clause preprocessing : 3
% 0.19/0.54 # Initial clauses in saturation : 276
% 0.19/0.54 # Processed clauses : 365
% 0.19/0.54 # ...of these trivial : 11
% 0.19/0.54 # ...subsumed : 7
% 0.19/0.54 # ...remaining for further processing : 347
% 0.19/0.54 # Other redundant clauses eliminated : 11
% 0.19/0.54 # Clauses deleted for lack of memory : 0
% 0.19/0.54 # Backward-subsumed : 0
% 0.19/0.54 # Backward-rewritten : 2
% 0.19/0.54 # Generated clauses : 14
% 0.19/0.54 # ...of the previous two non-redundant : 15
% 0.19/0.54 # ...aggressively subsumed : 0
% 0.19/0.54 # Contextual simplify-reflections : 6
% 0.19/0.54 # Paramodulations : 2
% 0.19/0.54 # Factorizations : 0
% 0.19/0.54 # NegExts : 0
% 0.19/0.54 # Equation resolutions : 12
% 0.19/0.54 # Disequality decompositions : 0
% 0.19/0.54 # Total rewrite steps : 25
% 0.19/0.54 # ...of those cached : 16
% 0.19/0.54 # Propositional unsat checks : 0
% 0.19/0.54 # Propositional check models : 0
% 0.19/0.54 # Propositional check unsatisfiable : 0
% 0.19/0.54 # Propositional clauses : 0
% 0.19/0.54 # Propositional clauses after purity: 0
% 0.19/0.54 # Propositional unsat core size : 0
% 0.19/0.54 # Propositional preprocessing time : 0.000
% 0.19/0.54 # Propositional encoding time : 0.000
% 0.19/0.54 # Propositional solver time : 0.000
% 0.19/0.54 # Success case prop preproc time : 0.000
% 0.19/0.54 # Success case prop encoding time : 0.000
% 0.19/0.54 # Success case prop solver time : 0.000
% 0.19/0.54 # Current number of processed clauses : 76
% 0.19/0.54 # Positive orientable unit clauses : 46
% 0.19/0.54 # Positive unorientable unit clauses: 0
% 0.19/0.54 # Negative unit clauses : 16
% 0.19/0.54 # Non-unit-clauses : 14
% 0.19/0.54 # Current number of unprocessed clauses: 184
% 0.19/0.54 # ...number of literals in the above : 1542
% 0.19/0.54 # Current number of archived formulas : 0
% 0.19/0.54 # Current number of archived clauses : 260
% 0.19/0.54 # Clause-clause subsumption calls (NU) : 26993
% 0.19/0.54 # Rec. Clause-clause subsumption calls : 150
% 0.19/0.54 # Non-unit clause-clause subsumptions : 11
% 0.19/0.54 # Unit Clause-clause subsumption calls : 564
% 0.19/0.54 # Rewrite failures with RHS unbound : 0
% 0.19/0.54 # BW rewrite match attempts : 1
% 0.19/0.54 # BW rewrite match successes : 1
% 0.19/0.54 # Condensation attempts : 0
% 0.19/0.54 # Condensation successes : 0
% 0.19/0.54 # Termbank termtop insertions : 22833
% 0.19/0.54 # Search garbage collected termcells : 2495
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.054 s
% 0.19/0.54 # System time : 0.004 s
% 0.19/0.54 # Total time : 0.058 s
% 0.19/0.54 # Maximum resident set size: 2452 pages
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.218 s
% 0.19/0.54 # System time : 0.017 s
% 0.19/0.54 # Total time : 0.235 s
% 0.19/0.54 # Maximum resident set size: 1768 pages
% 0.19/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------