TSTP Solution File: SET585+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET585+3 : 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 : n024.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:24:59 EDT 2022
% Result : Theorem 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 99 ( 39 ~; 31 |; 20 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 72 ( 63 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f83,plain,
$false,
inference(subsumption_resolution,[],[f80,f77]) ).
fof(f77,plain,
~ member(sK1(union(sK4,sK2),intersection(sK4,sK3)),sK4),
inference(resolution,[],[f51,f71]) ).
fof(f71,plain,
~ member(sK1(union(sK4,sK2),intersection(sK4,sK3)),union(sK4,sK2)),
inference(resolution,[],[f48,f56]) ).
fof(f56,plain,
~ subset(intersection(sK4,sK3),union(sK4,sK2)),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
~ subset(intersection(sK4,sK3),union(sK4,sK2)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f19,f37]) ).
fof(f37,plain,
( ? [X0,X1,X2] : ~ subset(intersection(X2,X1),union(X2,X0))
=> ~ subset(intersection(sK4,sK3),union(sK4,sK2)) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
? [X0,X1,X2] : ~ subset(intersection(X2,X1),union(X2,X0)),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
~ ! [X2,X1,X0] : subset(intersection(X2,X1),union(X2,X0)),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X2,X1,X0] : subset(intersection(X0,X1),union(X0,X2)),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X2,X1,X0] : subset(intersection(X0,X1),union(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_subset_of_union) ).
fof(f48,plain,
! [X0,X1] :
( subset(X1,X0)
| ~ member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ( ~ member(sK1(X0,X1),X0)
& member(sK1(X0,X1),X1) ) )
& ( ! [X3] :
( member(X3,X0)
| ~ member(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f28,f29]) ).
fof(f29,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) )
=> ( ~ member(sK1(X0,X1),X0)
& member(sK1(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) ) )
& ( ! [X3] :
( member(X3,X0)
| ~ member(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f27]) ).
fof(f27,plain,
! [X1,X0] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f51,plain,
! [X2,X0,X1] :
( member(X1,union(X2,X0))
| ~ member(X1,X2) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( member(X1,union(X2,X0))
| ( ~ member(X1,X2)
& ~ member(X1,X0) ) )
& ( member(X1,X2)
| member(X1,X0)
| ~ member(X1,union(X2,X0)) ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X1)
& ~ member(X0,X2) ) )
& ( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X1,X2)) ) ),
inference(flattening,[],[f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X1)
& ~ member(X0,X2) ) )
& ( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
<=> ( member(X0,X1)
| member(X0,X2) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X0,X1] :
( ( member(X2,X1)
| member(X2,X0) )
<=> member(X2,union(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f80,plain,
member(sK1(union(sK4,sK2),intersection(sK4,sK3)),sK4),
inference(resolution,[],[f54,f70]) ).
fof(f70,plain,
member(sK1(union(sK4,sK2),intersection(sK4,sK3)),intersection(sK4,sK3)),
inference(resolution,[],[f47,f56]) ).
fof(f47,plain,
! [X0,X1] :
( subset(X1,X0)
| member(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f54,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X1,X0))
| member(X2,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X1,X0)) )
& ( member(X2,intersection(X1,X0))
| ~ member(X2,X0)
| ~ member(X2,X1) ) ),
inference(flattening,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X1,X0)) )
& ( member(X2,intersection(X1,X0))
| ~ member(X2,X0)
| ~ member(X2,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( member(X2,X0)
& member(X2,X1) )
<=> member(X2,intersection(X1,X0)) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0,X2] :
( ( member(X2,X0)
& member(X2,X1) )
<=> member(X2,intersection(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET585+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/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.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 14:05:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.51 % (2150)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.51 TRYING [1]
% 0.19/0.51 TRYING [2]
% 0.19/0.51 TRYING [3]
% 0.19/0.51 % (2151)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.52 % (2158)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.52 TRYING [4]
% 0.19/0.52 % (2166)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.52 % (2166)First to succeed.
% 0.19/0.53 % (2168)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.53 % (2167)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 (2999ds/467Mi)
% 0.19/0.53 % (2166)Refutation found. Thanks to Tanya!
% 0.19/0.53 % SZS status Theorem for theBenchmark
% 0.19/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (2166)------------------------------
% 0.19/0.53 % (2166)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (2166)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (2166)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (2166)Memory used [KB]: 895
% 0.19/0.53 % (2166)Time elapsed: 0.115 s
% 0.19/0.53 % (2166)Instructions burned: 2 (million)
% 0.19/0.53 % (2166)------------------------------
% 0.19/0.53 % (2166)------------------------------
% 0.19/0.53 % (2143)Success in time 0.174 s
%------------------------------------------------------------------------------