TSTP Solution File: NUM423+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM423+3 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:26:06 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 48 ( 18 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 47 ( 18 ~; 13 |; 14 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xa)) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(xa,xa,xq) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__671,hypothesis,
( aInteger0(xa)
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__671) ).
fof(mAddNeg,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,smndt0(X1)) = sz00
& sz00 = sdtpldt0(smndt0(X1),X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddNeg) ).
fof(mMulZero,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulZero) ).
fof(mIntZero,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntZero) ).
fof(c_0_5,negated_conjecture,
~ ( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xa)) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(xa,xa,xq) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,hypothesis,
( aInteger0(xa)
& aInteger0(xq)
& xq != sz00 ),
inference(fof_simplification,[status(thm)],[m__671]) ).
fof(c_0_7,negated_conjecture,
! [X38] :
( ( ~ aInteger0(X38)
| sdtasdt0(xq,X38) != sdtpldt0(xa,smndt0(xa)) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
& ~ sdteqdtlpzmzozddtrp0(xa,xa,xq) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X16] :
( ( sdtpldt0(X16,smndt0(X16)) = sz00
| ~ aInteger0(X16) )
& ( sz00 = sdtpldt0(smndt0(X16),X16)
| ~ aInteger0(X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddNeg])])])]) ).
fof(c_0_9,hypothesis,
( aInteger0(xa)
& aInteger0(xq)
& xq != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X26] :
( ( sdtasdt0(X26,sz00) = sz00
| ~ aInteger0(X26) )
& ( sz00 = sdtasdt0(sz00,X26)
| ~ aInteger0(X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulZero])])])]) ).
cnf(c_0_14,negated_conjecture,
( sdtasdt0(xq,X1) != sz00
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_15,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
aInteger0(sz00),
inference(split_conjunct,[status(thm)],[mIntZero]) ).
cnf(c_0_17,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM423+3 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 04:31:08 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.16/0.44 # Version: 3.1.0
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18108 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 811s (1) cores
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.16/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18113 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 811s (1) cores
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 21
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 36
% 0.16/0.44 # Removed in clause preprocessing : 1
% 0.16/0.44 # Initial clauses in saturation : 35
% 0.16/0.44 # Processed clauses : 70
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 1
% 0.16/0.44 # ...remaining for further processing : 69
% 0.16/0.44 # Other redundant clauses eliminated : 5
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 1
% 0.16/0.44 # Generated clauses : 50
% 0.16/0.44 # ...of the previous two non-redundant : 26
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 1
% 0.16/0.44 # Paramodulations : 45
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 5
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 48
% 0.16/0.44 # ...of those cached : 42
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 31
% 0.16/0.44 # Positive orientable unit clauses : 6
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 4
% 0.16/0.44 # Non-unit-clauses : 21
% 0.16/0.44 # Current number of unprocessed clauses: 24
% 0.16/0.44 # ...number of literals in the above : 88
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 36
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 129
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 78
% 0.16/0.44 # Non-unit clause-clause subsumptions : 1
% 0.16/0.44 # Unit Clause-clause subsumption calls : 0
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 1
% 0.16/0.44 # BW rewrite match successes : 1
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 3127
% 0.16/0.44 # Search garbage collected termcells : 432
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.006 s
% 0.16/0.44 # System time : 0.001 s
% 0.16/0.44 # Total time : 0.008 s
% 0.16/0.44 # Maximum resident set size: 1776 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.025 s
% 0.16/0.44 # System time : 0.004 s
% 0.16/0.44 # Total time : 0.029 s
% 0.16/0.44 # Maximum resident set size: 1704 pages
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------