TSTP Solution File: SWV212+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV212+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n024.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:15 EDT 2024
% Result : Theorem 0.12s 0.33s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 321 ( 299 equ)
% Maximal formula atoms : 78 ( 24 avg)
% Number of connectives : 523 ( 215 ~; 70 |; 234 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 46 ( 14 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 8 ( 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
! [A,B] :
( ( leq(n0,A)
& leq(n0,B)
& leq(A,n5)
& leq(B,n5) )
=> ( ( ~ ( n0 = A
& n1 = B )
& ~ ( n0 = A
& n2 = B )
& ~ ( n0 = A
& n3 = B )
& ~ ( n0 = A
& n4 = B )
& ~ ( n0 = A
& n5 = B )
& ~ ( n0 = B
& n1 = A )
& ~ ( n0 = B
& n2 = A )
& ~ ( n0 = B
& n3 = A )
& ~ ( n0 = B
& n4 = A )
& ~ ( n0 = B
& n5 = A )
& ~ ( n1 = A
& n1 = B )
& ~ ( 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 )
& n0 = A
& n0 = B
& n3 = A )
=> n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
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
& n1 = B )
& ~ ( n0 = A
& n2 = B )
& ~ ( n0 = A
& n3 = B )
& ~ ( n0 = A
& n4 = B )
& ~ ( n0 = A
& n5 = B )
& ~ ( n0 = B
& n1 = A )
& ~ ( n0 = B
& n2 = A )
& ~ ( n0 = B
& n3 = A )
& ~ ( n0 = B
& n4 = A )
& ~ ( n0 = B
& n5 = A )
& ~ ( n1 = A
& n1 = B )
& ~ ( 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 )
& n0 = A
& n0 = B
& n3 = A )
=> n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f70,axiom,
gt(n3,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f98,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f251,plain,
? [A,B] :
( leq(n0,A)
& leq(n0,B)
& leq(A,n5)
& leq(B,n5)
& ( n0 != A
| n1 != B )
& ( n0 != A
| n2 != B )
& ( n0 != A
| n3 != B )
& ( n0 != A
| n4 != B )
& ( n0 != A
| n5 != B )
& ( n0 != B
| n1 != A )
& ( n0 != B
| n2 != A )
& ( n0 != B
| n3 != A )
& ( n0 != B
| n4 != A )
& ( n0 != B
| n5 != A )
& ( n1 != A
| n1 != B )
& ( 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 )
& n0 = A
& n0 = B
& n3 = A
& n0 != times(divide(n1,n400),a_select2(sigma,n0)) ),
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
| n1 != sk0_24 )
& ( 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
| n1 != sk0_23 )
& ( n0 != sk0_24
| n2 != sk0_23 )
& ( n0 != sk0_24
| n3 != sk0_23 )
& ( n0 != sk0_24
| n4 != sk0_23 )
& ( n0 != sk0_24
| n5 != sk0_23 )
& ( n1 != sk0_23
| n1 != sk0_24 )
& ( 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 )
& n0 = sk0_23
& n0 = sk0_24
& n3 = sk0_23
& n0 != times(divide(n1,n400),a_select2(sigma,n0)) ),
inference(skolemization,[status(esa)],[f251]) ).
fof(f292,plain,
n0 = sk0_23,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f294,plain,
n3 = sk0_23,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f311,plain,
gt(n3,n0),
inference(cnf_transformation,[status(esa)],[f70]) ).
fof(f441,plain,
n3 = n0,
inference(forward_demodulation,[status(thm)],[f292,f294]) ).
fof(f450,plain,
gt(n0,n0),
inference(forward_demodulation,[status(thm)],[f441,f311]) ).
fof(f451,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f450,f98]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV212+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.31 % Computer : n024.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Tue Apr 30 00:46:51 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.33 % Drodi V3.6.0
% 0.12/0.33 % Refutation found
% 0.12/0.33 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.35 % Elapsed time: 0.026292 seconds
% 0.12/0.35 % CPU time: 0.035172 seconds
% 0.12/0.35 % Total memory used: 14.595 MB
% 0.12/0.35 % Net memory used: 14.514 MB
%------------------------------------------------------------------------------