TSTP Solution File: NUM843+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM843+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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 : 600s
% DateTime : Mon Jul 18 09:37:04 EDT 2022
% Result : Theorem 0.21s 1.39s
% 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 : 9 ( 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 : 29 ( 4 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conjunct2(243), 393, 0)',axiom,
~ leq(vd390,vd391),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','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/solver/bin/../tmp/theBenchmark.p.mepo_128.in','def(cond(conseq(axiom(3)), 17), 1)') ).
fof('holds(244, 394, 0)',conjecture,
greater(vd390,vd391),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(244, 394, 0)') ).
fof('ass(cond(158, 0), 0)',axiom,
! [X35,X36] :
( geq(X35,X36)
=> leq(X36,X35) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','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/solver/bin/../tmp/theBenchmark.p.mepo_128.in','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/solver/bin/../tmp/theBenchmark.p.mepo_128.in','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,
! [X39,X40,X39,X40] :
( ( ~ leq(X40,X39)
| less(X40,X39)
| X40 = X39 )
& ( ~ less(X40,X39)
| leq(X40,X39) )
& ( X40 != X39
| leq(X40,X39) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 17), 1)'])])])])]) ).
fof(c_0_8,negated_conjecture,
~ greater(vd390,vd391),
inference(assume_negation,[status(cth)],['holds(244, 394, 0)']) ).
fof(c_0_9,plain,
! [X37,X38] :
( ~ geq(X37,X38)
| leq(X38,X37) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(158, 0), 0)'])]) ).
cnf(c_0_10,plain,
~ leq(vd390,vd391),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X47,X48] :
( X47 = X48
| greater(X47,X48)
| less(X47,X48) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_13,negated_conjecture,
~ greater(vd390,vd391),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( leq(X1,X2)
| ~ geq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
~ less(vd390,vd391),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( less(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ greater(vd390,vd391),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X41,X42,X41,X42] :
( ( ~ geq(X42,X41)
| greater(X42,X41)
| X42 = X41 )
& ( ~ greater(X42,X41)
| geq(X42,X41) )
& ( X42 != X41
| geq(X42,X41) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)'])])])])]) ).
cnf(c_0_19,plain,
~ geq(vd391,vd390),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_20,plain,
vd391 = vd390,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,plain,
( geq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
~ geq(vd390,vd390),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
geq(X1,X1),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM843+2 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.32 % Computer : n020.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Thu Jul 7 07:40:44 EDT 2022
% 0.13/0.32 % CPUTime :
% 0.21/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.39 # Preprocessing time : 0.010 s
% 0.21/1.39
% 0.21/1.39 # Proof found!
% 0.21/1.39 # SZS status Theorem
% 0.21/1.39 # SZS output start CNFRefutation
% See solution above
% 0.21/1.39 # Proof object total steps : 25
% 0.21/1.39 # Proof object clause steps : 12
% 0.21/1.39 # Proof object formula steps : 13
% 0.21/1.39 # Proof object conjectures : 4
% 0.21/1.39 # Proof object clause conjectures : 1
% 0.21/1.39 # Proof object formula conjectures : 3
% 0.21/1.39 # Proof object initial clauses used : 6
% 0.21/1.39 # Proof object initial formulas used : 6
% 0.21/1.39 # Proof object generating inferences : 3
% 0.21/1.39 # Proof object simplifying inferences : 5
% 0.21/1.39 # Training examples: 0 positive, 0 negative
% 0.21/1.39 # Parsed axioms : 46
% 0.21/1.39 # Removed by relevancy pruning/SinE : 1
% 0.21/1.39 # Initial clauses : 54
% 0.21/1.39 # Removed in clause preprocessing : 2
% 0.21/1.39 # Initial clauses in saturation : 52
% 0.21/1.39 # Processed clauses : 62
% 0.21/1.39 # ...of these trivial : 2
% 0.21/1.39 # ...subsumed : 1
% 0.21/1.39 # ...remaining for further processing : 59
% 0.21/1.39 # Other redundant clauses eliminated : 15
% 0.21/1.39 # Clauses deleted for lack of memory : 0
% 0.21/1.39 # Backward-subsumed : 2
% 0.21/1.39 # Backward-rewritten : 7
% 0.21/1.39 # Generated clauses : 240
% 0.21/1.39 # ...of the previous two non-trivial : 214
% 0.21/1.39 # Contextual simplify-reflections : 0
% 0.21/1.39 # Paramodulations : 219
% 0.21/1.39 # Factorizations : 0
% 0.21/1.39 # Equation resolutions : 21
% 0.21/1.39 # Current number of processed clauses : 44
% 0.21/1.39 # Positive orientable unit clauses : 7
% 0.21/1.39 # Positive unorientable unit clauses: 1
% 0.21/1.39 # Negative unit clauses : 4
% 0.21/1.39 # Non-unit-clauses : 32
% 0.21/1.39 # Current number of unprocessed clauses: 183
% 0.21/1.39 # ...number of literals in the above : 457
% 0.21/1.39 # Current number of archived formulas : 0
% 0.21/1.39 # Current number of archived clauses : 10
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 55
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 51
% 0.21/1.39 # Non-unit clause-clause subsumptions : 2
% 0.21/1.39 # Unit Clause-clause subsumption calls : 47
% 0.21/1.39 # Rewrite failures with RHS unbound : 0
% 0.21/1.39 # BW rewrite match attempts : 26
% 0.21/1.39 # BW rewrite match successes : 15
% 0.21/1.39 # Condensation attempts : 0
% 0.21/1.39 # Condensation successes : 0
% 0.21/1.39 # Termbank termtop insertions : 4246
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.011 s
% 0.21/1.39 # System time : 0.001 s
% 0.21/1.39 # Total time : 0.012 s
% 0.21/1.39 # Maximum resident set size: 3124 pages
%------------------------------------------------------------------------------