TSTP Solution File: NUM841+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : NUM841+1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n027.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 : Mon Jun 24 12:49:41 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 37 ( 22 unt; 0 def)
% Number of atoms : 59 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 20 ~; 19 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(214, 352, 0)',conjecture,
greater(vplus(vd344,vd347),vplus(vd345,vd348)),
file('/export/starexec/sandbox/tmp/tmp.jmpBynSp2s/E---3.1_19186.p','holds(214, 352, 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X47,X48] : vplus(X48,X47) = vplus(X47,X48),
file('/export/starexec/sandbox/tmp/tmp.jmpBynSp2s/E---3.1_19186.p','ass(cond(61, 0), 0)') ).
fof('ass(cond(goal(130), 0), 2)',axiom,
! [X30,X31] :
( ~ greater(X30,X31)
| ~ less(X30,X31) ),
file('/export/starexec/sandbox/tmp/tmp.jmpBynSp2s/E---3.1_19186.p','ass(cond(goal(130), 0), 2)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X30,X31] :
( X30 = X31
| greater(X30,X31)
| less(X30,X31) ),
file('/export/starexec/sandbox/tmp/tmp.jmpBynSp2s/E---3.1_19186.p','ass(cond(goal(130), 0), 0)') ).
fof('holds(212, 350, 0)',axiom,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
file('/export/starexec/sandbox/tmp/tmp.jmpBynSp2s/E---3.1_19186.p','holds(212, 350, 0)') ).
fof('ass(cond(168, 0), 0)',axiom,
! [X15,X16,X17] :
( ( less(X16,X17)
& less(X15,X16) )
=> less(X15,X17) ),
file('/export/starexec/sandbox/tmp/tmp.jmpBynSp2s/E---3.1_19186.p','ass(cond(168, 0), 0)') ).
fof('ass(cond(140, 0), 0)',axiom,
! [X28,X29] :
( greater(X28,X29)
=> less(X29,X28) ),
file('/export/starexec/sandbox/tmp/tmp.jmpBynSp2s/E---3.1_19186.p','ass(cond(140, 0), 0)') ).
fof('holds(213, 351, 1)',axiom,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
file('/export/starexec/sandbox/tmp/tmp.jmpBynSp2s/E---3.1_19186.p','holds(213, 351, 1)') ).
fof('holds(213, 351, 0)',axiom,
vplus(vd345,vd347) = vplus(vd347,vd345),
file('/export/starexec/sandbox/tmp/tmp.jmpBynSp2s/E---3.1_19186.p','holds(213, 351, 0)') ).
fof('holds(213, 351, 2)',axiom,
vplus(vd348,vd345) = vplus(vd345,vd348),
file('/export/starexec/sandbox/tmp/tmp.jmpBynSp2s/E---3.1_19186.p','holds(213, 351, 2)') ).
fof(c_0_10,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(214, 352, 0)'])]) ).
fof(c_0_11,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X144,X145] : vplus(X145,X144) = vplus(X144,X145),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_13,plain,
! [X30,X31] :
( ~ greater(X30,X31)
| ~ less(X30,X31) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 2)']) ).
cnf(c_0_14,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X105,X106] :
( X105 = X106
| greater(X105,X106)
| less(X105,X106) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_17,plain,
! [X109,X110] :
( ~ greater(X109,X110)
| ~ less(X109,X110) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).
cnf(c_0_18,plain,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
inference(split_conjunct,[status(thm)],['holds(212, 350, 0)']) ).
fof(c_0_19,plain,
! [X90,X91,X92] :
( ~ less(X91,X92)
| ~ less(X90,X91)
| less(X90,X92) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(168, 0), 0)'])])]) ).
cnf(c_0_20,negated_conjecture,
~ greater(vplus(vd347,vd344),vplus(vd345,vd348)),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X103,X104] :
( ~ greater(X103,X104)
| less(X104,X103) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])])]) ).
cnf(c_0_23,plain,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
inference(split_conjunct,[status(thm)],['holds(213, 351, 1)']) ).
cnf(c_0_24,plain,
vplus(vd345,vd347) = vplus(vd347,vd345),
inference(split_conjunct,[status(thm)],['holds(213, 351, 0)']) ).
cnf(c_0_25,plain,
vplus(vd348,vd345) = vplus(vd345,vd348),
inference(split_conjunct,[status(thm)],['holds(213, 351, 2)']) ).
cnf(c_0_26,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
greater(vplus(vd347,vd344),vplus(vd345,vd347)),
inference(rw,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_28,plain,
( less(X3,X2)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( vplus(vd347,vd344) = vplus(vd345,vd348)
| less(vplus(vd347,vd344),vplus(vd345,vd348)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
( less(X2,X1)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
greater(vplus(vd345,vd347),vplus(vd345,vd348)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_32,plain,
~ less(vplus(vd347,vd344),vplus(vd345,vd347)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( vplus(vd347,vd344) = vplus(vd345,vd348)
| less(vplus(vd347,vd344),X1)
| ~ less(vplus(vd345,vd348),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
less(vplus(vd345,vd348),vplus(vd345,vd347)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
vplus(vd347,vd344) = vplus(vd345,vd348),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_36,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_35]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM841+1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.13 % Command : run_E %s %d SAT
% 0.13/0.34 % Computer : n027.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 : Sun Jun 23 03:41:54 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 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.jmpBynSp2s/E---3.1_19186.p
% 0.22/0.53 # Version: 3.2.0
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19269 completed with status 0
% 0.22/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.22/0.53 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.22/0.53 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 19277 completed with status 0
% 0.22/0.53 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.22/0.53 # Preprocessing time : 0.002 s
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 45
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 53
% 0.22/0.53 # Removed in clause preprocessing : 2
% 0.22/0.53 # Initial clauses in saturation : 51
% 0.22/0.53 # Processed clauses : 118
% 0.22/0.53 # ...of these trivial : 6
% 0.22/0.53 # ...subsumed : 28
% 0.22/0.53 # ...remaining for further processing : 84
% 0.22/0.53 # Other redundant clauses eliminated : 39
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 4
% 0.22/0.53 # Backward-rewritten : 12
% 0.22/0.53 # Generated clauses : 450
% 0.22/0.53 # ...of the previous two non-redundant : 349
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 399
% 0.22/0.53 # Factorizations : 2
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 49
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 46
% 0.22/0.53 # ...of those cached : 16
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 62
% 0.22/0.53 # Positive orientable unit clauses : 14
% 0.22/0.53 # Positive unorientable unit clauses: 1
% 0.22/0.53 # Negative unit clauses : 9
% 0.22/0.53 # Non-unit-clauses : 38
% 0.22/0.53 # Current number of unprocessed clauses: 242
% 0.22/0.53 # ...number of literals in the above : 610
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 17
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 111
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 109
% 0.22/0.53 # Non-unit clause-clause subsumptions : 12
% 0.22/0.53 # Unit Clause-clause subsumption calls : 94
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 52
% 0.22/0.53 # BW rewrite match successes : 27
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 5072
% 0.22/0.53 # Search garbage collected termcells : 556
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.016 s
% 0.22/0.53 # System time : 0.002 s
% 0.22/0.53 # Total time : 0.018 s
% 0.22/0.53 # Maximum resident set size: 1868 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.062 s
% 0.22/0.53 # System time : 0.014 s
% 0.22/0.53 # Total time : 0.076 s
% 0.22/0.53 # Maximum resident set size: 1756 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------