TSTP Solution File: SWV168+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV168+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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 : Wed May 31 12:40:49 EDT 2023
% Result : Theorem 0.15s 0.33s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 10 unt; 0 def)
% Number of atoms : 152 ( 32 equ)
% Maximal formula atoms : 35 ( 5 avg)
% Number of connectives : 164 ( 40 ~; 39 |; 55 &)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 16 con; 0-3 aty)
% Number of variables : 29 (; 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( a_select2(mu_init,pv40) = init
& leq(n0,pv40)
& leq(n0,pv46)
& leq(pv40,n4)
& leq(pv46,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,n4) )
=> a_select2(rho_init,C) = init )
& ! [D] :
( ( leq(n0,D)
& leq(D,pred(pv40)) )
=> a_select2(mu_init,D) = init )
& ! [E] :
( ( leq(n0,E)
& leq(E,pred(pv40)) )
=> a_select2(sigma_init,E) = init )
& ! [F] :
( ( leq(n0,F)
& leq(F,n4) )
=> a_select3(center_init,F,n0) = init )
& ( gt(loopcounter,n1)
=> ! [G] :
( ( leq(n0,G)
& leq(G,n4) )
=> a_select2(muold_init,G) = init ) )
& ( gt(loopcounter,n1)
=> ! [H] :
( ( leq(n0,H)
& leq(H,n4) )
=> a_select2(rhoold_init,H) = init ) )
& ( gt(loopcounter,n1)
=> ! [I] :
( ( leq(n0,I)
& leq(I,n4) )
=> a_select2(sigmaold_init,I) = init ) ) )
=> a_select3(q_init,pv46,pv40) = init ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( a_select2(mu_init,pv40) = init
& leq(n0,pv40)
& leq(n0,pv46)
& leq(pv40,n4)
& leq(pv46,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,n4) )
=> a_select2(rho_init,C) = init )
& ! [D] :
( ( leq(n0,D)
& leq(D,pred(pv40)) )
=> a_select2(mu_init,D) = init )
& ! [E] :
( ( leq(n0,E)
& leq(E,pred(pv40)) )
=> a_select2(sigma_init,E) = init )
& ! [F] :
( ( leq(n0,F)
& leq(F,n4) )
=> a_select3(center_init,F,n0) = init )
& ( gt(loopcounter,n1)
=> ! [G] :
( ( leq(n0,G)
& leq(G,n4) )
=> a_select2(muold_init,G) = init ) )
& ( gt(loopcounter,n1)
=> ! [H] :
( ( leq(n0,H)
& leq(H,n4) )
=> a_select2(rhoold_init,H) = init ) )
& ( gt(loopcounter,n1)
=> ! [I] :
( ( leq(n0,I)
& leq(I,n4) )
=> a_select2(sigmaold_init,I) = init ) ) )
=> a_select3(q_init,pv46,pv40) = init ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f251,plain,
( a_select2(mu_init,pv40) = init
& leq(n0,pv40)
& leq(n0,pv46)
& leq(pv40,n4)
& leq(pv46,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,n4)
| a_select2(rho_init,C) = init )
& ! [D] :
( ~ leq(n0,D)
| ~ leq(D,pred(pv40))
| a_select2(mu_init,D) = init )
& ! [E] :
( ~ leq(n0,E)
| ~ leq(E,pred(pv40))
| a_select2(sigma_init,E) = init )
& ! [F] :
( ~ leq(n0,F)
| ~ leq(F,n4)
| a_select3(center_init,F,n0) = init )
& ( ~ gt(loopcounter,n1)
| ! [G] :
( ~ leq(n0,G)
| ~ leq(G,n4)
| a_select2(muold_init,G) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [H] :
( ~ leq(n0,H)
| ~ leq(H,n4)
| a_select2(rhoold_init,H) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [I] :
( ~ leq(n0,I)
| ~ leq(I,n4)
| a_select2(sigmaold_init,I) = init ) )
& a_select3(q_init,pv46,pv40) != init ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f253,plain,
leq(n0,pv40),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f254,plain,
leq(n0,pv46),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f255,plain,
leq(pv40,n4),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f256,plain,
leq(pv46,n135299),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f257,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(f265,plain,
a_select3(q_init,pv46,pv40) != init,
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f583,plain,
( spl0_30
<=> leq(n0,pv46) ),
introduced(split_symbol_definition) ).
fof(f585,plain,
( ~ leq(n0,pv46)
| spl0_30 ),
inference(component_clause,[status(thm)],[f583]) ).
fof(f586,plain,
( spl0_31
<=> leq(pv46,n135299) ),
introduced(split_symbol_definition) ).
fof(f588,plain,
( ~ leq(pv46,n135299)
| spl0_31 ),
inference(component_clause,[status(thm)],[f586]) ).
fof(f589,plain,
( spl0_32
<=> leq(n0,pv40) ),
introduced(split_symbol_definition) ).
fof(f591,plain,
( ~ leq(n0,pv40)
| spl0_32 ),
inference(component_clause,[status(thm)],[f589]) ).
fof(f592,plain,
( spl0_33
<=> leq(pv40,n4) ),
introduced(split_symbol_definition) ).
fof(f594,plain,
( ~ leq(pv40,n4)
| spl0_33 ),
inference(component_clause,[status(thm)],[f592]) ).
fof(f595,plain,
( ~ leq(n0,pv46)
| ~ leq(pv46,n135299)
| ~ leq(n0,pv40)
| ~ leq(pv40,n4) ),
inference(resolution,[status(thm)],[f265,f257]) ).
fof(f596,plain,
( ~ spl0_30
| ~ spl0_31
| ~ spl0_32
| ~ spl0_33 ),
inference(split_clause,[status(thm)],[f595,f583,f586,f589,f592]) ).
fof(f597,plain,
( $false
| spl0_33 ),
inference(forward_subsumption_resolution,[status(thm)],[f594,f255]) ).
fof(f598,plain,
spl0_33,
inference(contradiction_clause,[status(thm)],[f597]) ).
fof(f599,plain,
( $false
| spl0_32 ),
inference(forward_subsumption_resolution,[status(thm)],[f591,f253]) ).
fof(f600,plain,
spl0_32,
inference(contradiction_clause,[status(thm)],[f599]) ).
fof(f601,plain,
( $false
| spl0_30 ),
inference(forward_subsumption_resolution,[status(thm)],[f585,f254]) ).
fof(f602,plain,
spl0_30,
inference(contradiction_clause,[status(thm)],[f601]) ).
fof(f603,plain,
( $false
| spl0_31 ),
inference(forward_subsumption_resolution,[status(thm)],[f588,f256]) ).
fof(f604,plain,
spl0_31,
inference(contradiction_clause,[status(thm)],[f603]) ).
fof(f605,plain,
$false,
inference(sat_refutation,[status(thm)],[f596,f598,f600,f602,f604]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV168+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.31 % Computer : n003.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Tue May 30 11:37:53 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.15/0.32 % Drodi V3.5.1
% 0.15/0.33 % Refutation found
% 0.15/0.33 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.55 % Elapsed time: 0.029282 seconds
% 0.15/0.55 % CPU time: 0.022040 seconds
% 0.15/0.55 % Memory used: 4.126 MB
%------------------------------------------------------------------------------