TSTP Solution File: SYN966+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n014.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:46:13 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 4 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 121 ( 42 ~; 46 |; 21 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 61 ( 50 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f105,plain,
$false,
inference(subsumption_resolution,[],[f103,f13]) ).
fof(f13,plain,
~ eq(sK0,sK1),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( eq(sK1,sK0)
& ~ eq(sK0,sK1)
& ! [X2,X3] :
( ( eq(X2,X3)
| ( ( ~ a_member_of(sK2(X2,X3),X3)
| ~ a_member_of(sK2(X2,X3),X2) )
& ( a_member_of(sK2(X2,X3),X3)
| a_member_of(sK2(X2,X3),X2) ) ) )
& ( ! [X5] :
( ( a_member_of(X5,X2)
| ~ a_member_of(X5,X3) )
& ( a_member_of(X5,X3)
| ~ a_member_of(X5,X2) ) )
| ~ eq(X2,X3) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f7,f6]) ).
fof(f6,plain,
( ? [X0,X1] :
( eq(X1,X0)
& ~ eq(X0,X1) )
=> ( eq(sK1,sK0)
& ~ eq(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
! [X2,X3] :
( ? [X4] :
( ( ~ a_member_of(X4,X3)
| ~ a_member_of(X4,X2) )
& ( a_member_of(X4,X3)
| a_member_of(X4,X2) ) )
=> ( ( ~ a_member_of(sK2(X2,X3),X3)
| ~ a_member_of(sK2(X2,X3),X2) )
& ( a_member_of(sK2(X2,X3),X3)
| a_member_of(sK2(X2,X3),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ? [X0,X1] :
( eq(X1,X0)
& ~ eq(X0,X1) )
& ! [X2,X3] :
( ( eq(X2,X3)
| ? [X4] :
( ( ~ a_member_of(X4,X3)
| ~ a_member_of(X4,X2) )
& ( a_member_of(X4,X3)
| a_member_of(X4,X2) ) ) )
& ( ! [X5] :
( ( a_member_of(X5,X2)
| ~ a_member_of(X5,X3) )
& ( a_member_of(X5,X3)
| ~ a_member_of(X5,X2) ) )
| ~ eq(X2,X3) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
( ? [X4,X3] :
( eq(X3,X4)
& ~ eq(X4,X3) )
& ! [X0,X1] :
( ( 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) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,plain,
( ? [X4,X3] :
( eq(X3,X4)
& ~ eq(X4,X3) )
& ! [X0,X1] :
( eq(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X0)
<=> a_member_of(X2,X1) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0,X1] :
( eq(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X0)
<=> a_member_of(X2,X1) ) )
=> ! [X3,X4] :
( eq(X3,X4)
=> eq(X4,X3) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0,X1] :
( eq(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X0)
<=> a_member_of(X2,X1) ) )
=> ! [X3,X4] :
( eq(X3,X4)
=> eq(X4,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f103,plain,
eq(sK0,sK1),
inference(resolution,[],[f77,f14]) ).
fof(f14,plain,
eq(sK1,sK0),
inference(cnf_transformation,[],[f8]) ).
fof(f77,plain,
! [X0,X1] :
( ~ eq(X0,X1)
| eq(X1,X0) ),
inference(subsumption_resolution,[],[f76,f48]) ).
fof(f48,plain,
! [X0,X1] :
( a_member_of(sK2(X0,X1),X0)
| ~ eq(X1,X0)
| eq(X0,X1) ),
inference(factoring,[],[f16]) ).
fof(f16,plain,
! [X3,X4,X5] :
( a_member_of(sK2(X3,X4),X5)
| a_member_of(sK2(X3,X4),X3)
| eq(X3,X4)
| ~ eq(X4,X5) ),
inference(resolution,[],[f11,f9]) ).
fof(f9,plain,
! [X2,X3,X5] :
( ~ a_member_of(X5,X2)
| ~ eq(X2,X3)
| a_member_of(X5,X3) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
! [X2,X3] :
( a_member_of(sK2(X2,X3),X3)
| a_member_of(sK2(X2,X3),X2)
| eq(X2,X3) ),
inference(cnf_transformation,[],[f8]) ).
fof(f76,plain,
! [X0,X1] :
( ~ eq(X0,X1)
| ~ a_member_of(sK2(X1,X0),X1)
| eq(X1,X0) ),
inference(duplicate_literal_removal,[],[f73]) ).
fof(f73,plain,
! [X0,X1] :
( eq(X1,X0)
| ~ a_member_of(sK2(X1,X0),X1)
| ~ eq(X0,X1)
| eq(X1,X0) ),
inference(resolution,[],[f61,f12]) ).
fof(f12,plain,
! [X2,X3] :
( ~ a_member_of(sK2(X2,X3),X3)
| eq(X2,X3)
| ~ a_member_of(sK2(X2,X3),X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f61,plain,
! [X0,X1] :
( a_member_of(sK2(X0,X1),X1)
| ~ eq(X1,X0)
| eq(X0,X1) ),
inference(factoring,[],[f17]) ).
fof(f17,plain,
! [X2,X0,X1] :
( a_member_of(sK2(X0,X1),X2)
| a_member_of(sK2(X0,X1),X1)
| ~ eq(X2,X0)
| eq(X0,X1) ),
inference(resolution,[],[f11,f10]) ).
fof(f10,plain,
! [X2,X3,X5] :
( ~ a_member_of(X5,X3)
| ~ eq(X2,X3)
| a_member_of(X5,X2) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN966+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 22:33:48 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.47 % (12188)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 (3000ds/467Mi)
% 0.19/0.47 % (12172)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.19/0.47 % (12172)First to succeed.
% 0.19/0.48 % (12172)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (12172)------------------------------
% 0.19/0.48 % (12172)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (12172)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (12172)Termination reason: Refutation
% 0.19/0.48
% 0.19/0.48 % (12172)Memory used [KB]: 5373
% 0.19/0.48 % (12172)Time elapsed: 0.081 s
% 0.19/0.48 % (12172)Instructions burned: 6 (million)
% 0.19/0.48 % (12172)------------------------------
% 0.19/0.48 % (12172)------------------------------
% 0.19/0.48 % (12164)Success in time 0.135 s
%------------------------------------------------------------------------------