TSTP Solution File: NUM845+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM845+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:08:40 EDT 2023
% Result : Theorem 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 23 unt; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 5 ~; 0 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(ind(267), imp(267))',conjecture,
! [X1] :
( vmul(vsucc(vd411),X1) = vplus(vmul(vd411,X1),X1)
=> vmul(vsucc(vd411),vsucc(X1)) = vplus(vmul(vd411,vsucc(X1)),vsucc(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.FZWzSPOGa3/E---3.1_21225.p','qu(ind(267), imp(267))') ).
fof('ass(cond(43, 0), 0)',axiom,
! [X73] : vplus(v1,X73) = vsucc(X73),
file('/export/starexec/sandbox2/tmp/tmp.FZWzSPOGa3/E---3.1_21225.p','ass(cond(43, 0), 0)') ).
fof('qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))',axiom,
! [X77,X78] :
( vplus(X77,vsucc(X78)) = vsucc(vplus(X77,X78))
& vplus(X77,v1) = vsucc(X77) ),
file('/export/starexec/sandbox2/tmp/tmp.FZWzSPOGa3/E---3.1_21225.p','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).
fof('qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))',axiom,
! [X4,X5] :
( vmul(X4,vsucc(X5)) = vplus(vmul(X4,X5),X4)
& vmul(X4,v1) = X4 ),
file('/export/starexec/sandbox2/tmp/tmp.FZWzSPOGa3/E---3.1_21225.p','qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X69,X70] : vplus(X70,X69) = vplus(X69,X70),
file('/export/starexec/sandbox2/tmp/tmp.FZWzSPOGa3/E---3.1_21225.p','ass(cond(61, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X74,X75,X76] : vplus(vplus(X74,X75),X76) = vplus(X74,vplus(X75,X76)),
file('/export/starexec/sandbox2/tmp/tmp.FZWzSPOGa3/E---3.1_21225.p','ass(cond(33, 0), 0)') ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( vmul(vsucc(vd411),X1) = vplus(vmul(vd411,X1),X1)
=> vmul(vsucc(vd411),vsucc(X1)) = vplus(vmul(vd411,vsucc(X1)),vsucc(X1)) ),
inference(assume_negation,[status(cth)],['qu(ind(267), imp(267))']) ).
fof(c_0_7,plain,
! [X135] : vplus(v1,X135) = vsucc(X135),
inference(variable_rename,[status(thm)],['ass(cond(43, 0), 0)']) ).
fof(c_0_8,plain,
! [X136,X137] :
( vplus(X136,vsucc(X137)) = vsucc(vplus(X136,X137))
& vplus(X136,v1) = vsucc(X136) ),
inference(variable_rename,[status(thm)],['qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))']) ).
fof(c_0_9,negated_conjecture,
( vmul(vsucc(vd411),esk1_0) = vplus(vmul(vd411,esk1_0),esk1_0)
& vmul(vsucc(vd411),vsucc(esk1_0)) != vplus(vmul(vd411,vsucc(esk1_0)),vsucc(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_10,plain,
vplus(v1,X1) = vsucc(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
vplus(X1,v1) = vsucc(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X133,X134] :
( vmul(X133,vsucc(X134)) = vplus(vmul(X133,X134),X133)
& vmul(X133,v1) = X133 ),
inference(variable_rename,[status(thm)],['qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))']) ).
fof(c_0_13,plain,
! [X112,X113] : vplus(X113,X112) = vplus(X112,X113),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_0_14,negated_conjecture,
vmul(vsucc(vd411),esk1_0) = vplus(vmul(vd411,esk1_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
vmul(vsucc(vd411),vsucc(esk1_0)) != vplus(vmul(vd411,vsucc(esk1_0)),vsucc(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
vplus(X1,v1) = vplus(v1,X1),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_17,plain,
! [X114,X115,X116] : vplus(vplus(X114,X115),X116) = vplus(X114,vplus(X115,X116)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
cnf(c_0_18,plain,
vmul(X1,vsucc(X2)) = vplus(vmul(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
vmul(vplus(vd411,v1),esk1_0) = vplus(vmul(vd411,esk1_0),esk1_0),
inference(rw,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
vplus(vmul(vd411,vplus(v1,esk1_0)),vplus(v1,esk1_0)) != vmul(vplus(vd411,v1),vplus(v1,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_16]),c_0_16]),c_0_16]) ).
cnf(c_0_22,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
vmul(X1,vplus(X2,v1)) = vplus(X1,vmul(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_11]),c_0_19]) ).
cnf(c_0_24,negated_conjecture,
vmul(vplus(vd411,v1),esk1_0) = vplus(esk1_0,vmul(vd411,esk1_0)),
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
vplus(v1,vplus(esk1_0,vmul(vd411,vplus(v1,esk1_0)))) != vmul(vplus(vd411,v1),vplus(v1,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_19]),c_0_22]) ).
cnf(c_0_26,plain,
vmul(X1,vplus(v1,X2)) = vplus(X1,vmul(X1,X2)),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_27,plain,
vplus(X1,vplus(X2,X3)) = vplus(X2,vplus(X3,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
vplus(vd411,vplus(v1,vplus(esk1_0,vmul(vd411,esk1_0)))) = vmul(vplus(vd411,v1),vplus(v1,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16]),c_0_22]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_19]),c_0_27]),c_0_22]),c_0_19]),c_0_27]),c_0_19]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM845+1 : TPTP v8.1.2. Released v4.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 13:17:34 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 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.FZWzSPOGa3/E---3.1_21225.p
% 0.17/0.48 # Version: 3.1pre001
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # new_bool_3 with pid 21304 completed with status 0
% 0.17/0.48 # Result found by new_bool_3
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FGHPM-FFMS21-MFFFFFNN
% 0.17/0.48 # partial match(1): FGHSM-FFMS21-MFFFFFNN
% 0.17/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.48 # SAT001_MinMin_p005000_rr_RG with pid 21308 completed with status 0
% 0.17/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FGHPM-FFMS21-MFFFFFNN
% 0.17/0.48 # partial match(1): FGHSM-FFMS21-MFFFFFNN
% 0.17/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.48 # Preprocessing time : 0.001 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Theorem
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 58
% 0.17/0.48 # Removed by relevancy pruning/SinE : 27
% 0.17/0.48 # Initial clauses : 34
% 0.17/0.48 # Removed in clause preprocessing : 2
% 0.17/0.48 # Initial clauses in saturation : 32
% 0.17/0.48 # Processed clauses : 266
% 0.17/0.48 # ...of these trivial : 16
% 0.17/0.48 # ...subsumed : 165
% 0.17/0.48 # ...remaining for further processing : 84
% 0.17/0.48 # Other redundant clauses eliminated : 15
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 2
% 0.17/0.48 # Backward-rewritten : 9
% 0.17/0.48 # Generated clauses : 1056
% 0.17/0.48 # ...of the previous two non-redundant : 1028
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 0
% 0.17/0.48 # Paramodulations : 1038
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 18
% 0.17/0.48 # Total rewrite steps : 417
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 56
% 0.17/0.48 # Positive orientable unit clauses : 11
% 0.17/0.48 # Positive unorientable unit clauses: 9
% 0.17/0.48 # Negative unit clauses : 32
% 0.17/0.48 # Non-unit-clauses : 4
% 0.17/0.48 # Current number of unprocessed clauses: 808
% 0.17/0.48 # ...number of literals in the above : 1020
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 25
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 30
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 30
% 0.17/0.48 # Non-unit clause-clause subsumptions : 12
% 0.17/0.48 # Unit Clause-clause subsumption calls : 106
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 129
% 0.17/0.48 # BW rewrite match successes : 70
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 9723
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.017 s
% 0.17/0.48 # System time : 0.001 s
% 0.17/0.48 # Total time : 0.018 s
% 0.17/0.48 # Maximum resident set size: 1900 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.019 s
% 0.17/0.48 # System time : 0.002 s
% 0.17/0.48 # Total time : 0.021 s
% 0.17/0.48 # Maximum resident set size: 1780 pages
% 0.17/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------