TSTP Solution File: SET797+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET797+4 : TPTP v8.1.0. Released v3.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 : n029.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:40 EDT 2022
% Result : Theorem 0.21s 0.55s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 7 unt; 0 def)
% Number of atoms : 168 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 180 ( 56 ~; 38 |; 62 &)
% ( 6 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 127 ( 93 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f217,plain,
$false,
inference(subsumption_resolution,[],[f216,f95]) ).
fof(f95,plain,
subset(sK4,sK3),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
( subset(sK4,sK2)
& ~ upper_bound(sK5,sK1,sK4)
& upper_bound(sK5,sK1,sK3)
& subset(sK4,sK3)
& subset(sK3,sK2)
& order(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f60,f63,f62,f61]) ).
fof(f61,plain,
( ? [X0,X1] :
( ? [X2,X3] :
( subset(X3,X1)
& ? [X4] :
( ~ upper_bound(X4,X0,X3)
& upper_bound(X4,X0,X2) )
& subset(X3,X2)
& subset(X2,X1) )
& order(X0,X1) )
=> ( ? [X3,X2] :
( subset(X3,sK2)
& ? [X4] :
( ~ upper_bound(X4,sK1,X3)
& upper_bound(X4,sK1,X2) )
& subset(X3,X2)
& subset(X2,sK2) )
& order(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f62,plain,
( ? [X3,X2] :
( subset(X3,sK2)
& ? [X4] :
( ~ upper_bound(X4,sK1,X3)
& upper_bound(X4,sK1,X2) )
& subset(X3,X2)
& subset(X2,sK2) )
=> ( subset(sK4,sK2)
& ? [X4] :
( ~ upper_bound(X4,sK1,sK4)
& upper_bound(X4,sK1,sK3) )
& subset(sK4,sK3)
& subset(sK3,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f63,plain,
( ? [X4] :
( ~ upper_bound(X4,sK1,sK4)
& upper_bound(X4,sK1,sK3) )
=> ( ~ upper_bound(sK5,sK1,sK4)
& upper_bound(sK5,sK1,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
? [X0,X1] :
( ? [X2,X3] :
( subset(X3,X1)
& ? [X4] :
( ~ upper_bound(X4,X0,X3)
& upper_bound(X4,X0,X2) )
& subset(X3,X2)
& subset(X2,X1) )
& order(X0,X1) ),
inference(rectify,[],[f52]) ).
fof(f52,plain,
? [X1,X0] :
( ? [X2,X3] :
( subset(X3,X0)
& ? [X4] :
( ~ upper_bound(X4,X1,X3)
& upper_bound(X4,X1,X2) )
& subset(X3,X2)
& subset(X2,X0) )
& order(X1,X0) ),
inference(flattening,[],[f51]) ).
fof(f51,plain,
? [X0,X1] :
( ? [X3,X2] :
( ? [X4] :
( ~ upper_bound(X4,X1,X3)
& upper_bound(X4,X1,X2) )
& subset(X3,X2)
& subset(X3,X0)
& subset(X2,X0) )
& order(X1,X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
~ ! [X0,X1] :
( order(X1,X0)
=> ! [X3,X2] :
( ( subset(X3,X2)
& subset(X3,X0)
& subset(X2,X0) )
=> ! [X4] :
( upper_bound(X4,X1,X2)
=> upper_bound(X4,X1,X3) ) ) ),
inference(rectify,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X3,X5] :
( order(X5,X3)
=> ! [X4,X2] :
( ( subset(X4,X3)
& subset(X2,X4)
& subset(X2,X3) )
=> ! [X7] :
( upper_bound(X7,X5,X4)
=> upper_bound(X7,X5,X2) ) ) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X3,X5] :
( order(X5,X3)
=> ! [X4,X2] :
( ( subset(X4,X3)
& subset(X2,X4)
& subset(X2,X3) )
=> ! [X7] :
( upper_bound(X7,X5,X4)
=> upper_bound(X7,X5,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV9) ).
fof(f216,plain,
~ subset(sK4,sK3),
inference(subsumption_resolution,[],[f210,f140]) ).
fof(f140,plain,
upper_bound(sK5,sK1,sK4),
inference(consistent_polarity_flipping,[],[f97]) ).
fof(f97,plain,
~ upper_bound(sK5,sK1,sK4),
inference(cnf_transformation,[],[f64]) ).
fof(f210,plain,
( ~ upper_bound(sK5,sK1,sK4)
| ~ subset(sK4,sK3) ),
inference(resolution,[],[f208,f128]) ).
fof(f128,plain,
! [X2,X0,X1] :
( ~ member(sK6(X0,X1,X2),X2)
| ~ upper_bound(X0,X1,X2) ),
inference(consistent_polarity_flipping,[],[f100]) ).
fof(f100,plain,
! [X2,X0,X1] :
( upper_bound(X0,X1,X2)
| member(sK6(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f68]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ( upper_bound(X0,X1,X2)
| ( ~ apply(X1,sK6(X0,X1,X2),X0)
& member(sK6(X0,X1,X2),X2) ) )
& ( ! [X4] :
( apply(X1,X4,X0)
| ~ member(X4,X2) )
| ~ upper_bound(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f66,f67]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ apply(X1,X3,X0)
& member(X3,X2) )
=> ( ~ apply(X1,sK6(X0,X1,X2),X0)
& member(sK6(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ( upper_bound(X0,X1,X2)
| ? [X3] :
( ~ apply(X1,X3,X0)
& member(X3,X2) ) )
& ( ! [X4] :
( apply(X1,X4,X0)
| ~ member(X4,X2) )
| ~ upper_bound(X0,X1,X2) ) ),
inference(rectify,[],[f65]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ( upper_bound(X0,X1,X2)
| ? [X3] :
( ~ apply(X1,X3,X0)
& member(X3,X2) ) )
& ( ! [X3] :
( apply(X1,X3,X0)
| ~ member(X3,X2) )
| ~ upper_bound(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f48]) ).
fof(f48,plain,
! [X0,X1,X2] :
( upper_bound(X0,X1,X2)
<=> ! [X3] :
( apply(X1,X3,X0)
| ~ member(X3,X2) ) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,plain,
! [X1,X0,X2] :
( upper_bound(X0,X1,X2)
<=> ! [X3] :
( member(X3,X2)
=> apply(X1,X3,X0) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X7,X5,X3] :
( upper_bound(X7,X5,X3)
<=> ! [X2] :
( member(X2,X3)
=> apply(X5,X2,X7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upper_bound) ).
fof(f208,plain,
! [X0] :
( member(sK6(sK5,sK1,sK4),X0)
| ~ subset(X0,sK3) ),
inference(resolution,[],[f206,f140]) ).
fof(f206,plain,
! [X0,X1] :
( ~ upper_bound(sK5,sK1,X0)
| member(sK6(sK5,sK1,X0),X1)
| ~ subset(X1,sK3) ),
inference(resolution,[],[f196,f151]) ).
fof(f151,plain,
! [X2,X0,X1] :
( ~ member(X2,X0)
| ~ subset(X1,X0)
| member(X2,X1) ),
inference(consistent_polarity_flipping,[],[f92]) ).
fof(f92,plain,
! [X2,X0,X1] :
( ~ subset(X1,X0)
| ~ member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( member(sK0(X0,X1),X1)
& ~ member(sK0(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f57,f58]) ).
fof(f58,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& ~ member(X3,X0) )
=> ( member(sK0(X0,X1),X1)
& ~ member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X3] :
( member(X3,X1)
& ~ member(X3,X0) ) ) ),
inference(rectify,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( member(X2,X1)
& ~ member(X2,X0) ) ) ),
inference(nnf_transformation,[],[f50]) ).
fof(f50,plain,
! [X0,X1] :
( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X1)
=> member(X2,X0) )
<=> subset(X1,X0) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f196,plain,
! [X0] :
( member(sK6(sK5,sK1,X0),sK3)
| ~ upper_bound(sK5,sK1,X0) ),
inference(resolution,[],[f182,f160]) ).
fof(f160,plain,
! [X2,X0,X1] :
( ~ apply(X1,sK6(X0,X1,X2),X0)
| ~ upper_bound(X0,X1,X2) ),
inference(consistent_polarity_flipping,[],[f101]) ).
fof(f101,plain,
! [X2,X0,X1] :
( ~ apply(X1,sK6(X0,X1,X2),X0)
| upper_bound(X0,X1,X2) ),
inference(cnf_transformation,[],[f68]) ).
fof(f182,plain,
! [X0] :
( apply(sK1,X0,sK5)
| member(X0,sK3) ),
inference(resolution,[],[f158,f147]) ).
fof(f147,plain,
~ upper_bound(sK5,sK1,sK3),
inference(consistent_polarity_flipping,[],[f96]) ).
fof(f96,plain,
upper_bound(sK5,sK1,sK3),
inference(cnf_transformation,[],[f64]) ).
fof(f158,plain,
! [X2,X0,X1,X4] :
( member(X4,X2)
| apply(X1,X4,X0)
| upper_bound(X0,X1,X2) ),
inference(consistent_polarity_flipping,[],[f99]) ).
fof(f99,plain,
! [X2,X0,X1,X4] :
( apply(X1,X4,X0)
| ~ upper_bound(X0,X1,X2)
| ~ member(X4,X2) ),
inference(cnf_transformation,[],[f68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET797+4 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % 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.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 14:30:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.51 % (4662)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.21/0.51 % (4646)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52 % (4654)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.21/0.52 % (4664)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.21/0.53 % (4656)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.21/0.53 % (4647)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.53 % (4661)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.53 % (4671)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.21/0.53 % (4649)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.53 % (4642)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.21/0.53 % (4661)First to succeed.
% 0.21/0.53 % (4669)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.21/0.53 % (4644)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.53 % (4648)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.21/0.53 % (4643)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.21/0.54 % (4650)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.21/0.54 % (4653)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.54 % (4652)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.54 % (4651)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.54 % (4650)Instruction limit reached!
% 0.21/0.54 % (4650)------------------------------
% 0.21/0.54 % (4650)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (4650)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (4650)Termination reason: Unknown
% 0.21/0.54 % (4650)Termination phase: Blocked clause elimination
% 0.21/0.54
% 0.21/0.54 % (4650)Memory used [KB]: 1023
% 0.21/0.54 % (4650)Time elapsed: 0.004 s
% 0.21/0.54 % (4650)Instructions burned: 3 (million)
% 0.21/0.54 % (4650)------------------------------
% 0.21/0.54 % (4650)------------------------------
% 0.21/0.54 % (4649)Instruction limit reached!
% 0.21/0.54 % (4649)------------------------------
% 0.21/0.54 % (4649)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (4649)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (4649)Termination reason: Unknown
% 0.21/0.54 % (4649)Termination phase: Saturation
% 0.21/0.54
% 0.21/0.54 % (4649)Memory used [KB]: 5628
% 0.21/0.54 % (4649)Time elapsed: 0.108 s
% 0.21/0.54 % (4649)Instructions burned: 8 (million)
% 0.21/0.54 % (4649)------------------------------
% 0.21/0.54 % (4649)------------------------------
% 0.21/0.54 % (4663)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.54 % (4667)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.21/0.54 % (4670)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.54 TRYING [1]
% 0.21/0.54 TRYING [2]
% 0.21/0.54 TRYING [3]
% 0.21/0.55 % (4661)Refutation found. Thanks to Tanya!
% 0.21/0.55 % SZS status Theorem for theBenchmark
% 0.21/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.55 % (4661)------------------------------
% 0.21/0.55 % (4661)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (4661)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (4661)Termination reason: Refutation
% 0.21/0.55
% 0.21/0.55 % (4661)Memory used [KB]: 1023
% 0.21/0.55 % (4661)Time elapsed: 0.132 s
% 0.21/0.55 % (4661)Instructions burned: 5 (million)
% 0.21/0.55 % (4661)------------------------------
% 0.21/0.55 % (4661)------------------------------
% 0.21/0.55 % (4641)Success in time 0.187 s
%------------------------------------------------------------------------------