TSTP Solution File: SWV167+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV167+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n029.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.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 8 unt; 0 def)
% Number of atoms : 214 ( 55 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 249 ( 73 ~; 69 |; 73 &)
% ( 5 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 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 : 56 (; 55 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X,Y] :
( ( leq(X,Y)
& X != Y )
=> gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X,Y] :
( leq(X,pred(Y))
<=> gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( a_select2(mu_init,pv40) = init
& a_select2(sigma_init,pv40) = init
& leq(n0,pv40)
& leq(pv40,n4)
& ! [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 ) ) )
=> ! [J] :
( ( leq(n0,J)
& leq(J,pv40) )
=> a_select2(mu_init,J) = init ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( a_select2(mu_init,pv40) = init
& a_select2(sigma_init,pv40) = init
& leq(n0,pv40)
& leq(pv40,n4)
& ! [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 ) ) )
=> ! [J] :
( ( leq(n0,J)
& leq(J,pv40) )
=> a_select2(mu_init,J) = init ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f113,plain,
! [X,Y] :
( ~ leq(X,Y)
| X = Y
| gt(Y,X) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f114,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| X0 = X1
| gt(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f113]) ).
fof(f115,plain,
! [X,Y] :
( ( ~ leq(X,pred(Y))
| gt(Y,X) )
& ( leq(X,pred(Y))
| ~ gt(Y,X) ) ),
inference(NNF_transformation,[status(esa)],[f10]) ).
fof(f116,plain,
( ! [X,Y] :
( ~ leq(X,pred(Y))
| gt(Y,X) )
& ! [X,Y] :
( leq(X,pred(Y))
| ~ gt(Y,X) ) ),
inference(miniscoping,[status(esa)],[f115]) ).
fof(f118,plain,
! [X0,X1] :
( leq(X0,pred(X1))
| ~ gt(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f116]) ).
fof(f251,plain,
( a_select2(mu_init,pv40) = init
& a_select2(sigma_init,pv40) = init
& leq(n0,pv40)
& leq(pv40,n4)
& ! [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 ) )
& ? [J] :
( leq(n0,J)
& leq(J,pv40)
& a_select2(mu_init,J) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f252,plain,
( a_select2(mu_init,pv40) = init
& a_select2(sigma_init,pv40) = init
& leq(n0,pv40)
& leq(pv40,n4)
& ! [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 ) )
& leq(n0,sk0_23)
& leq(sk0_23,pv40)
& a_select2(mu_init,sk0_23) != init ),
inference(skolemization,[status(esa)],[f251]) ).
fof(f253,plain,
a_select2(mu_init,pv40) = init,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f259,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,pred(pv40))
| 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,pv40),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f267,plain,
a_select2(mu_init,sk0_23) != init,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f1627,plain,
( spl0_114
<=> leq(n0,sk0_23) ),
introduced(split_symbol_definition) ).
fof(f1629,plain,
( ~ leq(n0,sk0_23)
| spl0_114 ),
inference(component_clause,[status(thm)],[f1627]) ).
fof(f1642,plain,
( $false
| spl0_114 ),
inference(forward_subsumption_resolution,[status(thm)],[f1629,f265]) ).
fof(f1643,plain,
spl0_114,
inference(contradiction_clause,[status(thm)],[f1642]) ).
fof(f1921,plain,
( spl0_121
<=> leq(sk0_23,pred(pv40)) ),
introduced(split_symbol_definition) ).
fof(f1923,plain,
( ~ leq(sk0_23,pred(pv40))
| spl0_121 ),
inference(component_clause,[status(thm)],[f1921]) ).
fof(f1924,plain,
( ~ leq(n0,sk0_23)
| ~ leq(sk0_23,pred(pv40)) ),
inference(resolution,[status(thm)],[f259,f267]) ).
fof(f1925,plain,
( ~ spl0_114
| ~ spl0_121 ),
inference(split_clause,[status(thm)],[f1924,f1627,f1921]) ).
fof(f1968,plain,
( ~ gt(pv40,sk0_23)
| spl0_121 ),
inference(resolution,[status(thm)],[f1923,f118]) ).
fof(f1999,plain,
( spl0_124
<=> leq(sk0_23,pv40) ),
introduced(split_symbol_definition) ).
fof(f2001,plain,
( ~ leq(sk0_23,pv40)
| spl0_124 ),
inference(component_clause,[status(thm)],[f1999]) ).
fof(f2002,plain,
( spl0_125
<=> sk0_23 = pv40 ),
introduced(split_symbol_definition) ).
fof(f2003,plain,
( sk0_23 = pv40
| ~ spl0_125 ),
inference(component_clause,[status(thm)],[f2002]) ).
fof(f2005,plain,
( ~ leq(sk0_23,pv40)
| sk0_23 = pv40
| spl0_121 ),
inference(resolution,[status(thm)],[f1968,f114]) ).
fof(f2006,plain,
( ~ spl0_124
| spl0_125
| spl0_121 ),
inference(split_clause,[status(thm)],[f2005,f1999,f2002,f1921]) ).
fof(f2054,plain,
( a_select2(mu_init,pv40) != init
| ~ spl0_125 ),
inference(forward_demodulation,[status(thm)],[f2003,f267]) ).
fof(f2055,plain,
( init != init
| ~ spl0_125 ),
inference(forward_demodulation,[status(thm)],[f253,f2054]) ).
fof(f2056,plain,
( $false
| ~ spl0_125 ),
inference(trivial_equality_resolution,[status(esa)],[f2055]) ).
fof(f2057,plain,
~ spl0_125,
inference(contradiction_clause,[status(thm)],[f2056]) ).
fof(f2135,plain,
( $false
| spl0_124 ),
inference(forward_subsumption_resolution,[status(thm)],[f2001,f266]) ).
fof(f2136,plain,
spl0_124,
inference(contradiction_clause,[status(thm)],[f2135]) ).
fof(f2137,plain,
$false,
inference(sat_refutation,[status(thm)],[f1643,f1925,f2006,f2057,f2136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV167+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n029.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 11:56:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.20/0.53 % Refutation found
% 0.20/0.53 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.53 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.55 % Elapsed time: 0.205199 seconds
% 0.20/0.55 % CPU time: 1.481972 seconds
% 0.20/0.55 % Memory used: 76.554 MB
%------------------------------------------------------------------------------