TSTP Solution File: SWV175+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV175+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n019.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 Apr 30 20:46:10 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 10 unt; 0 def)
% Number of atoms : 131 ( 23 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 139 ( 36 ~; 35 |; 42 &)
% ( 4 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-3 aty)
% Number of variables : 23 ( 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( leq(n0,pv28)
& leq(n0,pv30)
& leq(pv28,n4)
& leq(pv30,n135299)
& ! [A] :
( ( leq(n0,A)
& leq(A,n135299) )
=> ! [B] :
( ( leq(n0,B)
& leq(B,n4) )
=> a_select3(q_init,A,B) = init ) )
& ! [C] :
( ( leq(n0,C)
& leq(C,pred(pv28)) )
=> a_select2(rho_init,C) = init )
& ! [D] :
( ( leq(n0,D)
& leq(D,n4) )
=> a_select3(center_init,D,n0) = init )
& ( gt(loopcounter,n1)
=> ! [E] :
( ( leq(n0,E)
& leq(E,n4) )
=> a_select2(muold_init,E) = init ) )
& ( gt(loopcounter,n1)
=> ! [F] :
( ( leq(n0,F)
& leq(F,n4) )
=> a_select2(rhoold_init,F) = init ) )
& ( gt(loopcounter,n1)
=> ! [G] :
( ( leq(n0,G)
& leq(G,n4) )
=> a_select2(sigmaold_init,G) = init ) ) )
=> a_select3(q_init,pv30,pv28) = init ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv28)
& leq(n0,pv30)
& leq(pv28,n4)
& leq(pv30,n135299)
& ! [A] :
( ( leq(n0,A)
& leq(A,n135299) )
=> ! [B] :
( ( leq(n0,B)
& leq(B,n4) )
=> a_select3(q_init,A,B) = init ) )
& ! [C] :
( ( leq(n0,C)
& leq(C,pred(pv28)) )
=> a_select2(rho_init,C) = init )
& ! [D] :
( ( leq(n0,D)
& leq(D,n4) )
=> a_select3(center_init,D,n0) = init )
& ( gt(loopcounter,n1)
=> ! [E] :
( ( leq(n0,E)
& leq(E,n4) )
=> a_select2(muold_init,E) = init ) )
& ( gt(loopcounter,n1)
=> ! [F] :
( ( leq(n0,F)
& leq(F,n4) )
=> a_select2(rhoold_init,F) = init ) )
& ( gt(loopcounter,n1)
=> ! [G] :
( ( leq(n0,G)
& leq(G,n4) )
=> a_select2(sigmaold_init,G) = init ) ) )
=> a_select3(q_init,pv30,pv28) = init ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f251,plain,
( leq(n0,pv28)
& leq(n0,pv30)
& leq(pv28,n4)
& leq(pv30,n135299)
& ! [A] :
( ~ leq(n0,A)
| ~ leq(A,n135299)
| ! [B] :
( ~ leq(n0,B)
| ~ leq(B,n4)
| a_select3(q_init,A,B) = init ) )
& ! [C] :
( ~ leq(n0,C)
| ~ leq(C,pred(pv28))
| a_select2(rho_init,C) = init )
& ! [D] :
( ~ leq(n0,D)
| ~ leq(D,n4)
| a_select3(center_init,D,n0) = init )
& ( ~ gt(loopcounter,n1)
| ! [E] :
( ~ leq(n0,E)
| ~ leq(E,n4)
| a_select2(muold_init,E) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [F] :
( ~ leq(n0,F)
| ~ leq(F,n4)
| a_select2(rhoold_init,F) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [G] :
( ~ leq(n0,G)
| ~ leq(G,n4)
| a_select2(sigmaold_init,G) = init ) )
& a_select3(q_init,pv30,pv28) != init ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f252,plain,
leq(n0,pv28),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f253,plain,
leq(n0,pv30),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f254,plain,
leq(pv28,n4),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f255,plain,
leq(pv30,n135299),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f256,plain,
! [X0,X1] :
( ~ leq(n0,X0)
| ~ leq(X0,n135299)
| ~ leq(n0,X1)
| ~ leq(X1,n4)
| a_select3(q_init,X0,X1) = init ),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f262,plain,
a_select3(q_init,pv30,pv28) != init,
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f352,plain,
( spl0_4
<=> leq(n0,pv30) ),
introduced(split_symbol_definition) ).
fof(f354,plain,
( ~ leq(n0,pv30)
| spl0_4 ),
inference(component_clause,[status(thm)],[f352]) ).
fof(f355,plain,
( spl0_5
<=> leq(pv30,n135299) ),
introduced(split_symbol_definition) ).
fof(f357,plain,
( ~ leq(pv30,n135299)
| spl0_5 ),
inference(component_clause,[status(thm)],[f355]) ).
fof(f358,plain,
( spl0_6
<=> leq(n0,pv28) ),
introduced(split_symbol_definition) ).
fof(f360,plain,
( ~ leq(n0,pv28)
| spl0_6 ),
inference(component_clause,[status(thm)],[f358]) ).
fof(f361,plain,
( spl0_7
<=> leq(pv28,n4) ),
introduced(split_symbol_definition) ).
fof(f363,plain,
( ~ leq(pv28,n4)
| spl0_7 ),
inference(component_clause,[status(thm)],[f361]) ).
fof(f364,plain,
( ~ leq(n0,pv30)
| ~ leq(pv30,n135299)
| ~ leq(n0,pv28)
| ~ leq(pv28,n4) ),
inference(resolution,[status(thm)],[f256,f262]) ).
fof(f365,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f364,f352,f355,f358,f361]) ).
fof(f366,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f363,f254]) ).
fof(f367,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f366]) ).
fof(f368,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f360,f252]) ).
fof(f369,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f368]) ).
fof(f370,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f354,f253]) ).
fof(f371,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f370]) ).
fof(f372,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f357,f255]) ).
fof(f373,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f372]) ).
fof(f374,plain,
$false,
inference(sat_refutation,[status(thm)],[f365,f367,f369,f371,f373]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV175+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 : Tue Apr 30 00:47:29 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.6.0
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.38 % Elapsed time: 0.025062 seconds
% 0.20/0.38 % CPU time: 0.035200 seconds
% 0.20/0.38 % Total memory used: 14.172 MB
% 0.20/0.38 % Net memory used: 14.147 MB
%------------------------------------------------------------------------------