TSTP Solution File: NUM468+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM468+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : Sat May 4 08:54:47 EDT 2024
% Result : Theorem 0.16s 0.57s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 100 ( 38 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 126 ( 52 ~; 49 |; 16 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lizqkNQhDc/E---3.1_1501.p',mDefQuot) ).
fof(m__,conjecture,
( xl != sz00
=> sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) ),
file('/export/starexec/sandbox/tmp/tmp.lizqkNQhDc/E---3.1_1501.p',m__) ).
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.lizqkNQhDc/E---3.1_1501.p',mAMDistr) ).
fof(m__1240_04,hypothesis,
( doDivides0(xl,xm)
& doDivides0(xl,xn) ),
file('/export/starexec/sandbox/tmp/tmp.lizqkNQhDc/E---3.1_1501.p',m__1240_04) ).
fof(m__1240,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/tmp/tmp.lizqkNQhDc/E---3.1_1501.p',m__1240) ).
fof(c_0_5,plain,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefQuot]) ).
fof(c_0_6,plain,
! [X50,X51,X52] :
( ( aNaturalNumber0(X52)
| X52 != sdtsldt0(X51,X50)
| X50 = sz00
| ~ doDivides0(X50,X51)
| ~ aNaturalNumber0(X50)
| ~ aNaturalNumber0(X51) )
& ( X51 = sdtasdt0(X50,X52)
| X52 != sdtsldt0(X51,X50)
| X50 = sz00
| ~ doDivides0(X50,X51)
| ~ aNaturalNumber0(X50)
| ~ aNaturalNumber0(X51) )
& ( ~ aNaturalNumber0(X52)
| X51 != sdtasdt0(X50,X52)
| X52 = sdtsldt0(X51,X50)
| X50 = sz00
| ~ doDivides0(X50,X51)
| ~ aNaturalNumber0(X50)
| ~ aNaturalNumber0(X51) ) ),
inference(distribute,[status(thm)],[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_7,negated_conjecture,
~ ( xl != sz00
=> sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_8,plain,
! [X13,X14,X15] :
( ( sdtasdt0(X13,sdtpldt0(X14,X15)) = sdtpldt0(sdtasdt0(X13,X14),sdtasdt0(X13,X15))
| ~ aNaturalNumber0(X13)
| ~ aNaturalNumber0(X14)
| ~ aNaturalNumber0(X15) )
& ( sdtasdt0(sdtpldt0(X14,X15),X13) = sdtpldt0(sdtasdt0(X14,X13),sdtasdt0(X15,X13))
| ~ aNaturalNumber0(X13)
| ~ aNaturalNumber0(X14)
| ~ aNaturalNumber0(X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])])]) ).
cnf(c_0_9,plain,
( X1 = sdtasdt0(X2,X3)
| X2 = sz00
| X3 != sdtsldt0(X1,X2)
| ~ doDivides0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( aNaturalNumber0(X1)
| X3 = sz00
| X1 != sdtsldt0(X2,X3)
| ~ doDivides0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
( xl != sz00
& sdtpldt0(xm,xn) != sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
cnf(c_0_12,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_8]) ).
cnf(c_0_13,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
sdtpldt0(xm,xn) != sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( sdtasdt0(X1,sdtpldt0(X2,sdtsldt0(X3,X1))) = sdtpldt0(sdtasdt0(X1,X2),X3)
| X1 = sz00
| ~ doDivides0(X1,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,hypothesis,
doDivides0(xl,xn),
inference(split_conjunct,[status(thm)],[m__1240_04]) ).
cnf(c_0_18,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1240]) ).
cnf(c_0_19,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1240]) ).
cnf(c_0_20,negated_conjecture,
xl != sz00,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
( sdtpldt0(sdtasdt0(xl,sdtsldt0(xm,xl)),xn) != sdtpldt0(xm,xn)
| ~ aNaturalNumber0(sdtsldt0(xm,xl)) ),
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_15,c_0_16]),c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_22,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[m__1240_04]) ).
cnf(c_0_23,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1240]) ).
cnf(c_0_24,negated_conjecture,
~ aNaturalNumber0(sdtsldt0(xm,xl)),
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_21,c_0_13]),c_0_22]),c_0_18]),c_0_23])]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
$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_24,c_0_14]),c_0_22]),c_0_18]),c_0_23])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM468+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n032.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 09:32:24 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.lizqkNQhDc/E---3.1_1501.p
% 0.16/0.57 # Version: 3.1.0
% 0.16/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.57 # Starting sh5l with 300s (1) cores
% 0.16/0.57 # sh5l with pid 1582 completed with status 0
% 0.16/0.57 # Result found by sh5l
% 0.16/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.57 # Starting sh5l with 300s (1) cores
% 0.16/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.57 # Search class: FGUSF-FFMM22-MFFFFFNN
% 0.16/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.57 # SAT001_MinMin_p005000_rr_RG with pid 1588 completed with status 0
% 0.16/0.57 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.57 # Starting sh5l with 300s (1) cores
% 0.16/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.57 # Search class: FGUSF-FFMM22-MFFFFFNN
% 0.16/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.57 # Preprocessing time : 0.001 s
% 0.16/0.57 # Presaturation interreduction done
% 0.16/0.57
% 0.16/0.57 # Proof found!
% 0.16/0.57 # SZS status Theorem
% 0.16/0.57 # SZS output start CNFRefutation
% See solution above
% 0.16/0.57 # Parsed axioms : 35
% 0.16/0.57 # Removed by relevancy pruning/SinE : 3
% 0.16/0.57 # Initial clauses : 58
% 0.16/0.57 # Removed in clause preprocessing : 2
% 0.16/0.57 # Initial clauses in saturation : 56
% 0.16/0.57 # Processed clauses : 1433
% 0.16/0.57 # ...of these trivial : 66
% 0.16/0.57 # ...subsumed : 870
% 0.16/0.57 # ...remaining for further processing : 497
% 0.16/0.57 # Other redundant clauses eliminated : 115
% 0.16/0.57 # Clauses deleted for lack of memory : 0
% 0.16/0.57 # Backward-subsumed : 33
% 0.16/0.57 # Backward-rewritten : 13
% 0.16/0.57 # Generated clauses : 7175
% 0.16/0.57 # ...of the previous two non-redundant : 6419
% 0.16/0.57 # ...aggressively subsumed : 0
% 0.16/0.57 # Contextual simplify-reflections : 64
% 0.16/0.57 # Paramodulations : 7051
% 0.16/0.57 # Factorizations : 0
% 0.16/0.57 # NegExts : 0
% 0.16/0.57 # Equation resolutions : 124
% 0.16/0.57 # Disequality decompositions : 0
% 0.16/0.57 # Total rewrite steps : 5163
% 0.16/0.57 # ...of those cached : 5141
% 0.16/0.57 # Propositional unsat checks : 0
% 0.16/0.57 # Propositional check models : 0
% 0.16/0.57 # Propositional check unsatisfiable : 0
% 0.16/0.57 # Propositional clauses : 0
% 0.16/0.57 # Propositional clauses after purity: 0
% 0.16/0.57 # Propositional unsat core size : 0
% 0.16/0.57 # Propositional preprocessing time : 0.000
% 0.16/0.57 # Propositional encoding time : 0.000
% 0.16/0.57 # Propositional solver time : 0.000
% 0.16/0.57 # Success case prop preproc time : 0.000
% 0.16/0.57 # Success case prop encoding time : 0.000
% 0.16/0.57 # Success case prop solver time : 0.000
% 0.16/0.57 # Current number of processed clauses : 394
% 0.16/0.57 # Positive orientable unit clauses : 23
% 0.16/0.57 # Positive unorientable unit clauses: 0
% 0.16/0.57 # Negative unit clauses : 7
% 0.16/0.57 # Non-unit-clauses : 364
% 0.16/0.57 # Current number of unprocessed clauses: 5051
% 0.16/0.57 # ...number of literals in the above : 30190
% 0.16/0.57 # Current number of archived formulas : 0
% 0.16/0.57 # Current number of archived clauses : 97
% 0.16/0.57 # Clause-clause subsumption calls (NU) : 19690
% 0.16/0.57 # Rec. Clause-clause subsumption calls : 5972
% 0.16/0.57 # Non-unit clause-clause subsumptions : 873
% 0.16/0.57 # Unit Clause-clause subsumption calls : 242
% 0.16/0.57 # Rewrite failures with RHS unbound : 0
% 0.16/0.57 # BW rewrite match attempts : 7
% 0.16/0.57 # BW rewrite match successes : 7
% 0.16/0.57 # Condensation attempts : 0
% 0.16/0.57 # Condensation successes : 0
% 0.16/0.57 # Termbank termtop insertions : 131854
% 0.16/0.57 # Search garbage collected termcells : 932
% 0.16/0.57
% 0.16/0.57 # -------------------------------------------------
% 0.16/0.57 # User time : 0.134 s
% 0.16/0.57 # System time : 0.006 s
% 0.16/0.57 # Total time : 0.140 s
% 0.16/0.57 # Maximum resident set size: 1856 pages
% 0.16/0.57
% 0.16/0.57 # -------------------------------------------------
% 0.16/0.57 # User time : 0.135 s
% 0.16/0.57 # System time : 0.007 s
% 0.16/0.57 # Total time : 0.143 s
% 0.16/0.57 # Maximum resident set size: 1752 pages
% 0.16/0.57 % E---3.1 exiting
% 0.16/0.57 % E exiting
%------------------------------------------------------------------------------