TSTP Solution File: NUM490+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM490+1 : 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 18:56:00 EDT 2023
% Result : Theorem 0.22s 0.56s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 33 ( 15 unt; 0 def)
% Number of atoms : 104 ( 22 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 127 ( 56 ~; 52 |; 12 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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; 4 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn; 19 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RNIclVhHGt/E---3.1_10779.p',mDefLE) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.RNIclVhHGt/E---3.1_10779.p',mSortsB) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( X3 = sdtmndt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RNIclVhHGt/E---3.1_10779.p',mDefDiff) ).
fof(m__,conjecture,
sdtasdt0(xr,xm) = sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
file('/export/starexec/sandbox/tmp/tmp.RNIclVhHGt/E---3.1_10779.p',m__) ).
fof(m__1951,hypothesis,
sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
file('/export/starexec/sandbox/tmp/tmp.RNIclVhHGt/E---3.1_10779.p',m__1951) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.RNIclVhHGt/E---3.1_10779.p',mSortsB_02) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmp.RNIclVhHGt/E---3.1_10779.p',m__1837) ).
fof(m__1870,hypothesis,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/tmp/tmp.RNIclVhHGt/E---3.1_10779.p',m__1870) ).
fof(m__1883,hypothesis,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox/tmp/tmp.RNIclVhHGt/E---3.1_10779.p',m__1883) ).
fof(c_0_9,plain,
! [X40,X41,X43] :
( ( aNaturalNumber0(esk2_2(X40,X41))
| ~ sdtlseqdt0(X40,X41)
| ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X41) )
& ( sdtpldt0(X40,esk2_2(X40,X41)) = X41
| ~ sdtlseqdt0(X40,X41)
| ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X41) )
& ( ~ aNaturalNumber0(X43)
| sdtpldt0(X40,X43) != X41
| sdtlseqdt0(X40,X41)
| ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X41) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefLE])])])])]) ).
fof(c_0_10,plain,
! [X24,X25] :
( ~ aNaturalNumber0(X24)
| ~ aNaturalNumber0(X25)
| aNaturalNumber0(sdtpldt0(X24,X25)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
fof(c_0_11,plain,
! [X78,X79,X80] :
( ( aNaturalNumber0(X80)
| X80 != sdtmndt0(X79,X78)
| ~ sdtlseqdt0(X78,X79)
| ~ aNaturalNumber0(X78)
| ~ aNaturalNumber0(X79) )
& ( sdtpldt0(X78,X80) = X79
| X80 != sdtmndt0(X79,X78)
| ~ sdtlseqdt0(X78,X79)
| ~ aNaturalNumber0(X78)
| ~ aNaturalNumber0(X79) )
& ( ~ aNaturalNumber0(X80)
| sdtpldt0(X78,X80) != X79
| X80 = sdtmndt0(X79,X78)
| ~ sdtlseqdt0(X78,X79)
| ~ aNaturalNumber0(X78)
| ~ aNaturalNumber0(X79) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])]) ).
cnf(c_0_12,plain,
( sdtlseqdt0(X2,X3)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( X1 = sdtmndt0(X3,X2)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X2,X1) != X3
| ~ sdtlseqdt0(X2,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( sdtlseqdt0(X1,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_12]),c_0_13]) ).
fof(c_0_16,negated_conjecture,
sdtasdt0(xr,xm) != sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_17,plain,
( sdtmndt0(sdtpldt0(X1,X2),X1) = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_13]),c_0_15]) ).
cnf(c_0_18,hypothesis,
sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
inference(split_conjunct,[status(thm)],[m__1951]) ).
cnf(c_0_19,negated_conjecture,
sdtasdt0(xr,xm) != sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X47,X48] :
( ~ aNaturalNumber0(X47)
| ~ aNaturalNumber0(X48)
| aNaturalNumber0(sdtasdt0(X47,X48)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_21,plain,
( aNaturalNumber0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ sdtlseqdt0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,hypothesis,
( ~ aNaturalNumber0(sdtasdt0(xp,xm))
| ~ aNaturalNumber0(sdtasdt0(xr,xm)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_26,plain,
( aNaturalNumber0(sdtmndt0(X1,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_27,hypothesis,
sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[m__1870]) ).
cnf(c_0_28,hypothesis,
xr = sdtmndt0(xn,xp),
inference(split_conjunct,[status(thm)],[m__1883]) ).
cnf(c_0_29,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_30,hypothesis,
~ aNaturalNumber0(sdtasdt0(xr,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_31,hypothesis,
aNaturalNumber0(xr),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_25]),c_0_29])]) ).
cnf(c_0_32,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_24]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : NUM490+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n012.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 13:23:50 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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.RNIclVhHGt/E---3.1_10779.p
% 0.22/0.56 # Version: 3.1pre001
% 0.22/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 # Starting sh5l with 300s (1) cores
% 0.22/0.56 # new_bool_3 with pid 10858 completed with status 0
% 0.22/0.56 # Result found by new_bool_3
% 0.22/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.56 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.22/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.22/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 10861 completed with status 0
% 0.22/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.22/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.56 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.22/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.22/0.56 # Preprocessing time : 0.002 s
% 0.22/0.56 # Presaturation interreduction done
% 0.22/0.56
% 0.22/0.56 # Proof found!
% 0.22/0.56 # SZS status Theorem
% 0.22/0.56 # SZS output start CNFRefutation
% See solution above
% 0.22/0.56 # Parsed axioms : 47
% 0.22/0.56 # Removed by relevancy pruning/SinE : 2
% 0.22/0.56 # Initial clauses : 79
% 0.22/0.56 # Removed in clause preprocessing : 3
% 0.22/0.56 # Initial clauses in saturation : 76
% 0.22/0.56 # Processed clauses : 207
% 0.22/0.56 # ...of these trivial : 4
% 0.22/0.56 # ...subsumed : 17
% 0.22/0.56 # ...remaining for further processing : 186
% 0.22/0.56 # Other redundant clauses eliminated : 16
% 0.22/0.56 # Clauses deleted for lack of memory : 0
% 0.22/0.56 # Backward-subsumed : 5
% 0.22/0.56 # Backward-rewritten : 9
% 0.22/0.56 # Generated clauses : 390
% 0.22/0.56 # ...of the previous two non-redundant : 353
% 0.22/0.56 # ...aggressively subsumed : 0
% 0.22/0.56 # Contextual simplify-reflections : 4
% 0.22/0.56 # Paramodulations : 368
% 0.22/0.56 # Factorizations : 2
% 0.22/0.56 # NegExts : 0
% 0.22/0.56 # Equation resolutions : 20
% 0.22/0.56 # Total rewrite steps : 319
% 0.22/0.56 # Propositional unsat checks : 0
% 0.22/0.56 # Propositional check models : 0
% 0.22/0.56 # Propositional check unsatisfiable : 0
% 0.22/0.56 # Propositional clauses : 0
% 0.22/0.56 # Propositional clauses after purity: 0
% 0.22/0.56 # Propositional unsat core size : 0
% 0.22/0.56 # Propositional preprocessing time : 0.000
% 0.22/0.56 # Propositional encoding time : 0.000
% 0.22/0.56 # Propositional solver time : 0.000
% 0.22/0.56 # Success case prop preproc time : 0.000
% 0.22/0.56 # Success case prop encoding time : 0.000
% 0.22/0.56 # Success case prop solver time : 0.000
% 0.22/0.56 # Current number of processed clauses : 93
% 0.22/0.56 # Positive orientable unit clauses : 28
% 0.22/0.56 # Positive unorientable unit clauses: 0
% 0.22/0.56 # Negative unit clauses : 8
% 0.22/0.56 # Non-unit-clauses : 57
% 0.22/0.56 # Current number of unprocessed clauses: 291
% 0.22/0.56 # ...number of literals in the above : 1192
% 0.22/0.56 # Current number of archived formulas : 0
% 0.22/0.56 # Current number of archived clauses : 85
% 0.22/0.56 # Clause-clause subsumption calls (NU) : 962
% 0.22/0.56 # Rec. Clause-clause subsumption calls : 293
% 0.22/0.56 # Non-unit clause-clause subsumptions : 23
% 0.22/0.56 # Unit Clause-clause subsumption calls : 100
% 0.22/0.56 # Rewrite failures with RHS unbound : 0
% 0.22/0.56 # BW rewrite match attempts : 5
% 0.22/0.56 # BW rewrite match successes : 5
% 0.22/0.56 # Condensation attempts : 0
% 0.22/0.56 # Condensation successes : 0
% 0.22/0.56 # Termbank termtop insertions : 11478
% 0.22/0.56
% 0.22/0.56 # -------------------------------------------------
% 0.22/0.56 # User time : 0.025 s
% 0.22/0.56 # System time : 0.002 s
% 0.22/0.56 # Total time : 0.027 s
% 0.22/0.56 # Maximum resident set size: 2040 pages
% 0.22/0.56
% 0.22/0.56 # -------------------------------------------------
% 0.22/0.56 # User time : 0.029 s
% 0.22/0.56 # System time : 0.003 s
% 0.22/0.56 # Total time : 0.031 s
% 0.22/0.56 # Maximum resident set size: 1728 pages
% 0.22/0.56 % E---3.1 exiting
% 0.22/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------