TSTP Solution File: SET688+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET688+4 : TPTP v8.1.0. Released v2.2.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 : n011.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:25:21 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 11 unt; 0 def)
% Number of atoms : 123 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 139 ( 54 ~; 26 |; 47 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 50 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f153,plain,
$false,
inference(subsumption_resolution,[],[f152,f147]) ).
fof(f147,plain,
~ member(sK0(sK3,sK4),sK4),
inference(resolution,[],[f143,f63]) ).
fof(f63,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f31,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [X1,X0] :
( ( subset(X1,X0)
| ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) ) )
& ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( member(X2,X1)
=> member(X2,X0) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f143,plain,
~ subset(sK3,sK4),
inference(subsumption_resolution,[],[f139,f80]) ).
fof(f80,plain,
subset(sK4,sK3),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
( subset(sK4,sK3)
& subset(sK2,sK4)
& ~ equal_set(sK4,sK3)
& ~ equal_set(sK2,sK4)
& equal_set(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f44,f45]) ).
fof(f45,plain,
( ? [X0,X1,X2] :
( subset(X2,X1)
& subset(X0,X2)
& ~ equal_set(X2,X1)
& ~ equal_set(X0,X2)
& equal_set(X0,X1) )
=> ( subset(sK4,sK3)
& subset(sK2,sK4)
& ~ equal_set(sK4,sK3)
& ~ equal_set(sK2,sK4)
& equal_set(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f44,plain,
? [X0,X1,X2] :
( subset(X2,X1)
& subset(X0,X2)
& ~ equal_set(X2,X1)
& ~ equal_set(X0,X2)
& equal_set(X0,X1) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
? [X2,X0,X1] :
( subset(X1,X0)
& subset(X2,X1)
& ~ equal_set(X1,X0)
& ~ equal_set(X2,X1)
& equal_set(X2,X0) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
? [X0,X1,X2] :
( equal_set(X2,X0)
& subset(X2,X1)
& ~ equal_set(X1,X0)
& subset(X1,X0)
& ~ equal_set(X2,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
~ ! [X0,X1,X2] :
( ( subset(X2,X1)
& ~ equal_set(X1,X0)
& subset(X1,X0)
& ~ equal_set(X2,X1) )
=> ~ equal_set(X2,X0) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X5,X1,X0] :
( ( subset(X1,X5)
& subset(X0,X1)
& ~ equal_set(X0,X1)
& ~ equal_set(X1,X5) )
=> ~ equal_set(X0,X5) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X5,X1,X0] :
( ( subset(X1,X5)
& subset(X0,X1)
& ~ equal_set(X0,X1)
& ~ equal_set(X1,X5) )
=> ~ equal_set(X0,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI04) ).
fof(f139,plain,
( ~ subset(sK4,sK3)
| ~ subset(sK3,sK4) ),
inference(resolution,[],[f91,f78]) ).
fof(f78,plain,
~ equal_set(sK4,sK3),
inference(cnf_transformation,[],[f46]) ).
fof(f91,plain,
! [X0,X1] :
( equal_set(X1,X0)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0,X1] :
( ( equal_set(X1,X0)
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X1,X0) ) ),
inference(flattening,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( ( equal_set(X1,X0)
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X1,X0) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( equal_set(X1,X0)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
<=> equal_set(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f152,plain,
member(sK0(sK3,sK4),sK4),
inference(resolution,[],[f151,f111]) ).
fof(f111,plain,
! [X9] :
( ~ member(X9,sK2)
| member(X9,sK4) ),
inference(resolution,[],[f61,f79]) ).
fof(f79,plain,
subset(sK2,sK4),
inference(cnf_transformation,[],[f46]) ).
fof(f61,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| member(X3,X1)
| ~ member(X3,X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f151,plain,
member(sK0(sK3,sK4),sK2),
inference(resolution,[],[f148,f113]) ).
fof(f113,plain,
! [X11] :
( ~ member(X11,sK3)
| member(X11,sK2) ),
inference(resolution,[],[f61,f99]) ).
fof(f99,plain,
subset(sK3,sK2),
inference(resolution,[],[f90,f76]) ).
fof(f76,plain,
equal_set(sK2,sK3),
inference(cnf_transformation,[],[f46]) ).
fof(f90,plain,
! [X0,X1] :
( ~ equal_set(X1,X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f148,plain,
member(sK0(sK3,sK4),sK3),
inference(resolution,[],[f143,f62]) ).
fof(f62,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET688+4 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.13 % 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.33 % Computer : n011.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Aug 30 14:11:40 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.19/0.49 % (13410)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.19/0.49 % (13402)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.49 % (13389)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.19/0.50 % (13394)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.19/0.50 % (13404)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.50 % (13410)First to succeed.
% 0.19/0.50 TRYING [1]
% 0.19/0.50 TRYING [2]
% 0.19/0.50 % (13396)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.19/0.50 % (13396)Instruction limit reached!
% 0.19/0.50 % (13396)------------------------------
% 0.19/0.50 % (13396)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (13396)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (13396)Termination reason: Unknown
% 0.19/0.50 % (13396)Termination phase: Saturation
% 0.19/0.50
% 0.19/0.50 % (13396)Memory used [KB]: 5373
% 0.19/0.50 % (13396)Time elapsed: 0.002 s
% 0.19/0.50 % (13396)Instructions burned: 3 (million)
% 0.19/0.50 % (13396)------------------------------
% 0.19/0.50 % (13396)------------------------------
% 0.19/0.50 % (13410)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 % (13410)------------------------------
% 0.19/0.50 % (13410)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (13410)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (13410)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (13410)Memory used [KB]: 1023
% 0.19/0.50 % (13410)Time elapsed: 0.058 s
% 0.19/0.50 % (13410)Instructions burned: 5 (million)
% 0.19/0.50 % (13410)------------------------------
% 0.19/0.50 % (13410)------------------------------
% 0.19/0.50 % (13387)Success in time 0.162 s
%------------------------------------------------------------------------------