TSTP Solution File: SWV169+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV169+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 : Tue Apr 30 20:46:09 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 109 ( 23 equ)
% Maximal formula atoms : 28 ( 6 avg)
% Number of connectives : 119 ( 28 ~; 25 |; 48 &)
% ( 2 <=>; 16 =>; 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 : 11 ( 11 usr; 9 con; 0-3 aty)
% Number of variables : 22 ( 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [A,B] :
( ( leq(n0,A)
& leq(n0,B)
& leq(A,n135299)
& leq(B,n4) )
=> ( ( A = pv10
& gt(pv11,B) )
=> a_select3(q_init,A,B) = init ) )
& ! [C,D] :
( ( leq(n0,C)
& leq(n0,D)
& leq(C,n135299)
& leq(D,n4) )
=> ( gt(pv10,C)
=> a_select3(q_init,C,D) = init ) )
& ! [E] :
( ( leq(n0,E)
& leq(E,pred(pv10)) )
=> ! [F] :
( ( leq(n0,F)
& leq(F,n4) )
=> a_select3(q_init,E,F) = init ) )
& ! [G] :
( ( leq(n0,G)
& leq(G,n4) )
=> a_select3(center_init,G,n0) = init ) )
=> a_select3(center_init,pv65,n0) = init ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [A,B] :
( ( leq(n0,A)
& leq(n0,B)
& leq(A,n135299)
& leq(B,n4) )
=> ( ( A = pv10
& gt(pv11,B) )
=> a_select3(q_init,A,B) = init ) )
& ! [C,D] :
( ( leq(n0,C)
& leq(n0,D)
& leq(C,n135299)
& leq(D,n4) )
=> ( gt(pv10,C)
=> a_select3(q_init,C,D) = init ) )
& ! [E] :
( ( leq(n0,E)
& leq(E,pred(pv10)) )
=> ! [F] :
( ( leq(n0,F)
& leq(F,n4) )
=> a_select3(q_init,E,F) = init ) )
& ! [G] :
( ( leq(n0,G)
& leq(G,n4) )
=> a_select3(center_init,G,n0) = init ) )
=> a_select3(center_init,pv65,n0) = init ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f251,plain,
( leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [A,B] :
( ~ leq(n0,A)
| ~ leq(n0,B)
| ~ leq(A,n135299)
| ~ leq(B,n4)
| A != pv10
| ~ gt(pv11,B)
| a_select3(q_init,A,B) = init )
& ! [C,D] :
( ~ leq(n0,C)
| ~ leq(n0,D)
| ~ leq(C,n135299)
| ~ leq(D,n4)
| ~ gt(pv10,C)
| a_select3(q_init,C,D) = init )
& ! [E] :
( ~ leq(n0,E)
| ~ leq(E,pred(pv10))
| ! [F] :
( ~ leq(n0,F)
| ~ leq(F,n4)
| a_select3(q_init,E,F) = init ) )
& ! [G] :
( ~ leq(n0,G)
| ~ leq(G,n4)
| a_select3(center_init,G,n0) = init )
& a_select3(center_init,pv65,n0) != init ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f254,plain,
leq(n0,pv65),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f257,plain,
leq(pv65,n4),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f261,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n4)
| a_select3(center_init,X0,n0) = init ),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f262,plain,
a_select3(center_init,pv65,n0) != init,
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f342,plain,
( spl0_0
<=> leq(n0,pv65) ),
introduced(split_symbol_definition) ).
fof(f344,plain,
( ~ leq(n0,pv65)
| spl0_0 ),
inference(component_clause,[status(thm)],[f342]) ).
fof(f345,plain,
( spl0_1
<=> a_select3(center_init,pv65,n0) = init ),
introduced(split_symbol_definition) ).
fof(f346,plain,
( a_select3(center_init,pv65,n0) = init
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f345]) ).
fof(f348,plain,
( ~ leq(n0,pv65)
| a_select3(center_init,pv65,n0) = init ),
inference(resolution,[status(thm)],[f261,f257]) ).
fof(f349,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f348,f342,f345]) ).
fof(f369,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f344,f254]) ).
fof(f370,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f369]) ).
fof(f371,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f346,f262]) ).
fof(f372,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f371]) ).
fof(f373,plain,
$false,
inference(sat_refutation,[status(thm)],[f349,f370,f372]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV169+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.08/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n003.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 Apr 30 01:00:48 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.6.0
% 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.38 % Elapsed time: 0.028303 seconds
% 0.13/0.38 % CPU time: 0.041658 seconds
% 0.13/0.38 % Total memory used: 14.295 MB
% 0.13/0.38 % Net memory used: 14.254 MB
%------------------------------------------------------------------------------