TSTP Solution File: NUM427+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM427+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:05 EDT 2023
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 27 ( 7 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 24 ( 10 ~; 8 |; 5 &)
% ( 0 <=>; 1 =>; 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn; 3 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xb,smndt0(xa)) )
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
file('/export/starexec/sandbox2/tmp/tmp.3nU6v3MvE1/E---3.1_31358.p',m__) ).
fof(m__767,hypothesis,
sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
file('/export/starexec/sandbox2/tmp/tmp.3nU6v3MvE1/E---3.1_31358.p',m__767) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.3nU6v3MvE1/E---3.1_31358.p',mIntNeg) ).
fof(m__747,hypothesis,
( aInteger0(xn)
& sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox2/tmp/tmp.3nU6v3MvE1/E---3.1_31358.p',m__747) ).
fof(c_0_4,negated_conjecture,
~ ( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xb,smndt0(xa)) )
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X5] :
( ( ~ aInteger0(X5)
| sdtasdt0(xq,X5) != sdtpldt0(xb,smndt0(xa)) )
& ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
& ~ sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtpldt0(xb,smndt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,hypothesis,
sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
inference(split_conjunct,[status(thm)],[m__767]) ).
fof(c_0_8,plain,
! [X31] :
( ~ aInteger0(X31)
| aInteger0(smndt0(X31)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
cnf(c_0_9,hypothesis,
~ aInteger0(smndt0(xn)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
aInteger0(xn),
inference(split_conjunct,[status(thm)],[m__747]) ).
cnf(c_0_12,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM427+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 14:58:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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/tmp/tmp.3nU6v3MvE1/E---3.1_31358.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 31437 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 31440 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 25
% 0.21/0.52 # Removed by relevancy pruning/SinE : 3
% 0.21/0.52 # Initial clauses : 40
% 0.21/0.52 # Removed in clause preprocessing : 1
% 0.21/0.52 # Initial clauses in saturation : 39
% 0.21/0.52 # Processed clauses : 60
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 60
% 0.21/0.52 # Other redundant clauses eliminated : 2
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 1
% 0.21/0.52 # Generated clauses : 5
% 0.21/0.52 # ...of the previous two non-redundant : 4
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 1
% 0.21/0.52 # Paramodulations : 3
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 2
% 0.21/0.52 # Total rewrite steps : 4
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 18
% 0.21/0.52 # Positive orientable unit clauses : 10
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 4
% 0.21/0.52 # Non-unit-clauses : 4
% 0.21/0.52 # Current number of unprocessed clauses: 22
% 0.21/0.52 # ...number of literals in the above : 72
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 40
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 120
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 55
% 0.21/0.52 # Non-unit clause-clause subsumptions : 1
% 0.21/0.52 # Unit Clause-clause subsumption calls : 4
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 1
% 0.21/0.52 # BW rewrite match successes : 1
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 2298
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.005 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.009 s
% 0.21/0.52 # Maximum resident set size: 1848 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.007 s
% 0.21/0.52 # System time : 0.006 s
% 0.21/0.52 # Total time : 0.013 s
% 0.21/0.52 # Maximum resident set size: 1700 pages
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------