%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWV217+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n022.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 : Thu May 9 17:44:26 EDT 2024
% Result : Theorem 0.92s 1.14s
% Output : Refutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 296 ( 275 equ)
% Maximal formula atoms : 58 ( 29 avg)
% Number of connectives : 493 ( 207 ~; 76 |; 206 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 18 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 4 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0241,conjecture,
! [A,B] :
( ( leq(n0,A)
& leq(n0,B)
& leq(A,n5)
& leq(B,n5) )
=> ( ( ~ ( n0 = A
& n4 = B )
& ~ ( n0 = A
& n5 = B )
& ~ ( n0 = B
& n3 = A )
& ~ ( n0 = B
& n4 = A )
& ~ ( n0 = B
& n5 = A )
& ~ ( n1 = A
& n4 = B )
& ~ ( n1 = A
& n5 = B )
& ~ ( n1 = B
& n3 = A )
& ~ ( n1 = B
& n4 = A )
& ~ ( 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 )
& n2 = A
& n2 = B
& n3 = B )
=> times(divide(n1,n400),a_select2(sigma,n2)) = n0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0241) ).
fof(c75,negated_conjecture,
~ ! [A,B] :
( ( leq(n0,A)
& leq(n0,B)
& leq(A,n5)
& leq(B,n5) )
=> ( ( ~ ( n0 = A
& n4 = B )
& ~ ( n0 = A
& n5 = B )
& ~ ( n0 = B
& n3 = A )
& ~ ( n0 = B
& n4 = A )
& ~ ( n0 = B
& n5 = A )
& ~ ( n1 = A
& n4 = B )
& ~ ( n1 = A
& n5 = B )
& ~ ( n1 = B
& n3 = A )
& ~ ( n1 = B
& n4 = A )
& ~ ( 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 )
& n2 = A
& n2 = B
& n3 = B )
=> times(divide(n1,n400),a_select2(sigma,n2)) = n0 ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0241]) ).
fof(c76,negated_conjecture,
? [A,B] :
( leq(n0,A)
& leq(n0,B)
& leq(A,n5)
& leq(B,n5)
& ( n0 != A
| n4 != B )
& ( n0 != A
| n5 != B )
& ( n0 != B
| n3 != A )
& ( n0 != B
| n4 != A )
& ( n0 != B
| n5 != A )
& ( n1 != A
| n4 != B )
& ( n1 != A
| n5 != B )
& ( n1 != B
| n3 != A )
& ( n1 != B
| n4 != A )
& ( 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 )
& n2 = A
& n2 = B
& n3 = B
& times(divide(n1,n400),a_select2(sigma,n2)) != n0 ),
inference(fof_nnf,[status(thm)],[c75]) ).
fof(c77,negated_conjecture,
? [X8,X9] :
( leq(n0,X8)
& leq(n0,X9)
& leq(X8,n5)
& leq(X9,n5)
& ( n0 != X8
| n4 != X9 )
& ( n0 != X8
| n5 != X9 )
& ( n0 != X9
| n3 != X8 )
& ( n0 != X9
| n4 != X8 )
& ( n0 != X9
| n5 != X8 )
& ( n1 != X8
| n4 != X9 )
& ( n1 != X8
| n5 != X9 )
& ( n1 != X9
| n3 != X8 )
& ( n1 != X9
| n4 != X8 )
& ( n1 != X9
| n5 != X8 )
& ( n2 != X8
| n3 != X9 )
& ( n2 != X8
| n4 != X9 )
& ( n2 != X8
| n5 != X9 )
& ( n2 != X9
| n3 != X8 )
& ( n2 != X9
| n4 != X8 )
& ( n2 != X9
| n5 != X8 )
& ( n3 != X8
| n3 != X9 )
& ( n3 != X8
| n4 != X9 )
& ( n3 != X8
| n5 != X9 )
& ( n3 != X9
| n4 != X8 )
& ( n3 != X9
| n5 != X8 )
& ( n4 != X8
| n4 != X9 )
& ( n4 != X8
| n5 != X9 )
& ( n4 != X9
| n5 != X8 )
& ( n5 != X8
| n5 != X9 )
& n2 = X8
& n2 = X9
& n3 = X9
& times(divide(n1,n400),a_select2(sigma,n2)) != n0 ),
inference(variable_rename,[status(thm)],[c76]) ).
fof(c78,negated_conjecture,
( leq(n0,skolem0001)
& leq(n0,skolem0002)
& leq(skolem0001,n5)
& leq(skolem0002,n5)
& ( n0 != skolem0001
| n4 != skolem0002 )
& ( n0 != skolem0001
| n5 != skolem0002 )
& ( n0 != skolem0002
| n3 != skolem0001 )
& ( n0 != skolem0002
| n4 != skolem0001 )
& ( n0 != skolem0002
| n5 != skolem0001 )
& ( n1 != skolem0001
| n4 != skolem0002 )
& ( n1 != skolem0001
| n5 != skolem0002 )
& ( n1 != skolem0002
| n3 != skolem0001 )
& ( n1 != skolem0002
| n4 != skolem0001 )
& ( n1 != skolem0002
| n5 != skolem0001 )
& ( n2 != skolem0001
| n3 != skolem0002 )
& ( n2 != skolem0001
| n4 != skolem0002 )
& ( n2 != skolem0001
| n5 != skolem0002 )
& ( n2 != skolem0002
| n3 != skolem0001 )
& ( n2 != skolem0002
| n4 != skolem0001 )
& ( n2 != skolem0002
| n5 != skolem0001 )
& ( n3 != skolem0001
| n3 != skolem0002 )
& ( n3 != skolem0001
| n4 != skolem0002 )
& ( n3 != skolem0001
| n5 != skolem0002 )
& ( n3 != skolem0002
| n4 != skolem0001 )
& ( n3 != skolem0002
| n5 != skolem0001 )
& ( n4 != skolem0001
| n4 != skolem0002 )
& ( n4 != skolem0001
| n5 != skolem0002 )
& ( n4 != skolem0002
| n5 != skolem0001 )
& ( n5 != skolem0001
| n5 != skolem0002 )
& n2 = skolem0001
& n2 = skolem0002
& n3 = skolem0002
& times(divide(n1,n400),a_select2(sigma,n2)) != n0 ),
inference(skolemize,[status(esa)],[c77]) ).
cnf(c108,negated_conjecture,
n2 = skolem0001,
inference(split_conjunct,[status(thm)],[c78]) ).
cnf(c110,negated_conjecture,
n3 = skolem0002,
inference(split_conjunct,[status(thm)],[c78]) ).
cnf(c93,negated_conjecture,
( n2 != skolem0001
| n3 != skolem0002 ),
inference(split_conjunct,[status(thm)],[c78]) ).
cnf(c1284,plain,
n2 != skolem0001,
inference(resolution,[status(thm)],[c93,c110]) ).
cnf(c1285,plain,
$false,
inference(resolution,[status(thm)],[c1284,c108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SWV217+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.09/0.15 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.37 % Computer : n022.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu May 9 05:58:37 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.92/1.14 % Version: 1.5
% 0.92/1.14 % SZS status Theorem
% 0.92/1.14 % SZS output start CNFRefutation
% See solution above
% 0.92/1.14
% 0.92/1.14 % Initial clauses : 354
% 0.92/1.14 % Processed clauses : 203
% 0.92/1.14 % Factors computed : 24
% 0.92/1.14 % Resolvents computed: 764
% 0.92/1.14 % Tautologies deleted: 2
% 0.92/1.14 % Forward subsumed : 78
% 0.92/1.14 % Backward subsumed : 1
% 0.92/1.14 % -------- CPU Time ---------
% 0.92/1.14 % User time : 0.738 s
% 0.92/1.14 % System time : 0.028 s
% 0.92/1.14 % Total time : 0.766 s
%------------------------------------------------------------------------------