TSTP Solution File: SWV216+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV216+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n028.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:16 EDT 2024
% Result : Theorem 0.11s 0.34s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 11 unt; 0 def)
% Number of atoms : 255 ( 222 equ)
% Maximal formula atoms : 55 ( 9 avg)
% Number of connectives : 379 ( 151 ~; 56 |; 166 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 6 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
& n3 = B )
& ~ ( n0 = A
& n4 = B )
& ~ ( n0 = A
& n5 = B )
& ~ ( n0 = B
& n5 = A )
& ~ ( n1 = A
& n3 = B )
& ~ ( n1 = A
& n4 = B )
& ~ ( n1 = A
& n5 = B )
& ~ ( n1 = B
& n5 = A )
& ~ ( 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 = B
& n2 = A
& n2 = B
& n4 = A )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ! [A,B] :
( ( leq(n0,A)
& leq(n0,B)
& leq(A,n5)
& leq(B,n5) )
=> ( ( ~ ( n0 = A
& n3 = B )
& ~ ( n0 = A
& n4 = B )
& ~ ( n0 = A
& n5 = B )
& ~ ( n0 = B
& n5 = A )
& ~ ( n1 = A
& n3 = B )
& ~ ( n1 = A
& n4 = B )
& ~ ( n1 = A
& n5 = B )
& ~ ( n1 = B
& n5 = A )
& ~ ( 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 = B
& n2 = A
& n2 = B
& n4 = A )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
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
| n3 != B )
& ( n0 != A
| n4 != B )
& ( n0 != A
| n5 != B )
& ( n0 != B
| n5 != A )
& ( n1 != A
| n3 != B )
& ( n1 != A
| n4 != B )
& ( n1 != A
| n5 != B )
& ( n1 != B
| n5 != A )
& ( 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 = B
& n2 = A
& n2 = B
& n4 = A
& n0 != times(divide(n1,n400),a_select2(sigma,n2)) ),
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
| n3 != sk0_24 )
& ( n0 != sk0_23
| n4 != sk0_24 )
& ( n0 != sk0_23
| n5 != sk0_24 )
& ( n0 != sk0_24
| n5 != sk0_23 )
& ( n1 != sk0_23
| n3 != sk0_24 )
& ( n1 != sk0_23
| n4 != sk0_24 )
& ( n1 != sk0_23
| n5 != sk0_24 )
& ( n1 != sk0_24
| n5 != sk0_23 )
& ( 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_24
& n2 = sk0_23
& n2 = sk0_24
& n4 = sk0_23
& n0 != times(divide(n1,n400),a_select2(sigma,n2)) ),
inference(skolemization,[status(esa)],[f251]) ).
fof(f266,plain,
( n2 != sk0_23
| n4 != sk0_24 ),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f280,plain,
n1 = sk0_24,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f281,plain,
n2 = sk0_23,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f282,plain,
n2 = sk0_24,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f283,plain,
n4 = sk0_23,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f364,plain,
( spl0_2
<=> n4 = sk0_24 ),
introduced(split_symbol_definition) ).
fof(f366,plain,
( n4 != sk0_24
| spl0_2 ),
inference(component_clause,[status(thm)],[f364]) ).
fof(f389,plain,
( spl0_8
<=> n2 = sk0_23 ),
introduced(split_symbol_definition) ).
fof(f391,plain,
( n2 != sk0_23
| spl0_8 ),
inference(component_clause,[status(thm)],[f389]) ).
fof(f393,plain,
( ~ spl0_8
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f266,f389,f364]) ).
fof(f418,plain,
n2 = n1,
inference(forward_demodulation,[status(thm)],[f280,f282]) ).
fof(f419,plain,
n1 = sk0_23,
inference(backward_demodulation,[status(thm)],[f418,f281]) ).
fof(f420,plain,
n1 = n4,
inference(forward_demodulation,[status(thm)],[f283,f419]) ).
fof(f421,plain,
n1 = sk0_23,
inference(backward_demodulation,[status(thm)],[f420,f283]) ).
fof(f436,plain,
( n1 != sk0_23
| spl0_8 ),
inference(forward_demodulation,[status(thm)],[f418,f391]) ).
fof(f437,plain,
( n1 != n1
| spl0_8 ),
inference(forward_demodulation,[status(thm)],[f421,f436]) ).
fof(f438,plain,
( $false
| spl0_8 ),
inference(trivial_equality_resolution,[status(esa)],[f437]) ).
fof(f439,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f438]) ).
fof(f449,plain,
( n1 != sk0_24
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f420,f366]) ).
fof(f450,plain,
( n1 != n1
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f280,f449]) ).
fof(f451,plain,
( $false
| spl0_2 ),
inference(trivial_equality_resolution,[status(esa)],[f450]) ).
fof(f452,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f451]) ).
fof(f453,plain,
$false,
inference(sat_refutation,[status(thm)],[f393,f439,f452]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV216+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Apr 30 01:01:59 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.34 % Drodi V3.6.0
% 0.11/0.34 % Refutation found
% 0.11/0.34 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.34 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.35 % Elapsed time: 0.025092 seconds
% 0.16/0.35 % CPU time: 0.035456 seconds
% 0.16/0.35 % Total memory used: 14.486 MB
% 0.16/0.35 % Net memory used: 14.457 MB
%------------------------------------------------------------------------------