TSTP Solution File: SWV064+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV064+1 : TPTP v8.1.0. Bugfixed v3.3.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 : Wed Jul 20 18:15:03 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 10 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 64 ( 19 ~; 15 |; 28 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 3 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_array_0005,conjecture,
( ( leq(n0,pv10)
& leq(n0,pv53)
& leq(n0,pv54)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& leq(pv54,minus(n5,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,pv53)
& leq(n0,pv54)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& leq(pv54,minus(n5,n1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cl5_nebula_array_0005) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(c_0_2,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(n0,pv53)
& leq(n0,pv54)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& leq(pv54,minus(n5,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,pv53)
& leq(n0,pv54)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& leq(pv54,minus(n5,n1)) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_array_0005]) ).
fof(c_0_3,negated_conjecture,
( leq(n0,pv10)
& leq(n0,pv53)
& leq(n0,pv54)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& leq(pv54,minus(n5,n1))
& ( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,pv53)
| ~ leq(n0,pv54)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv54,minus(n5,n1)) ) ),
inference(fof_nnf,[status(thm)],[c_0_2]) ).
fof(c_0_4,plain,
! [X2] : leq(X2,X2),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
cnf(c_0_5,negated_conjecture,
( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54)
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
leq(n0,pv10),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
leq(n0,pv53),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv54,minus(n5,n1))
| ~ leq(n0,pv54) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8])]) ).
cnf(c_0_10,negated_conjecture,
leq(n0,pv54),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
leq(pv53,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
leq(pv54,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV064+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 21:34:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.018 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 15
% 0.23/1.41 # Proof object clause steps : 10
% 0.23/1.41 # Proof object formula steps : 5
% 0.23/1.41 # Proof object conjectures : 12
% 0.23/1.41 # Proof object clause conjectures : 9
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 8
% 0.23/1.41 # Proof object initial formulas used : 2
% 0.23/1.41 # Proof object generating inferences : 0
% 0.23/1.41 # Proof object simplifying inferences : 10
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 92
% 0.23/1.41 # Removed by relevancy pruning/SinE : 24
% 0.23/1.41 # Initial clauses : 77
% 0.23/1.41 # Removed in clause preprocessing : 2
% 0.23/1.41 # Initial clauses in saturation : 75
% 0.23/1.41 # Processed clauses : 76
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 75
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 2
% 0.23/1.41 # Generated clauses : 230
% 0.23/1.41 # ...of the previous two non-trivial : 206
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 228
% 0.23/1.41 # Factorizations : 2
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 73
% 0.23/1.41 # Positive orientable unit clauses : 48
% 0.23/1.41 # Positive unorientable unit clauses: 4
% 0.23/1.41 # Negative unit clauses : 1
% 0.23/1.41 # Non-unit-clauses : 20
% 0.23/1.41 # Current number of unprocessed clauses: 201
% 0.23/1.41 # ...number of literals in the above : 333
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 4
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 30
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 3
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 10
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 10
% 0.23/1.41 # BW rewrite match successes : 10
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 5799
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.019 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.023 s
% 0.23/1.41 # Maximum resident set size: 3188 pages
%------------------------------------------------------------------------------