TSTP Solution File: SYN966+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN966+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 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 : Wed Aug 31 19:36:13 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 114 ( 38 ~; 39 |; 21 &)
% ( 8 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 56 ( 45 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f57,plain,
$false,
inference(unit_resulting_resolution,[],[f10,f45,f45,f25]) ).
fof(f25,plain,
! [X3] :
( ~ a_member_of(sK0(X3,sK2),sK1)
| ~ a_member_of(sK0(X3,sK2),X3)
| eq(sK2,X3) ),
inference(resolution,[],[f15,f16]) ).
fof(f16,plain,
! [X0] :
( a_member_of(X0,sK2)
| ~ a_member_of(X0,sK1) ),
inference(resolution,[],[f12,f11]) ).
fof(f11,plain,
eq(sK1,sK2),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ! [X0,X1] :
( ( eq(X1,X0)
| ( ( ~ a_member_of(sK0(X0,X1),X0)
| ~ a_member_of(sK0(X0,X1),X1) )
& ( a_member_of(sK0(X0,X1),X0)
| a_member_of(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( a_member_of(X3,X1)
| ~ a_member_of(X3,X0) )
& ( a_member_of(X3,X0)
| ~ a_member_of(X3,X1) ) )
| ~ eq(X1,X0) ) )
& eq(sK1,sK2)
& ~ eq(sK2,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).
fof(f7,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ a_member_of(X2,X0)
| ~ a_member_of(X2,X1) )
& ( a_member_of(X2,X0)
| a_member_of(X2,X1) ) )
=> ( ( ~ a_member_of(sK0(X0,X1),X0)
| ~ a_member_of(sK0(X0,X1),X1) )
& ( a_member_of(sK0(X0,X1),X0)
| a_member_of(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X4,X5] :
( eq(X4,X5)
& ~ eq(X5,X4) )
=> ( eq(sK1,sK2)
& ~ eq(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ! [X0,X1] :
( ( eq(X1,X0)
| ? [X2] :
( ( ~ a_member_of(X2,X0)
| ~ a_member_of(X2,X1) )
& ( a_member_of(X2,X0)
| a_member_of(X2,X1) ) ) )
& ( ! [X3] :
( ( a_member_of(X3,X1)
| ~ a_member_of(X3,X0) )
& ( a_member_of(X3,X0)
| ~ a_member_of(X3,X1) ) )
| ~ eq(X1,X0) ) )
& ? [X4,X5] :
( eq(X4,X5)
& ~ eq(X5,X4) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ! [X1,X0] :
( ( eq(X0,X1)
| ? [X2] :
( ( ~ a_member_of(X2,X1)
| ~ a_member_of(X2,X0) )
& ( a_member_of(X2,X1)
| a_member_of(X2,X0) ) ) )
& ( ! [X2] :
( ( a_member_of(X2,X0)
| ~ a_member_of(X2,X1) )
& ( a_member_of(X2,X1)
| ~ a_member_of(X2,X0) ) )
| ~ eq(X0,X1) ) )
& ? [X4,X3] :
( eq(X4,X3)
& ~ eq(X3,X4) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ! [X1,X0] :
( eq(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X0)
<=> a_member_of(X2,X1) ) )
& ? [X4,X3] :
( eq(X4,X3)
& ~ eq(X3,X4) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ! [X1,X0] :
( eq(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X0)
<=> a_member_of(X2,X1) ) )
=> ! [X3,X4] :
( eq(X4,X3)
=> eq(X3,X4) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X1,X0] :
( eq(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X0)
<=> a_member_of(X2,X1) ) )
=> ! [X4,X3] :
( eq(X3,X4)
=> eq(X4,X3) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X1,X0] :
( eq(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X0)
<=> a_member_of(X2,X1) ) )
=> ! [X4,X3] :
( eq(X3,X4)
=> eq(X4,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X3,X0,X1] :
( ~ eq(X1,X0)
| ~ a_member_of(X3,X1)
| a_member_of(X3,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X0,X1] :
( ~ a_member_of(sK0(X0,X1),X1)
| ~ a_member_of(sK0(X0,X1),X0)
| eq(X1,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f45,plain,
a_member_of(sK0(sK1,sK2),sK1),
inference(subsumption_resolution,[],[f41,f10]) ).
fof(f41,plain,
( eq(sK2,sK1)
| a_member_of(sK0(sK1,sK2),sK1) ),
inference(factoring,[],[f28]) ).
fof(f28,plain,
! [X0] :
( a_member_of(sK0(X0,sK2),sK1)
| a_member_of(sK0(X0,sK2),X0)
| eq(sK2,X0) ),
inference(resolution,[],[f18,f11]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ eq(X2,X1)
| a_member_of(sK0(X0,X1),X2)
| a_member_of(sK0(X0,X1),X0)
| eq(X1,X0) ),
inference(resolution,[],[f14,f13]) ).
fof(f13,plain,
! [X3,X0,X1] :
( ~ a_member_of(X3,X0)
| a_member_of(X3,X1)
| ~ eq(X1,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
! [X0,X1] :
( a_member_of(sK0(X0,X1),X1)
| a_member_of(sK0(X0,X1),X0)
| eq(X1,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f10,plain,
~ eq(sK2,sK1),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN966+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 22:25:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.52 % (29022)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52 % (29037)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.52 % (29019)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52 % (29011)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (29009)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52 % (29030)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.52 % (29011)Refutation not found, incomplete strategy% (29011)------------------------------
% 0.20/0.52 % (29011)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (29011)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (29011)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52
% 0.20/0.52 % (29011)Memory used [KB]: 5884
% 0.20/0.52 % (29011)Time elapsed: 0.111 s
% 0.20/0.52 % (29011)Instructions burned: 2 (million)
% 0.20/0.52 % (29011)------------------------------
% 0.20/0.52 % (29011)------------------------------
% 0.20/0.52 % (29008)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.53 % (29034)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.53 % (29029)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.53 % (29029)First to succeed.
% 0.20/0.53 % (29013)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.53 % (29012)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.53 % (29009)Also succeeded, but the first one will report.
% 0.20/0.53 % (29029)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (29029)------------------------------
% 0.20/0.53 % (29029)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (29029)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (29029)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (29029)Memory used [KB]: 5884
% 0.20/0.53 % (29029)Time elapsed: 0.128 s
% 0.20/0.53 % (29029)Instructions burned: 3 (million)
% 0.20/0.53 % (29029)------------------------------
% 0.20/0.53 % (29029)------------------------------
% 0.20/0.53 % (29007)Success in time 0.183 s
%------------------------------------------------------------------------------