TSTP Solution File: SET046+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET046+1 : TPTP v8.1.0. Released v2.0.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 : n016.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:18:45 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 2 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 74 ( 29 ~; 24 |; 15 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 37 ( 22 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f18,plain,
$false,
inference(subsumption_resolution,[],[f17,f10]) ).
fof(f10,plain,
! [X3,X1] :
( ~ element(X1,X3)
| ~ element(X3,X1)
| ~ element(X1,sK0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1] :
( ( element(X1,sK0)
| ( element(X1,sK1(X1))
& element(sK1(X1),X1) ) )
& ( ! [X3] :
( ~ element(X1,X3)
| ~ element(X3,X1) )
| ~ element(X1,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0] :
! [X1] :
( ( element(X1,X0)
| ? [X2] :
( element(X1,X2)
& element(X2,X1) ) )
& ( ! [X3] :
( ~ element(X1,X3)
| ~ element(X3,X1) )
| ~ element(X1,X0) ) )
=> ! [X1] :
( ( element(X1,sK0)
| ? [X2] :
( element(X1,X2)
& element(X2,X1) ) )
& ( ! [X3] :
( ~ element(X1,X3)
| ~ element(X3,X1) )
| ~ element(X1,sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X1] :
( ? [X2] :
( element(X1,X2)
& element(X2,X1) )
=> ( element(X1,sK1(X1))
& element(sK1(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0] :
! [X1] :
( ( element(X1,X0)
| ? [X2] :
( element(X1,X2)
& element(X2,X1) ) )
& ( ! [X3] :
( ~ element(X1,X3)
| ~ element(X3,X1) )
| ~ element(X1,X0) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
? [X0] :
! [X1] :
( ( element(X1,X0)
| ? [X2] :
( element(X1,X2)
& element(X2,X1) ) )
& ( ! [X2] :
( ~ element(X1,X2)
| ~ element(X2,X1) )
| ~ element(X1,X0) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
? [X0] :
! [X1] :
( element(X1,X0)
<=> ! [X2] :
( ~ element(X1,X2)
| ~ element(X2,X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
? [X0] :
! [X1] :
( element(X1,X0)
<=> ~ ? [X2] :
( element(X2,X1)
& element(X1,X2) ) ),
inference(flattening,[],[f2]) ).
fof(f2,negated_conjecture,
~ ~ ? [X0] :
! [X1] :
( element(X1,X0)
<=> ~ ? [X2] :
( element(X2,X1)
& element(X1,X2) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
~ ? [X0] :
! [X1] :
( element(X1,X0)
<=> ~ ? [X2] :
( element(X2,X1)
& element(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel42) ).
fof(f17,plain,
element(sK0,sK0),
inference(duplicate_literal_removal,[],[f16]) ).
fof(f16,plain,
( element(sK0,sK0)
| element(sK0,sK0) ),
inference(resolution,[],[f15,f11]) ).
fof(f11,plain,
! [X1] :
( element(sK1(X1),X1)
| element(X1,sK0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X0] :
( ~ element(sK1(X0),sK0)
| element(X0,sK0) ),
inference(subsumption_resolution,[],[f13,f12]) ).
fof(f12,plain,
! [X1] :
( element(X1,sK1(X1))
| element(X1,sK0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
! [X0] :
( ~ element(X0,sK1(X0))
| ~ element(sK1(X0),sK0)
| element(X0,sK0) ),
inference(resolution,[],[f10,f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET046+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.33 % Computer : n016.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 13:25:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48 % (13062)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.19/0.49 % (13082)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.49 % (13077)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.49 % (13074)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.50 % (13067)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.19/0.50 % (13067)First to succeed.
% 0.19/0.50 % (13082)Also succeeded, but the first one will report.
% 0.19/0.50 % (13085)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.50 % (13067)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (13067)------------------------------
% 0.19/0.50 % (13067)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (13067)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (13067)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (13067)Memory used [KB]: 1407
% 0.19/0.50 % (13067)Time elapsed: 0.106 s
% 0.19/0.50 % (13067)------------------------------
% 0.19/0.50 % (13067)------------------------------
% 0.19/0.50 % (13061)Success in time 0.157 s
%------------------------------------------------------------------------------