TSTP Solution File: NUM852+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM852+2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:42 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 15 unt; 0 def)
% Number of atoms : 35 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 11 ~; 8 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 3 sgn; 21 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X24,X25] :
( greater(X25,X24)
<=> ? [X26] : X25 = vplus(X24,X26) ),
file('/export/starexec/sandbox/tmp/tmp.lAxKgrgl0E/E---3.1_19068.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('ass(cond(281, 0), 0)',axiom,
! [X8,X9,X10] : vmul(X8,vplus(X9,X10)) = vplus(vmul(X8,X9),vmul(X8,X10)),
file('/export/starexec/sandbox/tmp/tmp.lAxKgrgl0E/E---3.1_19068.p','ass(cond(281, 0), 0)') ).
fof('ass(cond(302, 0), 2)',axiom,
! [X3,X4] :
( greater(X3,X4)
=> vmul(X3,vd469) = vmul(vplus(X4,vskolem9(X3,X4)),vd469) ),
file('/export/starexec/sandbox/tmp/tmp.lAxKgrgl0E/E---3.1_19068.p','ass(cond(302, 0), 2)') ).
fof('ass(cond(270, 0), 0)',axiom,
! [X11,X12] : vmul(X11,X12) = vmul(X12,X11),
file('/export/starexec/sandbox/tmp/tmp.lAxKgrgl0E/E---3.1_19068.p','ass(cond(270, 0), 0)') ).
fof('holds(conseq_conjunct1(conseq_conjunct2(conseq(304))), 484, 0)',conjecture,
greater(vmul(vd481,vd469),vmul(vd480,vd469)),
file('/export/starexec/sandbox/tmp/tmp.lAxKgrgl0E/E---3.1_19068.p','holds(conseq_conjunct1(conseq_conjunct2(conseq(304))), 484, 0)') ).
fof('holds(conseq_conjunct1(conseq(304)), 483, 0)',axiom,
greater(vd481,vd480),
file('/export/starexec/sandbox/tmp/tmp.lAxKgrgl0E/E---3.1_19068.p','holds(conseq_conjunct1(conseq(304)), 483, 0)') ).
fof(c_0_6,plain,
! [X29,X30,X32,X33,X34] :
( ( ~ greater(X30,X29)
| X30 = vplus(X29,esk1_2(X29,X30)) )
& ( X33 != vplus(X32,X34)
| greater(X33,X32) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])]) ).
cnf(c_0_7,plain,
( greater(X1,X2)
| X1 != vplus(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X38,X39,X40] : vmul(X38,vplus(X39,X40)) = vplus(vmul(X38,X39),vmul(X38,X40)),
inference(variable_rename,[status(thm)],['ass(cond(281, 0), 0)']) ).
fof(c_0_9,plain,
! [X49,X50] :
( ~ greater(X49,X50)
| vmul(X49,vd469) = vmul(vplus(X50,vskolem9(X49,X50)),vd469) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(302, 0), 2)'])]) ).
fof(c_0_10,plain,
! [X41,X42] : vmul(X41,X42) = vmul(X42,X41),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
cnf(c_0_11,plain,
greater(vplus(X1,X2),X1),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
vmul(X1,vplus(X2,X3)) = vplus(vmul(X1,X2),vmul(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( vmul(X1,vd469) = vmul(vplus(X2,vskolem9(X1,X2)),vd469)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq_conjunct1(conseq_conjunct2(conseq(304))), 484, 0)'])]) ).
cnf(c_0_16,plain,
greater(vmul(X1,vplus(X2,X3)),vmul(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( vmul(vd469,vplus(X1,vskolem9(X2,X1))) = vmul(X2,vd469)
| ~ greater(X2,X1) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( greater(vmul(X1,vd469),vmul(vd469,X2))
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
~ greater(vmul(vd469,vd481),vmul(vd469,vd480)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_14]),c_0_14]) ).
cnf(c_0_21,plain,
( greater(vmul(vd469,X1),vmul(vd469,X2))
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_22,plain,
greater(vd481,vd480),
inference(split_conjunct,[status(thm)],['holds(conseq_conjunct1(conseq(304)), 483, 0)']) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : NUM852+2 : TPTP v8.1.2. Released v4.1.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n016.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 14:14:51 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.lAxKgrgl0E/E---3.1_19068.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_1 with pid 19148 completed with status 0
% 0.15/0.42 # Result found by new_bool_1
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGHSS-FFSF22-MFFFFFNN
% 0.15/0.42 # partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.15/0.42 # SAT001_MinMin_p005000_rr_RG with pid 19154 completed with status 0
% 0.15/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGHSS-FFSF22-MFFFFFNN
% 0.15/0.42 # partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 20
% 0.15/0.42 # Removed by relevancy pruning/SinE : 1
% 0.15/0.42 # Initial clauses : 21
% 0.15/0.42 # Removed in clause preprocessing : 1
% 0.15/0.42 # Initial clauses in saturation : 20
% 0.15/0.42 # Processed clauses : 124
% 0.15/0.42 # ...of these trivial : 2
% 0.15/0.42 # ...subsumed : 58
% 0.15/0.42 # ...remaining for further processing : 64
% 0.15/0.42 # Other redundant clauses eliminated : 4
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 1
% 0.15/0.42 # Generated clauses : 354
% 0.15/0.42 # ...of the previous two non-redundant : 318
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 348
% 0.15/0.42 # Factorizations : 2
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 4
% 0.15/0.42 # Total rewrite steps : 90
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 40
% 0.15/0.42 # Positive orientable unit clauses : 7
% 0.15/0.42 # Positive unorientable unit clauses: 3
% 0.15/0.42 # Negative unit clauses : 9
% 0.15/0.42 # Non-unit-clauses : 21
% 0.15/0.42 # Current number of unprocessed clauses: 224
% 0.15/0.42 # ...number of literals in the above : 375
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 20
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 146
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 146
% 0.15/0.42 # Non-unit clause-clause subsumptions : 38
% 0.15/0.42 # Unit Clause-clause subsumption calls : 16
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 14
% 0.15/0.42 # BW rewrite match successes : 14
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 3887
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.005 s
% 0.15/0.42 # System time : 0.004 s
% 0.15/0.42 # Total time : 0.009 s
% 0.15/0.42 # Maximum resident set size: 1728 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.005 s
% 0.15/0.42 # System time : 0.006 s
% 0.15/0.42 # Total time : 0.012 s
% 0.15/0.42 # Maximum resident set size: 1716 pages
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------