TSTP Solution File: SWV142+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV142+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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:21 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 149 ( 6 equ)
% Maximal formula atoms : 40 ( 6 avg)
% Number of connectives : 174 ( 48 ~; 32 |; 53 &)
% ( 1 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_array_0012,conjecture,
( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ 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_0012) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).
fof(succ_plus_1_r,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_1) ).
fof(c_0_4,plain,
( epred1_0
<=> ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ 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_5,plain,
( epred1_0
=> ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ 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_4]) ).
fof(c_0_6,negated_conjecture,
~ ( epred1_0
=> leq(s_best7,n3) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[gauss_array_0012]),c_0_4]) ).
fof(c_0_7,plain,
( ( leq(tptp_float_0_001,pv1341)
| ~ epred1_0 )
& ( leq(n1,loopcounter)
| ~ 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_5])])]) ).
fof(c_0_8,negated_conjecture,
( epred1_0
& ~ leq(s_best7,n3) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ~ leq(succ(X3),X4)
| gt(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])]) ).
fof(c_0_10,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
cnf(c_0_11,plain,
( leq(s_best7,n3)
| ~ epred1_0
| ~ gt(loopcounter,n0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ leq(s_best7,n3),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( gt(X1,X2)
| ~ leq(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_17,plain,
( leq(n1,loopcounter)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
~ gt(loopcounter,n0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),c_0_13]) ).
cnf(c_0_19,plain,
( gt(X1,X2)
| ~ leq(plus(X2,n1),X1) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
plus(n0,n1) = n1,
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_21,plain,
leq(n1,loopcounter),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_12])]) ).
cnf(c_0_22,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV142+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 14:22:24 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.018 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 23
% 0.26/1.44 # Proof object clause steps : 12
% 0.26/1.44 # Proof object formula steps : 11
% 0.26/1.44 # Proof object conjectures : 5
% 0.26/1.44 # Proof object clause conjectures : 2
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 7
% 0.26/1.44 # Proof object initial formulas used : 4
% 0.26/1.44 # Proof object generating inferences : 1
% 0.26/1.44 # Proof object simplifying inferences : 10
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 85
% 0.26/1.44 # Removed by relevancy pruning/SinE : 29
% 0.26/1.44 # Initial clauses : 73
% 0.26/1.44 # Removed in clause preprocessing : 1
% 0.26/1.44 # Initial clauses in saturation : 72
% 0.26/1.44 # Processed clauses : 62
% 0.26/1.44 # ...of these trivial : 6
% 0.26/1.44 # ...subsumed : 5
% 0.26/1.44 # ...remaining for further processing : 51
% 0.26/1.44 # Other redundant clauses eliminated : 0
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 0
% 0.26/1.44 # Backward-rewritten : 1
% 0.26/1.44 # Generated clauses : 92
% 0.26/1.44 # ...of the previous two non-trivial : 73
% 0.26/1.44 # Contextual simplify-reflections : 0
% 0.26/1.44 # Paramodulations : 90
% 0.26/1.44 # Factorizations : 2
% 0.26/1.44 # Equation resolutions : 0
% 0.26/1.44 # Current number of processed clauses : 50
% 0.26/1.44 # Positive orientable unit clauses : 34
% 0.26/1.44 # Positive unorientable unit clauses: 2
% 0.26/1.44 # Negative unit clauses : 3
% 0.26/1.44 # Non-unit-clauses : 11
% 0.26/1.44 # Current number of unprocessed clauses: 81
% 0.26/1.44 # ...number of literals in the above : 146
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 2
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 2
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 0
% 0.26/1.44 # Non-unit clause-clause subsumptions : 0
% 0.26/1.44 # Unit Clause-clause subsumption calls : 1
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 8
% 0.26/1.44 # BW rewrite match successes : 5
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 4562
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.018 s
% 0.26/1.44 # System time : 0.003 s
% 0.26/1.44 # Total time : 0.021 s
% 0.26/1.44 # Maximum resident set size: 3188 pages
%------------------------------------------------------------------------------