TSTP Solution File: NUM849+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM849+1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Tue May 21 01:17:32 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 24 unt; 0 def)
% Number of atoms : 48 ( 47 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 9 ~; 4 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(ind(296), imp(296))',conjecture,
! [X1] :
( vmul(vmul(vd448,vd449),X1) = vmul(vd448,vmul(vd449,X1))
=> vmul(vmul(vd448,vd449),vsucc(X1)) = vmul(vd448,vmul(vd449,vsucc(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(ind(296), imp(296))') ).
fof('ass(cond(conseq(292), 1), 1)',axiom,
! [X2] :
( vmul(vmul(vd448,vd449),X2) = vmul(vd448,vmul(vd449,X2))
=> vplus(vmul(vd448,vmul(vd449,X2)),vmul(vd448,vd449)) = vmul(vd448,vplus(vmul(vd449,X2),vd449)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(conseq(292), 1), 1)') ).
fof('ass(cond(270, 0), 0)',axiom,
! [X6,X7] : vmul(X6,X7) = vmul(X7,X6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(270, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X76,X77] : vplus(X77,X76) = vplus(X76,X77),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))',axiom,
! [X11,X12] :
( vmul(X11,vsucc(X12)) = vplus(vmul(X11,X12),X11)
& vmul(X11,v1) = X11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))') ).
fof('qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))',axiom,
! [X84,X85] :
( vplus(X84,vsucc(X85)) = vsucc(vplus(X84,X85))
& vplus(X84,v1) = vsucc(X84) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).
fof('ass(cond(261, 0), 0)',axiom,
! [X8,X9] : vmul(vsucc(X8),X9) = vplus(vmul(X8,X9),X9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(261, 0), 0)') ).
fof('ass(cond(43, 0), 0)',axiom,
! [X80] : vplus(v1,X80) = vsucc(X80),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(43, 0), 0)') ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( vmul(vmul(vd448,vd449),X1) = vmul(vd448,vmul(vd449,X1))
=> vmul(vmul(vd448,vd449),vsucc(X1)) = vmul(vd448,vmul(vd449,vsucc(X1))) ),
inference(assume_negation,[status(cth)],['qu(ind(296), imp(296))']) ).
fof(c_0_9,plain,
! [X116] :
( vmul(vmul(vd448,vd449),X116) != vmul(vd448,vmul(vd449,X116))
| vplus(vmul(vd448,vmul(vd449,X116)),vmul(vd448,vd449)) = vmul(vd448,vplus(vmul(vd449,X116),vd449)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conseq(292), 1), 1)'])])]) ).
fof(c_0_10,plain,
! [X97,X98] : vmul(X97,X98) = vmul(X98,X97),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
fof(c_0_11,plain,
! [X144,X145] : vplus(X145,X144) = vplus(X144,X145),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_12,plain,
! [X102,X103] :
( vmul(X102,vsucc(X103)) = vplus(vmul(X102,X103),X102)
& vmul(X102,v1) = X102 ),
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,
! [X107,X108] :
( vplus(X107,vsucc(X108)) = vsucc(vplus(X107,X108))
& vplus(X107,v1) = vsucc(X107) ),
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_14,plain,
! [X99,X100] : vmul(vsucc(X99),X100) = vplus(vmul(X99,X100),X100),
inference(variable_rename,[status(thm)],['ass(cond(261, 0), 0)']) ).
fof(c_0_15,negated_conjecture,
( vmul(vmul(vd448,vd449),esk1_0) = vmul(vd448,vmul(vd449,esk1_0))
& vmul(vmul(vd448,vd449),vsucc(esk1_0)) != vmul(vd448,vmul(vd449,vsucc(esk1_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_16,plain,
! [X106] : vplus(v1,X106) = vsucc(X106),
inference(variable_rename,[status(thm)],['ass(cond(43, 0), 0)']) ).
cnf(c_0_17,plain,
( vplus(vmul(vd448,vmul(vd449,X1)),vmul(vd448,vd449)) = vmul(vd448,vplus(vmul(vd449,X1),vd449))
| vmul(vmul(vd448,vd449),X1) != vmul(vd448,vmul(vd449,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
vmul(X1,vsucc(X2)) = vplus(vmul(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
vplus(X1,v1) = vsucc(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
vmul(vsucc(X1),X2) = vplus(vmul(X1,X2),X2),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
vmul(vmul(vd448,vd449),esk1_0) = vmul(vd448,vmul(vd449,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
vplus(v1,X1) = vsucc(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
vmul(vmul(vd448,vd449),vsucc(esk1_0)) != vmul(vd448,vmul(vd449,vsucc(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( vplus(vmul(vd449,vd448),vmul(vd448,vmul(vd449,X1))) = vmul(vd448,vplus(vd449,vmul(vd449,X1)))
| vmul(vmul(vd449,vd448),X1) != vmul(vd448,vmul(vd449,X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_19]),c_0_18]) ).
cnf(c_0_27,plain,
vplus(X1,vmul(X1,X2)) = vmul(X1,vplus(X2,v1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_19]) ).
cnf(c_0_28,plain,
vplus(X1,vmul(X2,X1)) = vmul(vplus(X2,v1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_21]),c_0_19]) ).
cnf(c_0_29,negated_conjecture,
vmul(esk1_0,vmul(vd449,vd448)) = vmul(vd448,vmul(vd449,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_18]),c_0_18]) ).
cnf(c_0_30,plain,
vplus(X1,v1) = vplus(v1,X1),
inference(rw,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_31,negated_conjecture,
vmul(vmul(vd448,vd449),vplus(esk1_0,v1)) != vmul(vd448,vmul(vd449,vplus(esk1_0,v1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_21]),c_0_21]) ).
cnf(c_0_32,plain,
( vplus(vmul(vd449,vd448),vmul(vd448,vmul(vd449,X1))) = vmul(vd448,vmul(vd449,vplus(X1,v1)))
| vmul(vmul(vd449,vd448),X1) != vmul(vd448,vmul(vd449,X1)) ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
vplus(vmul(vd449,vd448),vmul(vd448,vmul(vd449,esk1_0))) = vmul(vmul(vd449,vd448),vplus(v1,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_18]) ).
cnf(c_0_34,negated_conjecture,
vmul(vmul(vd449,vd448),vplus(v1,esk1_0)) != vmul(vd448,vmul(vd449,vplus(v1,esk1_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_30]),c_0_30]),c_0_18]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_30]),c_0_34]),c_0_18]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM849+1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 06:08:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # new_bool_3 with pid 7220 completed with status 0
% 0.19/0.51 # Result found by new_bool_3
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHPM-FFMS21-MFFFFFNN
% 0.19/0.51 # partial match(1): FGHSM-FFMS21-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.51 # SAT001_MinMin_p005000_rr_RG with pid 7223 completed with status 0
% 0.19/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHPM-FFMS21-MFFFFFNN
% 0.19/0.51 # partial match(1): FGHSM-FFMS21-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.51 # Preprocessing time : 0.001 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 56
% 0.19/0.51 # Removed by relevancy pruning/SinE : 27
% 0.19/0.51 # Initial clauses : 32
% 0.19/0.51 # Removed in clause preprocessing : 2
% 0.19/0.51 # Initial clauses in saturation : 30
% 0.19/0.51 # Processed clauses : 299
% 0.19/0.51 # ...of these trivial : 7
% 0.19/0.51 # ...subsumed : 186
% 0.19/0.51 # ...remaining for further processing : 105
% 0.19/0.51 # Other redundant clauses eliminated : 17
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 2
% 0.19/0.51 # Backward-rewritten : 13
% 0.19/0.51 # Generated clauses : 1017
% 0.19/0.51 # ...of the previous two non-redundant : 990
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 0
% 0.19/0.51 # Paramodulations : 997
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 20
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 296
% 0.19/0.51 # ...of those cached : 183
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 70
% 0.19/0.51 # Positive orientable unit clauses : 15
% 0.19/0.51 # Positive unorientable unit clauses: 5
% 0.19/0.51 # Negative unit clauses : 43
% 0.19/0.51 # Non-unit-clauses : 7
% 0.19/0.51 # Current number of unprocessed clauses: 738
% 0.19/0.51 # ...number of literals in the above : 998
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 32
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 41
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 40
% 0.19/0.51 # Non-unit clause-clause subsumptions : 18
% 0.19/0.51 # Unit Clause-clause subsumption calls : 253
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 155
% 0.19/0.51 # BW rewrite match successes : 104
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 10338
% 0.19/0.51 # Search garbage collected termcells : 465
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.022 s
% 0.19/0.51 # System time : 0.001 s
% 0.19/0.51 # Total time : 0.023 s
% 0.19/0.51 # Maximum resident set size: 1896 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.023 s
% 0.19/0.51 # System time : 0.004 s
% 0.19/0.51 # Total time : 0.027 s
% 0.19/0.51 # Maximum resident set size: 1796 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------