TSTP Solution File: NUM525+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM525+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 19:07:32 EDT 2023
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 16 unt; 0 def)
% Number of atoms : 97 ( 41 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 113 ( 48 ~; 46 |; 14 &)
% ( 1 <=>; 4 =>; 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; 5 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn; 16 !; 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/sandbox2/tmp/tmp.t07CgTbAxV/E---3.1_19599.p',mDefQuot) ).
fof(m__,conjecture,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),
file('/export/starexec/sandbox2/tmp/tmp.t07CgTbAxV/E---3.1_19599.p',m__) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.t07CgTbAxV/E---3.1_19599.p',mMulAsso) ).
fof(m__3046,hypothesis,
( doDivides0(xp,sdtasdt0(xn,xn))
& doDivides0(xp,xn) ),
file('/export/starexec/sandbox2/tmp/tmp.t07CgTbAxV/E---3.1_19599.p',m__3046) ).
fof(m__3059,hypothesis,
xq = sdtsldt0(xn,xp),
file('/export/starexec/sandbox2/tmp/tmp.t07CgTbAxV/E---3.1_19599.p',m__3059) ).
fof(m__2987,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp)
& xn != sz00
& xm != sz00
& xp != sz00 ),
file('/export/starexec/sandbox2/tmp/tmp.t07CgTbAxV/E---3.1_19599.p',m__2987) ).
fof(m__3014,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
file('/export/starexec/sandbox2/tmp/tmp.t07CgTbAxV/E---3.1_19599.p',m__3014) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.t07CgTbAxV/E---3.1_19599.p',mMulComm) ).
fof(c_0_8,plain,
! [X56,X57,X58] :
( ( aNaturalNumber0(X58)
| X58 != sdtsldt0(X57,X56)
| X56 = sz00
| ~ doDivides0(X56,X57)
| ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X57) )
& ( X57 = sdtasdt0(X56,X58)
| X58 != sdtsldt0(X57,X56)
| X56 = sz00
| ~ doDivides0(X56,X57)
| ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X57) )
& ( ~ aNaturalNumber0(X58)
| X57 != sdtasdt0(X56,X58)
| X58 = sdtsldt0(X57,X56)
| X56 = sz00
| ~ doDivides0(X56,X57)
| ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X57) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefQuot])])])]) ).
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_8]) ).
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_8]) ).
fof(c_0_11,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xm,xm)) != sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_12,plain,
! [X35,X36,X37] :
( ~ aNaturalNumber0(X35)
| ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X37)
| sdtasdt0(sdtasdt0(X35,X36),X37) = sdtasdt0(X35,sdtasdt0(X36,X37)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
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,hypothesis,
doDivides0(xp,xn),
inference(split_conjunct,[status(thm)],[m__3046]) ).
cnf(c_0_15,hypothesis,
xq = sdtsldt0(xn,xp),
inference(split_conjunct,[status(thm)],[m__3059]) ).
cnf(c_0_16,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_17,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_18,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_19,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xm,xm)) != sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
inference(split_conjunct,[status(thm)],[m__3014]) ).
cnf(c_0_22,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,hypothesis,
sdtasdt0(xp,xq) = xn,
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_13,c_0_14]),c_0_15]),c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(xq),
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_19,c_0_14]),c_0_15]),c_0_16]),c_0_17])]),c_0_18]) ).
fof(c_0_25,plain,
! [X33,X34] :
( ~ aNaturalNumber0(X33)
| ~ aNaturalNumber0(X34)
| sdtasdt0(X33,X34) = sdtasdt0(X34,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
cnf(c_0_26,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))) != sdtasdt0(xn,xn),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,hypothesis,
( sdtasdt0(xp,sdtasdt0(xq,X1)) = sdtasdt0(xn,X1)
| ~ aNaturalNumber0(X1) ),
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_16])]) ).
cnf(c_0_28,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xn,xq)) != sdtasdt0(xn,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24])]) ).
cnf(c_0_30,hypothesis,
( sdtasdt0(xp,sdtasdt0(X1,xq)) = sdtasdt0(xn,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : NUM525+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n017.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:12:11 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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.t07CgTbAxV/E---3.1_19599.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_1 with pid 19678 completed with status 0
% 0.21/0.53 # Result found by new_bool_1
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19680 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.002 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 46
% 0.21/0.53 # Removed by relevancy pruning/SinE : 1
% 0.21/0.53 # Initial clauses : 81
% 0.21/0.53 # Removed in clause preprocessing : 3
% 0.21/0.53 # Initial clauses in saturation : 78
% 0.21/0.53 # Processed clauses : 244
% 0.21/0.53 # ...of these trivial : 3
% 0.21/0.53 # ...subsumed : 23
% 0.21/0.53 # ...remaining for further processing : 218
% 0.21/0.53 # Other redundant clauses eliminated : 17
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 3
% 0.21/0.53 # Backward-rewritten : 4
% 0.21/0.53 # Generated clauses : 741
% 0.21/0.53 # ...of the previous two non-redundant : 667
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 4
% 0.21/0.53 # Paramodulations : 721
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 20
% 0.21/0.53 # Total rewrite steps : 526
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 130
% 0.21/0.53 # Positive orientable unit clauses : 30
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 9
% 0.21/0.53 # Non-unit-clauses : 91
% 0.21/0.53 # Current number of unprocessed clauses: 543
% 0.21/0.53 # ...number of literals in the above : 2461
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 80
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 1031
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 282
% 0.21/0.53 # Non-unit clause-clause subsumptions : 21
% 0.21/0.53 # Unit Clause-clause subsumption calls : 52
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 5
% 0.21/0.53 # BW rewrite match successes : 5
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 17792
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.026 s
% 0.21/0.53 # System time : 0.000 s
% 0.21/0.53 # Total time : 0.026 s
% 0.21/0.53 # Maximum resident set size: 2028 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.027 s
% 0.21/0.53 # System time : 0.003 s
% 0.21/0.53 # Total time : 0.030 s
% 0.21/0.53 # Maximum resident set size: 1724 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------