TSTP Solution File: SWV220+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV220+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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 Aug 31 22:31:39 EDT 2023
% Result : Theorem 1.01s 1.15s
% Output : CNFRefutation 1.01s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f475)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
! [X13,X17] :
( ( leq(X17,n5)
& leq(X13,n5)
& leq(n0,X17)
& leq(n0,X13) )
=> ( ( n5 = X17
& n3 = X17
& n3 = X13
& n1 = X13
& ~ ( n5 = X17
& n5 = X13 )
& ~ ( n5 = X13
& n4 = X17 )
& ~ ( n5 = X17
& n4 = X13 )
& ~ ( n4 = X17
& n4 = X13 )
& ~ ( n5 = X13
& n3 = X17 )
& ~ ( n4 = X13
& n3 = X17 )
& ~ ( n5 = X17
& n3 = X13 )
& ~ ( n4 = X17
& n3 = X13 )
& ~ ( n5 = X13
& n2 = X17 )
& ~ ( n4 = X13
& n2 = X17 )
& ~ ( n5 = X17
& n2 = X13 )
& ~ ( n5 = X13
& n1 = X17 )
& ~ ( n4 = X13
& n1 = X17 )
& ~ ( n5 = X13
& n0 = X17 )
& ~ ( n4 = X13
& n0 = X17 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n3)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0361) ).
fof(f54,negated_conjecture,
~ ! [X13,X17] :
( ( leq(X17,n5)
& leq(X13,n5)
& leq(n0,X17)
& leq(n0,X13) )
=> ( ( n5 = X17
& n3 = X17
& n3 = X13
& n1 = X13
& ~ ( n5 = X17
& n5 = X13 )
& ~ ( n5 = X13
& n4 = X17 )
& ~ ( n5 = X17
& n4 = X13 )
& ~ ( n4 = X17
& n4 = X13 )
& ~ ( n5 = X13
& n3 = X17 )
& ~ ( n4 = X13
& n3 = X17 )
& ~ ( n5 = X17
& n3 = X13 )
& ~ ( n4 = X17
& n3 = X13 )
& ~ ( n5 = X13
& n2 = X17 )
& ~ ( n4 = X13
& n2 = X17 )
& ~ ( n5 = X17
& n2 = X13 )
& ~ ( n5 = X13
& n1 = X17 )
& ~ ( n4 = X13
& n1 = X17 )
& ~ ( n5 = X13
& n0 = X17 )
& ~ ( n4 = X13
& n0 = X17 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n3)) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f114,plain,
~ ! [X0,X1] :
( ( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) )
=> ( ( n5 = X1
& n3 = X1
& n3 = X0
& n1 = X0
& ~ ( n5 = X1
& n5 = X0 )
& ~ ( n5 = X0
& n4 = X1 )
& ~ ( n5 = X1
& n4 = X0 )
& ~ ( n4 = X1
& n4 = X0 )
& ~ ( n5 = X0
& n3 = X1 )
& ~ ( n4 = X0
& n3 = X1 )
& ~ ( n5 = X1
& n3 = X0 )
& ~ ( n4 = X1
& n3 = X0 )
& ~ ( n5 = X0
& n2 = X1 )
& ~ ( n4 = X0
& n2 = X1 )
& ~ ( n5 = X1
& n2 = X0 )
& ~ ( n5 = X0
& n1 = X1 )
& ~ ( n4 = X0
& n1 = X1 )
& ~ ( n5 = X0
& n0 = X1 )
& ~ ( n4 = X0
& n0 = X1 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n3)) ) ),
inference(rectify,[],[f54]) ).
fof(f156,plain,
? [X0,X1] :
( n0 != times(divide(n1,n400),a_select2(sigma,n3))
& n5 = X1
& n3 = X1
& n3 = X0
& n1 = X0
& ( n5 != X1
| n5 != X0 )
& ( n5 != X0
| n4 != X1 )
& ( n5 != X1
| n4 != X0 )
& ( n4 != X1
| n4 != X0 )
& ( n5 != X0
| n3 != X1 )
& ( n4 != X0
| n3 != X1 )
& ( n5 != X1
| n3 != X0 )
& ( n4 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n4 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n4 != X0
| n1 != X1 )
& ( n5 != X0
| n0 != X1 )
& ( n4 != X0
| n0 != X1 )
& leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) ),
inference(ennf_transformation,[],[f114]) ).
fof(f157,plain,
? [X0,X1] :
( n0 != times(divide(n1,n400),a_select2(sigma,n3))
& n5 = X1
& n3 = X1
& n3 = X0
& n1 = X0
& ( n5 != X1
| n5 != X0 )
& ( n5 != X0
| n4 != X1 )
& ( n5 != X1
| n4 != X0 )
& ( n4 != X1
| n4 != X0 )
& ( n5 != X0
| n3 != X1 )
& ( n4 != X0
| n3 != X1 )
& ( n5 != X1
| n3 != X0 )
& ( n4 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n4 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n4 != X0
| n1 != X1 )
& ( n5 != X0
| n0 != X1 )
& ( n4 != X0
| n0 != X1 )
& leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) ),
inference(flattening,[],[f156]) ).
fof(f224,plain,
( ? [X0,X1] :
( n0 != times(divide(n1,n400),a_select2(sigma,n3))
& n5 = X1
& n3 = X1
& n3 = X0
& n1 = X0
& ( n5 != X1
| n5 != X0 )
& ( n5 != X0
| n4 != X1 )
& ( n5 != X1
| n4 != X0 )
& ( n4 != X1
| n4 != X0 )
& ( n5 != X0
| n3 != X1 )
& ( n4 != X0
| n3 != X1 )
& ( n5 != X1
| n3 != X0 )
& ( n4 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n4 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n4 != X0
| n1 != X1 )
& ( n5 != X0
| n0 != X1 )
& ( n4 != X0
| n0 != X1 )
& leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) )
=> ( n0 != times(divide(n1,n400),a_select2(sigma,n3))
& n5 = sK32
& n3 = sK32
& n3 = sK31
& n1 = sK31
& ( n5 != sK32
| n5 != sK31 )
& ( n5 != sK31
| n4 != sK32 )
& ( n5 != sK32
| n4 != sK31 )
& ( n4 != sK32
| n4 != sK31 )
& ( n5 != sK31
| n3 != sK32 )
& ( n4 != sK31
| n3 != sK32 )
& ( n5 != sK32
| n3 != sK31 )
& ( n4 != sK32
| n3 != sK31 )
& ( n5 != sK31
| n2 != sK32 )
& ( n4 != sK31
| n2 != sK32 )
& ( n5 != sK32
| n2 != sK31 )
& ( n5 != sK31
| n1 != sK32 )
& ( n4 != sK31
| n1 != sK32 )
& ( n5 != sK31
| n0 != sK32 )
& ( n4 != sK31
| n0 != sK32 )
& leq(sK32,n5)
& leq(sK31,n5)
& leq(n0,sK32)
& leq(n0,sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f225,plain,
( n0 != times(divide(n1,n400),a_select2(sigma,n3))
& n5 = sK32
& n3 = sK32
& n3 = sK31
& n1 = sK31
& ( n5 != sK32
| n5 != sK31 )
& ( n5 != sK31
| n4 != sK32 )
& ( n5 != sK32
| n4 != sK31 )
& ( n4 != sK32
| n4 != sK31 )
& ( n5 != sK31
| n3 != sK32 )
& ( n4 != sK31
| n3 != sK32 )
& ( n5 != sK32
| n3 != sK31 )
& ( n4 != sK32
| n3 != sK31 )
& ( n5 != sK31
| n2 != sK32 )
& ( n4 != sK31
| n2 != sK32 )
& ( n5 != sK32
| n2 != sK31 )
& ( n5 != sK31
| n1 != sK32 )
& ( n4 != sK31
| n1 != sK32 )
& ( n5 != sK31
| n0 != sK32 )
& ( n4 != sK31
| n0 != sK32 )
& leq(sK32,n5)
& leq(sK31,n5)
& leq(n0,sK32)
& leq(n0,sK31) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31,sK32])],[f157,f224]) ).
fof(f356,plain,
n3 = sK31,
inference(cnf_transformation,[],[f225]) ).
fof(f357,plain,
n3 = sK32,
inference(cnf_transformation,[],[f225]) ).
fof(f423,plain,
sK31 = sK32,
inference(definition_unfolding,[],[f356,f357]) ).
cnf(c_158,negated_conjecture,
sK31 = sK32,
inference(cnf_transformation,[],[f423]) ).
cnf(c_170,negated_conjecture,
sK31 != sK32,
inference(cnf_transformation,[],[f475]) ).
cnf(c_219,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_170,c_158]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV220+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 04:29:49 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.01/1.15 % SZS status Started for theBenchmark.p
% 1.01/1.15 % SZS status Theorem for theBenchmark.p
% 1.01/1.15
% 1.01/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.01/1.15
% 1.01/1.15 ------ iProver source info
% 1.01/1.15
% 1.01/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.01/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.01/1.15 git: non_committed_changes: false
% 1.01/1.15 git: last_make_outside_of_git: false
% 1.01/1.15
% 1.01/1.15 ------ Parsing...
% 1.01/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.01/1.15
% 1.01/1.15 ------ Preprocessing...
% 1.01/1.15
% 1.01/1.15 % SZS status Theorem for theBenchmark.p
% 1.01/1.15
% 1.01/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.01/1.15
% 1.01/1.15
%------------------------------------------------------------------------------