TSTP Solution File: SWV232+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV232+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n009.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 : Wed Aug 31 18:55:53 EDT 2022
% Result : Theorem 0.16s 0.50s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 248 ( 183 equ)
% Maximal formula atoms : 46 ( 19 avg)
% Number of connectives : 367 ( 132 ~; 59 |; 163 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 13 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 28 ( 20 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f413,plain,
$false,
inference(subsumption_resolution,[],[f311,f412]) ).
fof(f412,plain,
n2 != sK18,
inference(subsumption_resolution,[],[f309,f315]) ).
fof(f315,plain,
n0 = sK17,
inference(cnf_transformation,[],[f207]) ).
fof(f207,plain,
( leq(n0,sK18)
& n0 != a_select2(rho,n1)
& ( n2 != sK18
| n1 != sK17 )
& leq(sK18,n2)
& n0 = sK17
& ( n1 != sK17
| n0 != sK18 )
& leq(n0,sK17)
& ( n1 != sK18
| n1 != sK17 )
& n2 = sK18
& n1 = sK18
& ( n2 != sK18
| n0 != sK17 )
& leq(sK17,n2)
& ( n1 != sK18
| n2 != sK17 )
& ( n0 != sK18
| n2 != sK17 )
& ( n2 != sK18
| n2 != sK17 )
& n1 = sK17
& ! [X2,X3] :
( ~ leq(X2,n5)
| ~ leq(X3,n5)
| a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2)
| ~ leq(n0,X3)
| ~ leq(n0,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK17,sK18])],[f205,f206]) ).
fof(f206,plain,
( ? [X0,X1] :
( leq(n0,X1)
& n0 != a_select2(rho,n1)
& ( n2 != X1
| n1 != X0 )
& leq(X1,n2)
& n0 = X0
& ( n1 != X0
| n0 != X1 )
& leq(n0,X0)
& ( n1 != X1
| n1 != X0 )
& n2 = X1
& n1 = X1
& ( n2 != X1
| n0 != X0 )
& leq(X0,n2)
& ( n1 != X1
| n2 != X0 )
& ( n0 != X1
| n2 != X0 )
& ( n2 != X1
| n2 != X0 )
& n1 = X0 )
=> ( leq(n0,sK18)
& n0 != a_select2(rho,n1)
& ( n2 != sK18
| n1 != sK17 )
& leq(sK18,n2)
& n0 = sK17
& ( n1 != sK17
| n0 != sK18 )
& leq(n0,sK17)
& ( n1 != sK18
| n1 != sK17 )
& n2 = sK18
& n1 = sK18
& ( n2 != sK18
| n0 != sK17 )
& leq(sK17,n2)
& ( n1 != sK18
| n2 != sK17 )
& ( n0 != sK18
| n2 != sK17 )
& ( n2 != sK18
| n2 != sK17 )
& n1 = sK17 ) ),
introduced(choice_axiom,[]) ).
fof(f205,plain,
( ? [X0,X1] :
( leq(n0,X1)
& n0 != a_select2(rho,n1)
& ( n2 != X1
| n1 != X0 )
& leq(X1,n2)
& n0 = X0
& ( n1 != X0
| n0 != X1 )
& leq(n0,X0)
& ( n1 != X1
| n1 != X0 )
& n2 = X1
& n1 = X1
& ( n2 != X1
| n0 != X0 )
& leq(X0,n2)
& ( n1 != X1
| n2 != X0 )
& ( n0 != X1
| n2 != X0 )
& ( n2 != X1
| n2 != X0 )
& n1 = X0 )
& ! [X2,X3] :
( ~ leq(X2,n5)
| ~ leq(X3,n5)
| a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2)
| ~ leq(n0,X3)
| ~ leq(n0,X2) ) ),
inference(rectify,[],[f139]) ).
fof(f139,plain,
( ? [X2,X3] :
( leq(n0,X3)
& n0 != a_select2(rho,n1)
& ( n2 != X3
| n1 != X2 )
& leq(X3,n2)
& n0 = X2
& ( n1 != X2
| n0 != X3 )
& leq(n0,X2)
& ( n1 != X3
| n1 != X2 )
& n2 = X3
& n1 = X3
& ( n2 != X3
| n0 != X2 )
& leq(X2,n2)
& ( n1 != X3
| n2 != X2 )
& ( n0 != X3
| n2 != X2 )
& ( n2 != X3
| n2 != X2 )
& n1 = X2 )
& ! [X0,X1] :
( ~ leq(X0,n5)
| ~ leq(X1,n5)
| a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0)
| ~ leq(n0,X1)
| ~ leq(n0,X0) ) ),
inference(flattening,[],[f138]) ).
fof(f138,plain,
( ? [X2,X3] :
( n0 != a_select2(rho,n1)
& ( n0 != X3
| n2 != X2 )
& ( n2 != X3
| n2 != X2 )
& ( n1 != X3
| n1 != X2 )
& ( n2 != X3
| n1 != X2 )
& ( n1 != X3
| n2 != X2 )
& n1 = X3
& ( n1 != X2
| n0 != X3 )
& n0 = X2
& n2 = X3
& n1 = X2
& ( n2 != X3
| n0 != X2 )
& leq(n0,X2)
& leq(X2,n2)
& leq(n0,X3)
& leq(X3,n2) )
& ! [X0,X1] :
( a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0)
| ~ leq(X0,n5)
| ~ leq(X1,n5)
| ~ leq(n0,X0)
| ~ leq(n0,X1) ) ),
inference(ennf_transformation,[],[f112]) ).
fof(f112,plain,
~ ( ! [X0,X1] :
( ( leq(X0,n5)
& leq(X1,n5)
& leq(n0,X0)
& leq(n0,X1) )
=> a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) )
=> ! [X2,X3] :
( ( leq(n0,X2)
& leq(X2,n2)
& leq(n0,X3)
& leq(X3,n2) )
=> ( ( ~ ( n0 = X3
& n2 = X2 )
& ~ ( n2 = X2
& n2 = X3 )
& ~ ( n1 = X3
& n1 = X2 )
& ~ ( n2 = X3
& n1 = X2 )
& ~ ( n2 = X2
& n1 = X3 )
& n1 = X3
& ~ ( n1 = X2
& n0 = X3 )
& n0 = X2
& n2 = X3
& n1 = X2
& ~ ( n0 = X2
& n2 = X3 ) )
=> n0 = a_select2(rho,n1) ) ) ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ! [X17,X13] :
( ( leq(n0,X13)
& leq(X17,n5)
& leq(X13,n5)
& leq(n0,X17) )
=> a_select3(q_ds1_filter,X13,X17) = a_select3(q_ds1_filter,X17,X13) )
=> ! [X19,X3] :
( ( leq(n0,X3)
& leq(X19,n2)
& leq(X3,n2)
& leq(n0,X19) )
=> ( ( n0 = X19
& n1 = X19
& ~ ( n2 = X3
& n0 = X19 )
& n1 = X3
& ~ ( n1 = X3
& n2 = X19 )
& ~ ( n1 = X3
& n1 = X19 )
& ~ ( n2 = X19
& n2 = X3 )
& ~ ( n0 = X3
& n2 = X19 )
& ~ ( n1 = X19
& n0 = X3 )
& n2 = X3
& ~ ( n1 = X19
& n2 = X3 ) )
=> n0 = a_select2(rho,n1) ) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ! [X17,X13] :
( ( leq(n0,X13)
& leq(X17,n5)
& leq(X13,n5)
& leq(n0,X17) )
=> a_select3(q_ds1_filter,X13,X17) = a_select3(q_ds1_filter,X17,X13) )
=> ! [X19,X3] :
( ( leq(n0,X3)
& leq(X19,n2)
& leq(X3,n2)
& leq(n0,X19) )
=> ( ( n0 = X19
& n1 = X19
& ~ ( n2 = X3
& n0 = X19 )
& n1 = X3
& ~ ( n1 = X3
& n2 = X19 )
& ~ ( n1 = X3
& n1 = X19 )
& ~ ( n2 = X19
& n2 = X3 )
& ~ ( n0 = X3
& n2 = X19 )
& ~ ( n1 = X19
& n0 = X3 )
& n2 = X3
& ~ ( n1 = X19
& n2 = X3 ) )
=> n0 = a_select2(rho,n1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0841) ).
fof(f309,plain,
( n0 != sK17
| n2 != sK18 ),
inference(cnf_transformation,[],[f207]) ).
fof(f311,plain,
n2 = sK18,
inference(cnf_transformation,[],[f207]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV232+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.00/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.31 % Computer : n009.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 30 19:05:20 EDT 2022
% 0.16/0.31 % CPUTime :
% 0.16/0.46 % (19686)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.16/0.48 % (19695)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.16/0.48 % (19703)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.16/0.49 % (19691)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.16/0.49 % (19681)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.16/0.50 % (19687)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.16/0.50 % (19688)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.50 % (19688)Instruction limit reached!
% 0.16/0.50 % (19688)------------------------------
% 0.16/0.50 % (19688)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.50 % (19688)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.50 % (19688)Termination reason: Unknown
% 0.16/0.50 % (19688)Termination phase: Unused predicate definition removal
% 0.16/0.50
% 0.16/0.50 % (19688)Memory used [KB]: 1023
% 0.16/0.50 % (19688)Time elapsed: 0.003 s
% 0.16/0.50 % (19688)Instructions burned: 2 (million)
% 0.16/0.50 % (19688)------------------------------
% 0.16/0.50 % (19688)------------------------------
% 0.16/0.50 % (19695)First to succeed.
% 0.16/0.50 % (19685)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.16/0.50 % (19703)Also succeeded, but the first one will report.
% 0.16/0.50 % (19702)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.16/0.50 % (19697)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.16/0.50 % (19692)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.16/0.50 % (19695)Refutation found. Thanks to Tanya!
% 0.16/0.50 % SZS status Theorem for theBenchmark
% 0.16/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.50 % (19695)------------------------------
% 0.16/0.50 % (19695)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.50 % (19695)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.50 % (19695)Termination reason: Refutation
% 0.16/0.50
% 0.16/0.50 % (19695)Memory used [KB]: 1279
% 0.16/0.50 % (19695)Time elapsed: 0.016 s
% 0.16/0.50 % (19695)Instructions burned: 9 (million)
% 0.16/0.50 % (19695)------------------------------
% 0.16/0.50 % (19695)------------------------------
% 0.16/0.50 % (19679)Success in time 0.187 s
%------------------------------------------------------------------------------