TSTP Solution File: NUM840+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM840+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 18:57:43 EDT 2023
% Result : Theorem 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 14 unt; 0 def)
% Number of atoms : 64 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 57 ( 30 ~; 24 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(goal(130), 0), 2)',axiom,
! [X27,X28] :
( ~ greater(X27,X28)
| ~ less(X27,X28) ),
file('/export/starexec/sandbox/tmp/tmp.jUJLhYpk6Y/E---3.1_24438.p','ass(cond(goal(130), 0), 2)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X23,X24] :
( less(X23,X24)
=> greater(X24,X23) ),
file('/export/starexec/sandbox/tmp/tmp.jUJLhYpk6Y/E---3.1_24438.p','ass(cond(147, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X44,X45] : vplus(X45,X44) = vplus(X44,X45),
file('/export/starexec/sandbox/tmp/tmp.jUJLhYpk6Y/E---3.1_24438.p','ass(cond(61, 0), 0)') ).
fof('holds(antec(conjunct2(conjunct2(204))), 335, 0)',axiom,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox/tmp/tmp.jUJLhYpk6Y/E---3.1_24438.p','holds(antec(conjunct2(conjunct2(204))), 335, 0)') ).
fof('ass(cond(goal(193), 0), 0)',axiom,
! [X1,X2,X3] :
( less(X1,X2)
=> less(vplus(X1,X3),vplus(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.jUJLhYpk6Y/E---3.1_24438.p','ass(cond(goal(193), 0), 0)') ).
fof('ass(cond(140, 0), 0)',axiom,
! [X25,X26] :
( greater(X25,X26)
=> less(X26,X25) ),
file('/export/starexec/sandbox/tmp/tmp.jUJLhYpk6Y/E---3.1_24438.p','ass(cond(140, 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X27,X28] :
( X27 = X28
| greater(X27,X28)
| less(X27,X28) ),
file('/export/starexec/sandbox/tmp/tmp.jUJLhYpk6Y/E---3.1_24438.p','ass(cond(goal(130), 0), 0)') ).
fof('ass(cond(goal(130), 0), 1)',axiom,
! [X27,X28] :
( X27 != X28
| ~ less(X27,X28) ),
file('/export/starexec/sandbox/tmp/tmp.jUJLhYpk6Y/E---3.1_24438.p','ass(cond(goal(130), 0), 1)') ).
fof('holds(conseq(conjunct2(conjunct2(204))), 336, 0)',conjecture,
less(vd328,vd329),
file('/export/starexec/sandbox/tmp/tmp.jUJLhYpk6Y/E---3.1_24438.p','holds(conseq(conjunct2(conjunct2(204))), 336, 0)') ).
fof(c_0_9,plain,
! [X27,X28] :
( ~ greater(X27,X28)
| ~ less(X27,X28) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 2)']) ).
fof(c_0_10,plain,
! [X97,X98] :
( ~ greater(X97,X98)
| ~ less(X97,X98) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X89,X90] :
( ~ less(X89,X90)
| greater(X90,X89) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])]) ).
fof(c_0_12,plain,
! [X132,X133] : vplus(X133,X132) = vplus(X132,X133),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_0_13,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( greater(X2,X1)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(split_conjunct,[status(thm)],['holds(antec(conjunct2(conjunct2(204))), 335, 0)']) ).
cnf(c_0_16,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X61,X62,X63] :
( ~ less(X61,X62)
| less(vplus(X61,X63),vplus(X62,X63)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(193), 0), 0)'])]) ).
cnf(c_0_18,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
less(vplus(vd328,vd330),vplus(vd330,vd329)),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( less(vplus(X1,X3),vplus(X2,X3))
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X91,X92] :
( ~ greater(X91,X92)
| less(X92,X91) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])]) ).
fof(c_0_22,plain,
! [X93,X94] :
( X93 = X94
| greater(X93,X94)
| less(X93,X94) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_23,plain,
! [X27,X28] :
( X27 != X28
| ~ less(X27,X28) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 1)']) ).
cnf(c_0_24,plain,
~ less(vplus(vd330,vd329),vplus(vd328,vd330)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( less(vplus(X1,X2),vplus(X3,X1))
| ~ less(X2,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_26,plain,
( less(X2,X1)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,negated_conjecture,
~ less(vd328,vd329),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq(conjunct2(conjunct2(204))), 336, 0)'])]) ).
fof(c_0_29,plain,
! [X95,X96] :
( X95 != X96
| ~ less(X95,X96) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
~ less(vd329,vd328),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( X1 = X2
| less(X1,X2)
| less(X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ less(vd328,vd329),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( X1 != X2
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
vd329 = vd328,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_34]),c_0_16]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM840+1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 14:21:09 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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/tmp/tmp.jUJLhYpk6Y/E---3.1_24438.p
% 0.18/0.50 # Version: 3.1pre001
% 0.18/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24516 completed with status 0
% 0.18/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.50 # No SInE strategy applied
% 0.18/0.50 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.18/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.50 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.18/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24523 completed with status 0
% 0.18/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.50 # No SInE strategy applied
% 0.18/0.50 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.18/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.50 # Preprocessing time : 0.001 s
% 0.18/0.50 # Presaturation interreduction done
% 0.18/0.50
% 0.18/0.50 # Proof found!
% 0.18/0.50 # SZS status Theorem
% 0.18/0.50 # SZS output start CNFRefutation
% See solution above
% 0.18/0.50 # Parsed axioms : 39
% 0.18/0.50 # Removed by relevancy pruning/SinE : 0
% 0.18/0.50 # Initial clauses : 47
% 0.18/0.50 # Removed in clause preprocessing : 2
% 0.18/0.50 # Initial clauses in saturation : 45
% 0.18/0.50 # Processed clauses : 628
% 0.18/0.50 # ...of these trivial : 25
% 0.18/0.50 # ...subsumed : 353
% 0.18/0.50 # ...remaining for further processing : 250
% 0.18/0.50 # Other redundant clauses eliminated : 66
% 0.18/0.50 # Clauses deleted for lack of memory : 0
% 0.18/0.50 # Backward-subsumed : 20
% 0.18/0.50 # Backward-rewritten : 26
% 0.18/0.50 # Generated clauses : 2570
% 0.18/0.50 # ...of the previous two non-redundant : 2395
% 0.18/0.50 # ...aggressively subsumed : 0
% 0.18/0.50 # Contextual simplify-reflections : 2
% 0.18/0.50 # Paramodulations : 2498
% 0.18/0.50 # Factorizations : 2
% 0.18/0.50 # NegExts : 0
% 0.18/0.50 # Equation resolutions : 70
% 0.18/0.50 # Total rewrite steps : 456
% 0.18/0.50 # Propositional unsat checks : 0
% 0.18/0.50 # Propositional check models : 0
% 0.18/0.50 # Propositional check unsatisfiable : 0
% 0.18/0.50 # Propositional clauses : 0
% 0.18/0.50 # Propositional clauses after purity: 0
% 0.18/0.50 # Propositional unsat core size : 0
% 0.18/0.50 # Propositional preprocessing time : 0.000
% 0.18/0.50 # Propositional encoding time : 0.000
% 0.18/0.50 # Propositional solver time : 0.000
% 0.18/0.50 # Success case prop preproc time : 0.000
% 0.18/0.50 # Success case prop encoding time : 0.000
% 0.18/0.50 # Success case prop solver time : 0.000
% 0.18/0.50 # Current number of processed clauses : 159
% 0.18/0.50 # Positive orientable unit clauses : 26
% 0.18/0.50 # Positive unorientable unit clauses: 3
% 0.18/0.50 # Negative unit clauses : 32
% 0.18/0.50 # Non-unit-clauses : 98
% 0.18/0.50 # Current number of unprocessed clauses: 1830
% 0.18/0.50 # ...number of literals in the above : 4109
% 0.18/0.50 # Current number of archived formulas : 0
% 0.18/0.50 # Current number of archived clauses : 83
% 0.18/0.50 # Clause-clause subsumption calls (NU) : 2337
% 0.18/0.50 # Rec. Clause-clause subsumption calls : 2012
% 0.18/0.50 # Non-unit clause-clause subsumptions : 170
% 0.18/0.50 # Unit Clause-clause subsumption calls : 307
% 0.18/0.50 # Rewrite failures with RHS unbound : 0
% 0.18/0.50 # BW rewrite match attempts : 77
% 0.18/0.50 # BW rewrite match successes : 64
% 0.18/0.50 # Condensation attempts : 0
% 0.18/0.50 # Condensation successes : 0
% 0.18/0.50 # Termbank termtop insertions : 20724
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.024 s
% 0.18/0.50 # System time : 0.006 s
% 0.18/0.50 # Total time : 0.030 s
% 0.18/0.50 # Maximum resident set size: 1912 pages
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.131 s
% 0.18/0.50 # System time : 0.012 s
% 0.18/0.50 # Total time : 0.143 s
% 0.18/0.50 # Maximum resident set size: 1748 pages
% 0.18/0.50 % E---3.1 exiting
% 0.18/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------