TSTP Solution File: SWV411+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV411+1 : TPTP v8.1.0. Released 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 : n029.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:56:45 EDT 2022
% Result : Theorem 1.36s 0.54s
% Output : Refutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 116 ( 30 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 129 ( 46 ~; 38 |; 29 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 129 ( 100 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f111,plain,
$false,
inference(resolution,[],[f104,f91]) ).
fof(f91,plain,
! [X3,X1,X4] : pair_in_list(insert_slb(X1,pair(X3,X4)),X3,X4),
inference(equality_resolution,[],[f90]) ).
fof(f90,plain,
! [X3,X0,X1,X4] :
( pair_in_list(insert_slb(X1,pair(X3,X4)),X3,X0)
| X0 != X4 ),
inference(equality_resolution,[],[f83]) ).
fof(f83,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X1,pair(X3,X4)),X2,X0)
| X2 != X3
| X0 != X4 ),
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X1,pair(X3,X4)),X2,X0)
| ( ( X2 != X3
| X0 != X4 )
& ~ pair_in_list(X1,X2,X0) ) )
& ( ( X2 = X3
& X0 = X4 )
| pair_in_list(X1,X2,X0)
| ~ pair_in_list(insert_slb(X1,pair(X3,X4)),X2,X0) ) ),
inference(rectify,[],[f54]) ).
fof(f54,plain,
! [X1,X0,X4,X3,X2] :
( ( pair_in_list(insert_slb(X0,pair(X3,X2)),X4,X1)
| ( ( X3 != X4
| X1 != X2 )
& ~ pair_in_list(X0,X4,X1) ) )
& ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X4,X1)
| ~ pair_in_list(insert_slb(X0,pair(X3,X2)),X4,X1) ) ),
inference(flattening,[],[f53]) ).
fof(f53,plain,
! [X1,X0,X4,X3,X2] :
( ( pair_in_list(insert_slb(X0,pair(X3,X2)),X4,X1)
| ( ( X3 != X4
| X1 != X2 )
& ~ pair_in_list(X0,X4,X1) ) )
& ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X4,X1)
| ~ pair_in_list(insert_slb(X0,pair(X3,X2)),X4,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X1,X0,X4,X3,X2] :
( pair_in_list(insert_slb(X0,pair(X3,X2)),X4,X1)
<=> ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X4,X1) ) ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X0,X4,X3,X1,X2] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
<=> ( pair_in_list(X0,X2,X4)
| ( X3 = X4
& X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax23) ).
fof(f104,plain,
! [X6] : ~ pair_in_list(insert_slb(sK0,pair(sK2,sK3)),sK2,X6),
inference(backward_demodulation,[],[f85,f97]) ).
fof(f97,plain,
sK2 = sK4,
inference(resolution,[],[f96,f84]) ).
fof(f84,plain,
contains_slb(insert_slb(sK0,pair(sK2,sK3)),sK4),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
( ! [X1] :
( pair_in_list(sK0,X1,sK1(X1))
| ~ contains_slb(sK0,X1) )
& ! [X6] : ~ pair_in_list(insert_slb(sK0,pair(sK2,sK3)),sK4,X6)
& contains_slb(insert_slb(sK0,pair(sK2,sK3)),sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f56,f59,f58,f57]) ).
fof(f57,plain,
( ? [X0] :
( ! [X1] :
( ? [X2] : pair_in_list(X0,X1,X2)
| ~ contains_slb(X0,X1) )
& ? [X3,X4,X5] :
( ! [X6] : ~ pair_in_list(insert_slb(X0,pair(X3,X4)),X5,X6)
& contains_slb(insert_slb(X0,pair(X3,X4)),X5) ) )
=> ( ! [X1] :
( ? [X2] : pair_in_list(sK0,X1,X2)
| ~ contains_slb(sK0,X1) )
& ? [X5,X4,X3] :
( ! [X6] : ~ pair_in_list(insert_slb(sK0,pair(X3,X4)),X5,X6)
& contains_slb(insert_slb(sK0,pair(X3,X4)),X5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f58,plain,
! [X1] :
( ? [X2] : pair_in_list(sK0,X1,X2)
=> pair_in_list(sK0,X1,sK1(X1)) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
( ? [X5,X4,X3] :
( ! [X6] : ~ pair_in_list(insert_slb(sK0,pair(X3,X4)),X5,X6)
& contains_slb(insert_slb(sK0,pair(X3,X4)),X5) )
=> ( ! [X6] : ~ pair_in_list(insert_slb(sK0,pair(sK2,sK3)),sK4,X6)
& contains_slb(insert_slb(sK0,pair(sK2,sK3)),sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f56,plain,
? [X0] :
( ! [X1] :
( ? [X2] : pair_in_list(X0,X1,X2)
| ~ contains_slb(X0,X1) )
& ? [X3,X4,X5] :
( ! [X6] : ~ pair_in_list(insert_slb(X0,pair(X3,X4)),X5,X6)
& contains_slb(insert_slb(X0,pair(X3,X4)),X5) ) ),
inference(rectify,[],[f36]) ).
fof(f36,plain,
? [X0] :
( ! [X1] :
( ? [X2] : pair_in_list(X0,X1,X2)
| ~ contains_slb(X0,X1) )
& ? [X5,X3,X4] :
( ! [X6] : ~ pair_in_list(insert_slb(X0,pair(X5,X3)),X4,X6)
& contains_slb(insert_slb(X0,pair(X5,X3)),X4) ) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,plain,
~ ! [X0] :
( ! [X1] :
( contains_slb(X0,X1)
=> ? [X2] : pair_in_list(X0,X1,X2) )
=> ! [X3,X4,X5] :
( contains_slb(insert_slb(X0,pair(X5,X3)),X4)
=> ? [X6] : pair_in_list(insert_slb(X0,pair(X5,X3)),X4,X6) ) ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( ! [X1] :
( contains_slb(X0,X1)
=> ? [X2] : pair_in_list(X0,X1,X2) )
=> ! [X5,X3,X4] :
( contains_slb(insert_slb(X0,pair(X4,X5)),X3)
=> ? [X6] : pair_in_list(insert_slb(X0,pair(X4,X5)),X3,X6) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X0] :
( ! [X1] :
( contains_slb(X0,X1)
=> ? [X2] : pair_in_list(X0,X1,X2) )
=> ! [X5,X3,X4] :
( contains_slb(insert_slb(X0,pair(X4,X5)),X3)
=> ? [X6] : pair_in_list(insert_slb(X0,pair(X4,X5)),X3,X6) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l47_co) ).
fof(f96,plain,
! [X3,X4] :
( ~ contains_slb(insert_slb(sK0,pair(X3,X4)),sK4)
| sK4 = X3 ),
inference(resolution,[],[f87,f94]) ).
fof(f94,plain,
~ contains_slb(sK0,sK4),
inference(resolution,[],[f93,f86]) ).
fof(f86,plain,
! [X1] :
( pair_in_list(sK0,X1,sK1(X1))
| ~ contains_slb(sK0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f93,plain,
! [X0] : ~ pair_in_list(sK0,sK4,X0),
inference(resolution,[],[f82,f85]) ).
fof(f82,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X1,pair(X3,X4)),X2,X0)
| ~ pair_in_list(X1,X2,X0) ),
inference(cnf_transformation,[],[f55]) ).
fof(f87,plain,
! [X2,X3,X0,X1] :
( contains_slb(X0,X3)
| ~ contains_slb(insert_slb(X0,pair(X1,X2)),X3)
| X1 = X3 ),
inference(cnf_transformation,[],[f63]) ).
fof(f63,plain,
! [X0,X1,X2,X3] :
( ( contains_slb(insert_slb(X0,pair(X1,X2)),X3)
| ( ~ contains_slb(X0,X3)
& X1 != X3 ) )
& ( contains_slb(X0,X3)
| X1 = X3
| ~ contains_slb(insert_slb(X0,pair(X1,X2)),X3) ) ),
inference(rectify,[],[f62]) ).
fof(f62,plain,
! [X1,X2,X3,X0] :
( ( contains_slb(insert_slb(X1,pair(X2,X3)),X0)
| ( ~ contains_slb(X1,X0)
& X0 != X2 ) )
& ( contains_slb(X1,X0)
| X0 = X2
| ~ contains_slb(insert_slb(X1,pair(X2,X3)),X0) ) ),
inference(flattening,[],[f61]) ).
fof(f61,plain,
! [X1,X2,X3,X0] :
( ( contains_slb(insert_slb(X1,pair(X2,X3)),X0)
| ( ~ contains_slb(X1,X0)
& X0 != X2 ) )
& ( contains_slb(X1,X0)
| X0 = X2
| ~ contains_slb(insert_slb(X1,pair(X2,X3)),X0) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X1,X2,X3,X0] :
( contains_slb(insert_slb(X1,pair(X2,X3)),X0)
<=> ( contains_slb(X1,X0)
| X0 = X2 ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X2,X0,X1,X3] :
( ( X1 = X2
| contains_slb(X0,X2) )
<=> contains_slb(insert_slb(X0,pair(X1,X3)),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).
fof(f85,plain,
! [X6] : ~ pair_in_list(insert_slb(sK0,pair(sK2,sK3)),sK4,X6),
inference(cnf_transformation,[],[f60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV411+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 30 19:32:57 EDT 2022
% 0.14/0.36 % CPUTime :
% 1.21/0.52 % (11232)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.21/0.52 % (11227)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.21/0.53 % (11240)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.21/0.53 TRYING [1]
% 1.21/0.53 % (11250)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.21/0.53 % (11248)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.21/0.54 TRYING [2]
% 1.21/0.54 % (11234)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)
% 1.21/0.54 % (11245)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)
% 1.36/0.54 % (11232)First to succeed.
% 1.36/0.54 % (11232)Refutation found. Thanks to Tanya!
% 1.36/0.54 % SZS status Theorem for theBenchmark
% 1.36/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 1.36/0.54 % (11232)------------------------------
% 1.36/0.54 % (11232)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.54 % (11232)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.54 % (11232)Termination reason: Refutation
% 1.36/0.54
% 1.36/0.54 % (11232)Memory used [KB]: 1023
% 1.36/0.54 % (11232)Time elapsed: 0.113 s
% 1.36/0.54 % (11232)Instructions burned: 4 (million)
% 1.36/0.54 % (11232)------------------------------
% 1.36/0.54 % (11232)------------------------------
% 1.36/0.54 % (11222)Success in time 0.176 s
% 1.36/0.54 TRYING [3]
%------------------------------------------------------------------------------