TSTP Solution File: NUM467+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM467+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:16 EDT 2023
% Result : Theorem 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 9 unt; 0 def)
% Number of atoms : 96 ( 20 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 107 ( 40 ~; 37 |; 25 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn; 20 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mAMDistr,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.UanEUZvUj7/E---3.1_29214.p',mAMDistr) ).
fof(m__1240_04,hypothesis,
( ? [X1] :
( aNaturalNumber0(X1)
& xm = sdtasdt0(xl,X1) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& xn = sdtasdt0(xl,X1) )
& doDivides0(xl,xn) ),
file('/export/starexec/sandbox/tmp/tmp.UanEUZvUj7/E---3.1_29214.p',m__1240_04) ).
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.UanEUZvUj7/E---3.1_29214.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.UanEUZvUj7/E---3.1_29214.p',mSortsB_02) ).
fof(m__1240,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/tmp/tmp.UanEUZvUj7/E---3.1_29214.p',m__1240) ).
fof(m__,conjecture,
( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1) )
| doDivides0(xl,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox/tmp/tmp.UanEUZvUj7/E---3.1_29214.p',m__) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.UanEUZvUj7/E---3.1_29214.p',mSortsB) ).
fof(c_0_7,plain,
! [X22,X23,X24] :
( ( sdtasdt0(X22,sdtpldt0(X23,X24)) = sdtpldt0(sdtasdt0(X22,X23),sdtasdt0(X22,X24))
| ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X23)
| ~ aNaturalNumber0(X24) )
& ( sdtasdt0(sdtpldt0(X23,X24),X22) = sdtpldt0(sdtasdt0(X23,X22),sdtasdt0(X24,X22))
| ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X23)
| ~ aNaturalNumber0(X24) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])]) ).
fof(c_0_8,hypothesis,
( aNaturalNumber0(esk1_0)
& xm = sdtasdt0(xl,esk1_0)
& doDivides0(xl,xm)
& aNaturalNumber0(esk2_0)
& xn = sdtasdt0(xl,esk2_0)
& doDivides0(xl,xn) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1240_04])]) ).
fof(c_0_9,plain,
! [X7,X8,X10] :
( ( aNaturalNumber0(esk3_2(X7,X8))
| ~ doDivides0(X7,X8)
| ~ aNaturalNumber0(X7)
| ~ aNaturalNumber0(X8) )
& ( X8 = sdtasdt0(X7,esk3_2(X7,X8))
| ~ doDivides0(X7,X8)
| ~ aNaturalNumber0(X7)
| ~ aNaturalNumber0(X8) )
& ( ~ aNaturalNumber0(X10)
| X8 != sdtasdt0(X7,X10)
| doDivides0(X7,X8)
| ~ aNaturalNumber0(X7)
| ~ aNaturalNumber0(X8) ) ),
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_10,plain,
! [X14,X15] :
( ~ aNaturalNumber0(X14)
| ~ aNaturalNumber0(X15)
| aNaturalNumber0(sdtasdt0(X14,X15)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_11,plain,
( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
xn = sdtasdt0(xl,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aNaturalNumber0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1240]) ).
fof(c_0_15,negated_conjecture,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1) )
| doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_16,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,hypothesis,
( sdtpldt0(sdtasdt0(xl,X1),xn) = sdtasdt0(xl,sdtpldt0(X1,esk2_0))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_19,hypothesis,
xm = sdtasdt0(xl,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,hypothesis,
aNaturalNumber0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_21,negated_conjecture,
! [X6] :
( ( ~ aNaturalNumber0(X6)
| sdtpldt0(xm,xn) != sdtasdt0(xl,X6) )
& ~ doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_22,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17]) ).
cnf(c_0_23,hypothesis,
sdtasdt0(xl,sdtpldt0(esk1_0,esk2_0)) = sdtpldt0(xm,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,negated_conjecture,
~ doDivides0(xl,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_25,plain,
! [X35,X36] :
( ~ aNaturalNumber0(X35)
| ~ aNaturalNumber0(X36)
| aNaturalNumber0(sdtpldt0(X35,X36)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_26,hypothesis,
~ aNaturalNumber0(sdtpldt0(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_14])]),c_0_24]) ).
cnf(c_0_27,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_13]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NUM467+2 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 14:30:50 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.UanEUZvUj7/E---3.1_29214.p
% 0.20/0.55 # Version: 3.1pre001
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # new_bool_1 with pid 29381 completed with status 0
% 0.20/0.55 # Result found by new_bool_1
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # SAT001_MinMin_p005000_rr_RG with pid 29387 completed with status 0
% 0.20/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # Preprocessing time : 0.002 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Theorem
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 35
% 0.20/0.55 # Removed by relevancy pruning/SinE : 7
% 0.20/0.55 # Initial clauses : 53
% 0.20/0.55 # Removed in clause preprocessing : 1
% 0.20/0.55 # Initial clauses in saturation : 52
% 0.20/0.55 # Processed clauses : 742
% 0.20/0.55 # ...of these trivial : 10
% 0.20/0.55 # ...subsumed : 428
% 0.20/0.55 # ...remaining for further processing : 304
% 0.20/0.55 # Other redundant clauses eliminated : 35
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 37
% 0.20/0.55 # Backward-rewritten : 2
% 0.20/0.55 # Generated clauses : 1476
% 0.20/0.55 # ...of the previous two non-redundant : 1356
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 14
% 0.20/0.55 # Paramodulations : 1436
% 0.20/0.55 # Factorizations : 0
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 40
% 0.20/0.55 # Total rewrite steps : 1357
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 215
% 0.20/0.55 # Positive orientable unit clauses : 21
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 7
% 0.20/0.55 # Non-unit-clauses : 187
% 0.20/0.55 # Current number of unprocessed clauses: 683
% 0.20/0.55 # ...number of literals in the above : 3460
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 86
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 12615
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 2844
% 0.20/0.55 # Non-unit clause-clause subsumptions : 445
% 0.20/0.55 # Unit Clause-clause subsumption calls : 400
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 2
% 0.20/0.55 # BW rewrite match successes : 2
% 0.20/0.55 # Condensation attempts : 0
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 27311
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.052 s
% 0.20/0.55 # System time : 0.002 s
% 0.20/0.55 # Total time : 0.054 s
% 0.20/0.55 # Maximum resident set size: 1864 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.054 s
% 0.20/0.55 # System time : 0.005 s
% 0.20/0.55 # Total time : 0.059 s
% 0.20/0.55 # Maximum resident set size: 1732 pages
% 0.20/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------