TSTP Solution File: NUM453+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM453+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:55:49 EDT 2023
% Result : Theorem 0.77s 0.59s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 13 unt; 0 def)
% Number of atoms : 85 ( 45 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 76 ( 31 ~; 31 |; 10 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( sdtpldt0(sz10,xp) != sz10
& sdtpldt0(sz10,smndt0(xp)) != sz10 ),
file('/export/starexec/sandbox/tmp/tmp.4AchJF03Cp/E---3.1_11458.p',m__) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3) )
=> sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtpldt0(X1,X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.4AchJF03Cp/E---3.1_11458.p',mAddAsso) ).
fof(mIntOne,axiom,
aInteger0(sz10),
file('/export/starexec/sandbox/tmp/tmp.4AchJF03Cp/E---3.1_11458.p',mIntOne) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.4AchJF03Cp/E---3.1_11458.p',mIntNeg) ).
fof(m__2171,hypothesis,
( aInteger0(xp)
& xp != sz00
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS))) ),
file('/export/starexec/sandbox/tmp/tmp.4AchJF03Cp/E---3.1_11458.p',m__2171) ).
fof(mAddZero,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.4AchJF03Cp/E---3.1_11458.p',mAddZero) ).
fof(mAddNeg,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,smndt0(X1)) = sz00
& sz00 = sdtpldt0(smndt0(X1),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.4AchJF03Cp/E---3.1_11458.p',mAddNeg) ).
fof(mIntZero,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox/tmp/tmp.4AchJF03Cp/E---3.1_11458.p',mIntZero) ).
fof(c_0_8,negated_conjecture,
~ ( sdtpldt0(sz10,xp) != sz10
& sdtpldt0(sz10,smndt0(xp)) != sz10 ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,plain,
! [X50,X51,X52] :
( ~ aInteger0(X50)
| ~ aInteger0(X51)
| ~ aInteger0(X52)
| sdtpldt0(X50,sdtpldt0(X51,X52)) = sdtpldt0(sdtpldt0(X50,X51),X52) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])]) ).
fof(c_0_10,negated_conjecture,
( sdtpldt0(sz10,xp) = sz10
| sdtpldt0(sz10,smndt0(xp)) = sz10 ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtpldt0(X1,X2),X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( sdtpldt0(sz10,xp) = sz10
| sdtpldt0(sz10,smndt0(xp)) = sz10 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
aInteger0(sz10),
inference(split_conjunct,[status(thm)],[mIntOne]) ).
fof(c_0_14,plain,
! [X60] :
( ~ aInteger0(X60)
| aInteger0(smndt0(X60)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
cnf(c_0_15,negated_conjecture,
( sdtpldt0(sz10,sdtpldt0(smndt0(xp),X1)) = sdtpldt0(sz10,X1)
| sdtpldt0(sz10,xp) = sz10
| ~ aInteger0(smndt0(xp))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[m__2171]) ).
fof(c_0_18,plain,
! [X55] :
( ( sdtpldt0(X55,sz00) = X55
| ~ aInteger0(X55) )
& ( X55 = sdtpldt0(sz00,X55)
| ~ aInteger0(X55) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).
fof(c_0_19,plain,
! [X56] :
( ( sdtpldt0(X56,smndt0(X56)) = sz00
| ~ aInteger0(X56) )
& ( sz00 = sdtpldt0(smndt0(X56),X56)
| ~ aInteger0(X56) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddNeg])])]) ).
cnf(c_0_20,negated_conjecture,
( sdtpldt0(sz10,sdtpldt0(smndt0(xp),X1)) = sdtpldt0(sz10,X1)
| sdtpldt0(sz10,xp) = sz10
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
aInteger0(sz00),
inference(split_conjunct,[status(thm)],[mIntZero]) ).
cnf(c_0_23,plain,
( sz00 = sdtpldt0(smndt0(X1),X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( sdtpldt0(sz10,smndt0(xp)) = sdtpldt0(sz10,sz00)
| sdtpldt0(sz10,xp) = sz10
| ~ aInteger0(smndt0(xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
( sdtpldt0(sz10,xp) = sdtpldt0(sz10,sz00)
| sdtpldt0(sz10,xp) = sz10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_17])]) ).
cnf(c_0_26,negated_conjecture,
( sdtpldt0(sz10,smndt0(xp)) = sdtpldt0(sz10,sz00)
| sdtpldt0(sz10,xp) = sz10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_17])]) ).
cnf(c_0_27,negated_conjecture,
( sdtpldt0(sz10,xp) = sz10
| sdtpldt0(sz10,sz00) != sz10 ),
inference(ef,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
sdtpldt0(sz10,xp) = sz10,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_26]),c_0_27]) ).
cnf(c_0_29,plain,
( smndt0(sz00) = sz00
| ~ aInteger0(smndt0(sz00)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_23]),c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
( sdtpldt0(sz10,sdtpldt0(xp,X1)) = sdtpldt0(sz10,X1)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_28]),c_0_17]),c_0_13])]) ).
cnf(c_0_31,plain,
smndt0(sz00) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_16]),c_0_22])]) ).
cnf(c_0_32,plain,
( sdtpldt0(smndt0(X1),sdtpldt0(X1,X2)) = sdtpldt0(sz00,X2)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_23]),c_0_16]) ).
cnf(c_0_33,negated_conjecture,
sdtpldt0(sz10,sz00) = sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_21]),c_0_28]),c_0_22]),c_0_17])]) ).
cnf(c_0_34,plain,
sdtpldt0(sz00,sz00) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_31]),c_0_22])]) ).
cnf(c_0_35,negated_conjecture,
sdtpldt0(smndt0(sz10),sz10) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_22]),c_0_13])]) ).
cnf(c_0_36,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_37,negated_conjecture,
sdtpldt0(sz00,xp) = sz00,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_17]),c_0_13])]),c_0_35]) ).
cnf(c_0_38,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[m__2171]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_17])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM453+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n017.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon Oct 2 14:02:56 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 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.4AchJF03Cp/E---3.1_11458.p
% 0.77/0.59 # Version: 3.1pre001
% 0.77/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.77/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.77/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.77/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.77/0.59 # Starting sh5l with 300s (1) cores
% 0.77/0.59 # new_bool_1 with pid 11538 completed with status 0
% 0.77/0.59 # Result found by new_bool_1
% 0.77/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.77/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.77/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.77/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.77/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.77/0.59 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.77/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.77/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.77/0.59 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 11541 completed with status 0
% 0.77/0.59 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.77/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.77/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.77/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.77/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.77/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.77/0.59 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.77/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.77/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.77/0.59 # Preprocessing time : 0.002 s
% 0.77/0.59 # Presaturation interreduction done
% 0.77/0.59
% 0.77/0.59 # Proof found!
% 0.77/0.59 # SZS status Theorem
% 0.77/0.59 # SZS output start CNFRefutation
% See solution above
% 0.77/0.59 # Parsed axioms : 48
% 0.77/0.59 # Removed by relevancy pruning/SinE : 8
% 0.77/0.59 # Initial clauses : 91
% 0.77/0.59 # Removed in clause preprocessing : 4
% 0.77/0.59 # Initial clauses in saturation : 87
% 0.77/0.59 # Processed clauses : 893
% 0.77/0.59 # ...of these trivial : 2
% 0.77/0.59 # ...subsumed : 460
% 0.77/0.59 # ...remaining for further processing : 431
% 0.77/0.59 # Other redundant clauses eliminated : 23
% 0.77/0.59 # Clauses deleted for lack of memory : 0
% 0.77/0.59 # Backward-subsumed : 41
% 0.77/0.59 # Backward-rewritten : 37
% 0.77/0.59 # Generated clauses : 2005
% 0.77/0.59 # ...of the previous two non-redundant : 1766
% 0.77/0.59 # ...aggressively subsumed : 0
% 0.77/0.59 # Contextual simplify-reflections : 13
% 0.77/0.59 # Paramodulations : 1966
% 0.77/0.59 # Factorizations : 16
% 0.77/0.59 # NegExts : 0
% 0.77/0.59 # Equation resolutions : 23
% 0.77/0.59 # Total rewrite steps : 1804
% 0.77/0.59 # Propositional unsat checks : 0
% 0.77/0.59 # Propositional check models : 0
% 0.77/0.59 # Propositional check unsatisfiable : 0
% 0.77/0.59 # Propositional clauses : 0
% 0.77/0.59 # Propositional clauses after purity: 0
% 0.77/0.59 # Propositional unsat core size : 0
% 0.77/0.59 # Propositional preprocessing time : 0.000
% 0.77/0.59 # Propositional encoding time : 0.000
% 0.77/0.59 # Propositional solver time : 0.000
% 0.77/0.59 # Success case prop preproc time : 0.000
% 0.77/0.59 # Success case prop encoding time : 0.000
% 0.77/0.59 # Success case prop solver time : 0.000
% 0.77/0.59 # Current number of processed clauses : 248
% 0.77/0.59 # Positive orientable unit clauses : 23
% 0.77/0.59 # Positive unorientable unit clauses: 0
% 0.77/0.59 # Negative unit clauses : 1
% 0.77/0.59 # Non-unit-clauses : 224
% 0.77/0.59 # Current number of unprocessed clauses: 958
% 0.77/0.59 # ...number of literals in the above : 4289
% 0.77/0.59 # Current number of archived formulas : 0
% 0.77/0.59 # Current number of archived clauses : 165
% 0.77/0.59 # Clause-clause subsumption calls (NU) : 8258
% 0.77/0.59 # Rec. Clause-clause subsumption calls : 5397
% 0.77/0.59 # Non-unit clause-clause subsumptions : 511
% 0.77/0.59 # Unit Clause-clause subsumption calls : 101
% 0.77/0.59 # Rewrite failures with RHS unbound : 0
% 0.77/0.59 # BW rewrite match attempts : 6
% 0.77/0.59 # BW rewrite match successes : 5
% 0.77/0.59 # Condensation attempts : 0
% 0.77/0.59 # Condensation successes : 0
% 0.77/0.59 # Termbank termtop insertions : 40999
% 0.77/0.59
% 0.77/0.59 # -------------------------------------------------
% 0.77/0.59 # User time : 0.068 s
% 0.77/0.59 # System time : 0.006 s
% 0.77/0.59 # Total time : 0.074 s
% 0.77/0.59 # Maximum resident set size: 2024 pages
% 0.77/0.59
% 0.77/0.59 # -------------------------------------------------
% 0.77/0.59 # User time : 0.069 s
% 0.77/0.59 # System time : 0.009 s
% 0.77/0.59 # Total time : 0.078 s
% 0.77/0.59 # Maximum resident set size: 1736 pages
% 0.77/0.59 % E---3.1 exiting
% 0.77/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------