TSTP Solution File: SWV214+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWV214+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %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 : 600s
% DateTime : Wed Jul 20 21:16:10 EDT 2022
% Result : Theorem 0.91s 1.14s
% Output : Refutation 0.91s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0121,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)) ) ),
input ).
fof(c75,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(assume_negation,status(cth),[quaternion_ds1_symm_0121]) ).
fof(c76,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(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
| n2 != X9 )
& ( n0 != X8
| n3 != X9 )
& ( n0 != X8
| n4 != X9 )
& ( n0 != X8
| n5 != X9 )
& ( n0 != X9
| n3 != X8 )
& ( n0 != X9
| n4 != X8 )
& ( n0 != X9
| n5 != X8 )
& ( n1 != X8
| n2 != X9 )
& ( n1 != X8
| n3 != X9 )
& ( n1 != X8
| n4 != X9 )
& ( n1 != X8
| n5 != X9 )
& ( n1 != X9
| n2 != X8 )
& ( n1 != X9
| n3 != X8 )
& ( n1 != X9
| n4 != X8 )
& ( n1 != X9
| n5 != X8 )
& ( n2 != X8
| n2 != X9 )
& ( 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 )
& n1 = X8
& n1 = X9
& n2 = X8
& n5 = X9
& n0 != times(divide(n1,n400),a_select2(sigma,n1)) ),
inference(variable_rename,status(thm),[c76]) ).
fof(c78,negated_conjecture,
( leq(n0,skolem0001)
& leq(n0,skolem0002)
& leq(skolem0001,n5)
& leq(skolem0002,n5)
& ( n0 != skolem0001
| n2 != skolem0002 )
& ( n0 != skolem0001
| n3 != skolem0002 )
& ( n0 != skolem0001
| n4 != skolem0002 )
& ( n0 != skolem0001
| n5 != skolem0002 )
& ( n0 != skolem0002
| n3 != skolem0001 )
& ( n0 != skolem0002
| n4 != skolem0001 )
& ( n0 != skolem0002
| n5 != skolem0001 )
& ( n1 != skolem0001
| n2 != skolem0002 )
& ( n1 != skolem0001
| n3 != skolem0002 )
& ( n1 != skolem0001
| n4 != skolem0002 )
& ( n1 != skolem0001
| n5 != skolem0002 )
& ( n1 != skolem0002
| n2 != skolem0001 )
& ( n1 != skolem0002
| n3 != skolem0001 )
& ( n1 != skolem0002
| n4 != skolem0001 )
& ( n1 != skolem0002
| n5 != skolem0001 )
& ( n2 != skolem0001
| n2 != skolem0002 )
& ( 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 )
& n1 = skolem0001
& n1 = skolem0002
& n2 = skolem0001
& n5 = skolem0002
& n0 != times(divide(n1,n400),a_select2(sigma,n1)) ),
inference(skolemize,status(esa),[c77]) ).
cnf(c114,negated_conjecture,
n1 = skolem0001,
inference(split_conjunct,status(thm),[c78]) ).
cnf(c117,negated_conjecture,
n5 = skolem0002,
inference(split_conjunct,status(thm),[c78]) ).
cnf(c93,negated_conjecture,
( n1 != skolem0001
| n5 != skolem0002 ),
inference(split_conjunct,status(thm),[c78]) ).
cnf(c1288,plain,
n1 != skolem0001,
inference(resolution,status(thm),[c93,c117]) ).
cnf(c1289,plain,
$false,
inference(resolution,status(thm),[c1288,c114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV214+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 06:57:24 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.91/1.14 # Version: 1.3
% 0.91/1.14 # SZS status Theorem
% 0.91/1.14 # SZS output start CNFRefutation
% See solution above
% 0.91/1.14
% 0.91/1.14 # Initial clauses : 361
% 0.91/1.14 # Processed clauses : 204
% 0.91/1.14 # Factors computed : 0
% 0.91/1.14 # Resolvents computed: 785
% 0.91/1.14 # Tautologies deleted: 1
% 0.91/1.14 # Forward subsumed : 78
% 0.91/1.14 # Backward subsumed : 8
% 0.91/1.14 # -------- CPU Time ---------
% 0.91/1.14 # User time : 0.771 s
% 0.91/1.14 # System time : 0.009 s
% 0.91/1.14 # Total time : 0.780 s
%------------------------------------------------------------------------------