TSTP Solution File: NUM843+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM843+2 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:30 EDT 2024
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 52 ( 11 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 46 ( 19 ~; 20 |; 4 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conjunct2(243), 393, 0)',axiom,
~ leq(vd390,vd391),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct2(243), 393, 0)') ).
fof('def(cond(conseq(axiom(3)), 17), 1)',axiom,
! [X37,X38] :
( leq(X38,X37)
<=> ( less(X38,X37)
| X38 = X37 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 17), 1)') ).
fof('holds(244, 394, 0)',conjecture,
greater(vd390,vd391),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(244, 394, 0)') ).
fof('ass(cond(158, 0), 0)',axiom,
! [X35,X36] :
( geq(X35,X36)
=> leq(X36,X35) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(158, 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X45,X46] :
( X45 = X46
| greater(X45,X46)
| less(X45,X46) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
! [X39,X40] :
( geq(X40,X39)
<=> ( greater(X40,X39)
| X40 = X39 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 16), 1)') ).
fof(c_0_6,plain,
~ leq(vd390,vd391),
inference(fof_simplification,[status(thm)],['holds(conjunct2(243), 393, 0)']) ).
fof(c_0_7,plain,
~ leq(vd390,vd391),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X127,X128] :
( ( ~ leq(X128,X127)
| less(X128,X127)
| X128 = X127 )
& ( ~ less(X128,X127)
| leq(X128,X127) )
& ( X128 != X127
| leq(X128,X127) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 17), 1)'])])])]) ).
fof(c_0_9,negated_conjecture,
~ greater(vd390,vd391),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(244, 394, 0)'])]) ).
fof(c_0_10,plain,
! [X125,X126] :
( ~ geq(X125,X126)
| leq(X126,X125) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(158, 0), 0)'])])]) ).
cnf(c_0_11,plain,
~ leq(vd390,vd391),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X135,X136] :
( X135 = X136
| greater(X135,X136)
| less(X135,X136) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_14,negated_conjecture,
~ greater(vd390,vd391),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X129,X130] :
( ( ~ geq(X130,X129)
| greater(X130,X129)
| X130 = X129 )
& ( ~ greater(X130,X129)
| geq(X130,X129) )
& ( X130 != X129
| geq(X130,X129) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)'])])])]) ).
cnf(c_0_16,plain,
( leq(X2,X1)
| ~ geq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
~ less(vd390,vd391),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
~ greater(vd390,vd391),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( geq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
~ geq(vd391,vd390),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_22,plain,
vd391 = vd390,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
geq(X1,X1),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM843+2 : TPTP v8.2.0. Released v4.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 06:34:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.52 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.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15080 completed with status 0
% 0.21/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.54 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15088 completed with status 0
% 0.21/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.54 # Preprocessing time : 0.002 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 46
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 55
% 0.21/0.54 # Removed in clause preprocessing : 2
% 0.21/0.54 # Initial clauses in saturation : 53
% 0.21/0.54 # Processed clauses : 101
% 0.21/0.54 # ...of these trivial : 2
% 0.21/0.54 # ...subsumed : 6
% 0.21/0.54 # ...remaining for further processing : 93
% 0.21/0.54 # Other redundant clauses eliminated : 9
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 3
% 0.21/0.54 # Backward-rewritten : 8
% 0.21/0.54 # Generated clauses : 79
% 0.21/0.54 # ...of the previous two non-redundant : 68
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 68
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 11
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 23
% 0.21/0.54 # ...of those cached : 7
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 30
% 0.21/0.54 # Positive orientable unit clauses : 10
% 0.21/0.54 # Positive unorientable unit clauses: 1
% 0.21/0.54 # Negative unit clauses : 5
% 0.21/0.54 # Non-unit-clauses : 14
% 0.21/0.54 # Current number of unprocessed clauses: 61
% 0.21/0.54 # ...number of literals in the above : 110
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 55
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 53
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 53
% 0.21/0.54 # Non-unit clause-clause subsumptions : 2
% 0.21/0.54 # Unit Clause-clause subsumption calls : 19
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 36
% 0.21/0.54 # BW rewrite match successes : 28
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 3637
% 0.21/0.54 # Search garbage collected termcells : 658
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.010 s
% 0.21/0.54 # System time : 0.003 s
% 0.21/0.54 # Total time : 0.014 s
% 0.21/0.54 # Maximum resident set size: 1916 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.037 s
% 0.21/0.54 # System time : 0.007 s
% 0.21/0.54 # Total time : 0.044 s
% 0.21/0.54 # Maximum resident set size: 1780 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------