TSTP Solution File: SWV132+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV132+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:19 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 129 ( 0 equ)
% Maximal formula atoms : 38 ( 10 avg)
% Number of connectives : 165 ( 48 ~; 28 |; 49 &)
% ( 1 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_array_0002,conjecture,
( ( ~ leq(tptp_float_0_001,pv1341)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_best7,n3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gauss_array_0002) ).
fof(c_0_1,plain,
( epred1_0
<=> ( ~ leq(tptp_float_0_001,pv1341)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred1_0
=> ( ~ leq(tptp_float_0_001,pv1341)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( epred1_0
=> leq(s_best7,n3) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[gauss_array_0002]),c_0_1]) ).
fof(c_0_4,plain,
( ( ~ leq(tptp_float_0_001,pv1341)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_worst7)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_sworst7,n3)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])]) ).
fof(c_0_5,negated_conjecture,
( epred1_0
& ~ leq(s_best7,n3) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( ~ epred1_0
| ~ leq(tptp_float_0_001,pv1341) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
~ leq(tptp_float_0_001,pv1341),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,negated_conjecture,
~ leq(s_best7,n3),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]),c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV132+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/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 : Thu Jun 16 05:26:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.018 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 12
% 0.24/1.42 # Proof object clause steps : 6
% 0.24/1.42 # Proof object formula steps : 6
% 0.24/1.42 # Proof object conjectures : 5
% 0.24/1.42 # Proof object clause conjectures : 2
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 4
% 0.24/1.42 # Proof object initial formulas used : 1
% 0.24/1.42 # Proof object generating inferences : 0
% 0.24/1.42 # Proof object simplifying inferences : 6
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 85
% 0.24/1.42 # Removed by relevancy pruning/SinE : 29
% 0.24/1.42 # Initial clauses : 72
% 0.24/1.42 # Removed in clause preprocessing : 1
% 0.24/1.42 # Initial clauses in saturation : 71
% 0.24/1.42 # Processed clauses : 7
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 0
% 0.24/1.42 # ...remaining for further processing : 6
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 0
% 0.24/1.42 # ...of the previous two non-trivial : 0
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 0
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 6
% 0.24/1.42 # Positive orientable unit clauses : 3
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 3
% 0.24/1.42 # Non-unit-clauses : 0
% 0.24/1.42 # Current number of unprocessed clauses: 64
% 0.24/1.42 # ...number of literals in the above : 128
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 1
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.42 # Non-unit clause-clause subsumptions : 0
% 0.24/1.42 # Unit Clause-clause subsumption calls : 1
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 3657
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.013 s
% 0.24/1.42 # System time : 0.005 s
% 0.24/1.42 # Total time : 0.018 s
% 0.24/1.42 # Maximum resident set size: 2920 pages
%------------------------------------------------------------------------------