TSTP Solution File: SWV214+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV214+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n004.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:55 EDT 2023
% Result : Theorem 0.13s 0.35s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 313 ( 281 equ)
% Maximal formula atoms : 71 ( 14 avg)
% Number of connectives : 489 ( 198 ~; 71 |; 214 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 6 (; 4 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
! [A,B] :
( ( leq(n0,A)
& leq(n0,B)
& leq(A,n5)
& leq(B,n5) )
=> ( ( ~ ( n0 = A
& n2 = B )
& ~ ( n0 = A
& n3 = B )
& ~ ( n0 = A
& n4 = B )
& ~ ( n0 = A
& n5 = B )
& ~ ( n0 = B
& n3 = A )
& ~ ( n0 = B
& n4 = A )
& ~ ( n0 = B
& n5 = A )
& ~ ( n1 = A
& n2 = B )
& ~ ( n1 = A
& n3 = B )
& ~ ( n1 = A
& n4 = B )
& ~ ( n1 = A
& n5 = B )
& ~ ( n1 = B
& n2 = A )
& ~ ( n1 = B
& n3 = A )
& ~ ( n1 = B
& n4 = A )
& ~ ( n1 = B
& n5 = A )
& ~ ( n2 = A
& n2 = B )
& ~ ( n2 = A
& n3 = B )
& ~ ( n2 = A
& n4 = B )
& ~ ( n2 = A
& n5 = B )
& ~ ( n2 = B
& n3 = A )
& ~ ( n2 = B
& n4 = A )
& ~ ( n2 = B
& n5 = A )
& ~ ( n3 = A
& n3 = B )
& ~ ( n3 = A
& n4 = B )
& ~ ( n3 = A
& n5 = B )
& ~ ( n3 = B
& n4 = A )
& ~ ( n3 = B
& n5 = A )
& ~ ( n4 = A
& n4 = B )
& ~ ( n4 = A
& n5 = B )
& ~ ( n4 = B
& n5 = A )
& ~ ( n5 = A
& n5 = B )
& n1 = A
& n1 = B
& n2 = A
& n5 = B )
=> n0 = times(divide(n1,n400),a_select2(sigma,n1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ! [A,B] :
( ( leq(n0,A)
& leq(n0,B)
& leq(A,n5)
& leq(B,n5) )
=> ( ( ~ ( n0 = A
& n2 = B )
& ~ ( n0 = A
& n3 = B )
& ~ ( n0 = A
& n4 = B )
& ~ ( n0 = A
& n5 = B )
& ~ ( n0 = B
& n3 = A )
& ~ ( n0 = B
& n4 = A )
& ~ ( n0 = B
& n5 = A )
& ~ ( n1 = A
& n2 = B )
& ~ ( n1 = A
& n3 = B )
& ~ ( n1 = A
& n4 = B )
& ~ ( n1 = A
& n5 = B )
& ~ ( n1 = B
& n2 = A )
& ~ ( n1 = B
& n3 = A )
& ~ ( n1 = B
& n4 = A )
& ~ ( n1 = B
& n5 = A )
& ~ ( n2 = A
& n2 = B )
& ~ ( n2 = A
& n3 = B )
& ~ ( n2 = A
& n4 = B )
& ~ ( n2 = A
& n5 = B )
& ~ ( n2 = B
& n3 = A )
& ~ ( n2 = B
& n4 = A )
& ~ ( n2 = B
& n5 = A )
& ~ ( n3 = A
& n3 = B )
& ~ ( n3 = A
& n4 = B )
& ~ ( n3 = A
& n5 = B )
& ~ ( n3 = B
& n4 = A )
& ~ ( n3 = B
& n5 = A )
& ~ ( n4 = A
& n4 = B )
& ~ ( n4 = A
& n5 = B )
& ~ ( n4 = B
& n5 = A )
& ~ ( n5 = A
& n5 = B )
& n1 = A
& n1 = B
& n2 = A
& n5 = B )
=> n0 = times(divide(n1,n400),a_select2(sigma,n1)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f251,plain,
? [A,B] :
( leq(n0,A)
& leq(n0,B)
& leq(A,n5)
& leq(B,n5)
& ( n0 != A
| n2 != B )
& ( n0 != A
| n3 != B )
& ( n0 != A
| n4 != B )
& ( n0 != A
| n5 != B )
& ( n0 != B
| n3 != A )
& ( n0 != B
| n4 != A )
& ( n0 != B
| n5 != A )
& ( n1 != A
| n2 != B )
& ( n1 != A
| n3 != B )
& ( n1 != A
| n4 != B )
& ( n1 != A
| n5 != B )
& ( n1 != B
| n2 != A )
& ( n1 != B
| n3 != A )
& ( n1 != B
| n4 != A )
& ( n1 != B
| n5 != A )
& ( n2 != A
| n2 != B )
& ( n2 != A
| n3 != B )
& ( n2 != A
| n4 != B )
& ( n2 != A
| n5 != B )
& ( n2 != B
| n3 != A )
& ( n2 != B
| n4 != A )
& ( n2 != B
| n5 != A )
& ( n3 != A
| n3 != B )
& ( n3 != A
| n4 != B )
& ( n3 != A
| n5 != B )
& ( n3 != B
| n4 != A )
& ( n3 != B
| n5 != A )
& ( n4 != A
| n4 != B )
& ( n4 != A
| n5 != B )
& ( n4 != B
| n5 != A )
& ( n5 != A
| n5 != B )
& n1 = A
& n1 = B
& n2 = A
& n5 = B
& n0 != times(divide(n1,n400),a_select2(sigma,n1)) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f252,plain,
( leq(n0,sk0_23)
& leq(n0,sk0_24)
& leq(sk0_23,n5)
& leq(sk0_24,n5)
& ( n0 != sk0_23
| n2 != sk0_24 )
& ( n0 != sk0_23
| n3 != sk0_24 )
& ( n0 != sk0_23
| n4 != sk0_24 )
& ( n0 != sk0_23
| n5 != sk0_24 )
& ( n0 != sk0_24
| n3 != sk0_23 )
& ( n0 != sk0_24
| n4 != sk0_23 )
& ( n0 != sk0_24
| n5 != sk0_23 )
& ( n1 != sk0_23
| n2 != sk0_24 )
& ( n1 != sk0_23
| n3 != sk0_24 )
& ( n1 != sk0_23
| n4 != sk0_24 )
& ( n1 != sk0_23
| n5 != sk0_24 )
& ( n1 != sk0_24
| n2 != sk0_23 )
& ( n1 != sk0_24
| n3 != sk0_23 )
& ( n1 != sk0_24
| n4 != sk0_23 )
& ( n1 != sk0_24
| n5 != sk0_23 )
& ( n2 != sk0_23
| n2 != sk0_24 )
& ( n2 != sk0_23
| n3 != sk0_24 )
& ( n2 != sk0_23
| n4 != sk0_24 )
& ( n2 != sk0_23
| n5 != sk0_24 )
& ( n2 != sk0_24
| n3 != sk0_23 )
& ( n2 != sk0_24
| n4 != sk0_23 )
& ( n2 != sk0_24
| n5 != sk0_23 )
& ( n3 != sk0_23
| n3 != sk0_24 )
& ( n3 != sk0_23
| n4 != sk0_24 )
& ( n3 != sk0_23
| n5 != sk0_24 )
& ( n3 != sk0_24
| n4 != sk0_23 )
& ( n3 != sk0_24
| n5 != sk0_23 )
& ( n4 != sk0_23
| n4 != sk0_24 )
& ( n4 != sk0_23
| n5 != sk0_24 )
& ( n4 != sk0_24
| n5 != sk0_23 )
& ( n5 != sk0_23
| n5 != sk0_24 )
& n1 = sk0_23
& n1 = sk0_24
& n2 = sk0_23
& n5 = sk0_24
& n0 != times(divide(n1,n400),a_select2(sigma,n1)) ),
inference(skolemization,[status(esa)],[f251]) ).
fof(f264,plain,
( n1 != sk0_23
| n2 != sk0_24 ),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f288,plain,
n1 = sk0_23,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f289,plain,
n1 = sk0_24,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f290,plain,
n2 = sk0_23,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f368,plain,
( spl0_1
<=> n2 = sk0_24 ),
introduced(split_symbol_definition) ).
fof(f370,plain,
( n2 != sk0_24
| spl0_1 ),
inference(component_clause,[status(thm)],[f368]) ).
fof(f399,plain,
( spl0_9
<=> n1 = sk0_23 ),
introduced(split_symbol_definition) ).
fof(f401,plain,
( n1 != sk0_23
| spl0_9 ),
inference(component_clause,[status(thm)],[f399]) ).
fof(f402,plain,
( ~ spl0_9
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f264,f399,f368]) ).
fof(f434,plain,
n2 = n1,
inference(forward_demodulation,[status(thm)],[f288,f290]) ).
fof(f465,plain,
( n1 != n1
| spl0_9 ),
inference(forward_demodulation,[status(thm)],[f288,f401]) ).
fof(f466,plain,
( $false
| spl0_9 ),
inference(trivial_equality_resolution,[status(esa)],[f465]) ).
fof(f467,plain,
spl0_9,
inference(contradiction_clause,[status(thm)],[f466]) ).
fof(f472,plain,
( n1 != sk0_24
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f434,f370]) ).
fof(f473,plain,
( n1 != n1
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f289,f472]) ).
fof(f474,plain,
( $false
| spl0_1 ),
inference(trivial_equality_resolution,[status(esa)],[f473]) ).
fof(f475,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f474]) ).
fof(f476,plain,
$false,
inference(sat_refutation,[status(thm)],[f402,f467,f475]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV214+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue May 30 11:33:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.35 % Refutation found
% 0.13/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.31/0.58 % Elapsed time: 0.030969 seconds
% 0.31/0.58 % CPU time: 0.040375 seconds
% 0.31/0.58 % Memory used: 14.112 MB
%------------------------------------------------------------------------------