TSTP Solution File: SWV183+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV183+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n011.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:51 EDT 2023
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 193 ( 50 equ)
% Maximal formula atoms : 42 ( 10 avg)
% Number of connectives : 240 ( 66 ~; 62 |; 76 &)
% ( 2 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 15 con; 0-3 aty)
% Number of variables : 52 (; 51 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( gt(loopcounter,n0)
& ! [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,n4) )
=> a_select2(mu_init,D) = init )
& ! [E] :
( ( leq(n0,E)
& leq(E,n4) )
=> 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 ) )
& ! [J] :
( ( leq(n0,J)
& leq(J,n4) )
=> a_select2(muold_init,J) = init )
& ! [K] :
( ( leq(n0,K)
& leq(K,n4) )
=> a_select2(rhoold_init,K) = init )
& ! [L] :
( ( leq(n0,L)
& leq(L,n4) )
=> a_select2(sigmaold_init,L) = init ) )
=> ! [M] :
( ( leq(n0,M)
& leq(M,n4) )
=> a_select2(mu_init,M) = init ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( gt(loopcounter,n0)
& ! [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,n4) )
=> a_select2(mu_init,D) = init )
& ! [E] :
( ( leq(n0,E)
& leq(E,n4) )
=> 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 ) )
& ! [J] :
( ( leq(n0,J)
& leq(J,n4) )
=> a_select2(muold_init,J) = init )
& ! [K] :
( ( leq(n0,K)
& leq(K,n4) )
=> a_select2(rhoold_init,K) = init )
& ! [L] :
( ( leq(n0,L)
& leq(L,n4) )
=> a_select2(sigmaold_init,L) = init ) )
=> ! [M] :
( ( leq(n0,M)
& leq(M,n4) )
=> a_select2(mu_init,M) = init ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f251,plain,
( gt(loopcounter,n0)
& ! [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,n4)
| a_select2(mu_init,D) = init )
& ! [E] :
( ~ leq(n0,E)
| ~ leq(E,n4)
| 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 ) )
& ! [J] :
( ~ leq(n0,J)
| ~ leq(J,n4)
| a_select2(muold_init,J) = init )
& ! [K] :
( ~ leq(n0,K)
| ~ leq(K,n4)
| a_select2(rhoold_init,K) = init )
& ! [L] :
( ~ leq(n0,L)
| ~ leq(L,n4)
| a_select2(sigmaold_init,L) = init )
& ? [M] :
( leq(n0,M)
& leq(M,n4)
& a_select2(mu_init,M) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f252,plain,
( gt(loopcounter,n0)
& ! [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,n4)
| a_select2(mu_init,D) = init )
& ! [E] :
( ~ leq(n0,E)
| ~ leq(E,n4)
| 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 ) )
& ! [J] :
( ~ leq(n0,J)
| ~ leq(J,n4)
| a_select2(muold_init,J) = init )
& ! [K] :
( ~ leq(n0,K)
| ~ leq(K,n4)
| a_select2(rhoold_init,K) = init )
& ! [L] :
( ~ leq(n0,L)
| ~ leq(L,n4)
| a_select2(sigmaold_init,L) = init )
& leq(n0,sk0_23)
& leq(sk0_23,n4)
& a_select2(mu_init,sk0_23) != init ),
inference(skolemization,[status(esa)],[f251]) ).
fof(f256,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n4)
| a_select2(mu_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f265,plain,
leq(n0,sk0_23),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f266,plain,
leq(sk0_23,n4),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f267,plain,
a_select2(mu_init,sk0_23) != init,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f623,plain,
( spl0_34
<=> leq(n0,sk0_23) ),
introduced(split_symbol_definition) ).
fof(f625,plain,
( ~ leq(n0,sk0_23)
| spl0_34 ),
inference(component_clause,[status(thm)],[f623]) ).
fof(f626,plain,
( spl0_35
<=> leq(sk0_23,n4) ),
introduced(split_symbol_definition) ).
fof(f628,plain,
( ~ leq(sk0_23,n4)
| spl0_35 ),
inference(component_clause,[status(thm)],[f626]) ).
fof(f629,plain,
( ~ leq(n0,sk0_23)
| ~ leq(sk0_23,n4) ),
inference(resolution,[status(thm)],[f256,f267]) ).
fof(f630,plain,
( ~ spl0_34
| ~ spl0_35 ),
inference(split_clause,[status(thm)],[f629,f623,f626]) ).
fof(f631,plain,
( $false
| spl0_34 ),
inference(forward_subsumption_resolution,[status(thm)],[f625,f265]) ).
fof(f632,plain,
spl0_34,
inference(contradiction_clause,[status(thm)],[f631]) ).
fof(f633,plain,
( $false
| spl0_35 ),
inference(forward_subsumption_resolution,[status(thm)],[f628,f266]) ).
fof(f634,plain,
spl0_35,
inference(contradiction_clause,[status(thm)],[f633]) ).
fof(f635,plain,
$false,
inference(sat_refutation,[status(thm)],[f630,f632,f634]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV183+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 May 30 11:42:12 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.5.1
% 0.13/0.37 % Refutation found
% 0.13/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.39 % Elapsed time: 0.032860 seconds
% 0.13/0.39 % CPU time: 0.059438 seconds
% 0.13/0.39 % Memory used: 16.126 MB
%------------------------------------------------------------------------------