TSTP Solution File: SEU128+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU128+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.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 : Tue May 21 03:44:54 EDT 2024
% Result : Theorem 0.73s 0.91s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 8 unt; 0 def)
% Number of atoms : 167 ( 10 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 196 ( 72 ~; 67 |; 45 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 78 ( 62 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f101,plain,
$false,
inference(avatar_sat_refutation,[],[f87,f95,f100]) ).
fof(f100,plain,
spl6_2,
inference(avatar_contradiction_clause,[],[f99]) ).
fof(f99,plain,
( $false
| spl6_2 ),
inference(subsumption_resolution,[],[f98,f65]) ).
fof(f65,plain,
in(sK3(sK0,set_intersection2(sK1,sK2)),sK0),
inference(resolution,[],[f39,f44]) ).
fof(f44,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK3(X0,X1),X1)
& in(sK3(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f29,f30]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK3(X0,X1),X1)
& in(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f39,plain,
~ subset(sK0,set_intersection2(sK1,sK2)),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( ~ subset(sK0,set_intersection2(sK1,sK2))
& subset(sK0,sK2)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f23,f26]) ).
fof(f26,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) )
=> ( ~ subset(sK0,set_intersection2(sK1,sK2))
& subset(sK0,sK2)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f98,plain,
( ~ in(sK3(sK0,set_intersection2(sK1,sK2)),sK0)
| spl6_2 ),
inference(resolution,[],[f86,f64]) ).
fof(f64,plain,
! [X0] :
( in(X0,sK2)
| ~ in(X0,sK0) ),
inference(resolution,[],[f38,f43]) ).
fof(f43,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f38,plain,
subset(sK0,sK2),
inference(cnf_transformation,[],[f27]) ).
fof(f86,plain,
( ~ in(sK3(sK0,set_intersection2(sK1,sK2)),sK2)
| spl6_2 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f84,plain,
( spl6_2
<=> in(sK3(sK0,set_intersection2(sK1,sK2)),sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f95,plain,
spl6_1,
inference(avatar_contradiction_clause,[],[f94]) ).
fof(f94,plain,
( $false
| spl6_1 ),
inference(subsumption_resolution,[],[f93,f65]) ).
fof(f93,plain,
( ~ in(sK3(sK0,set_intersection2(sK1,sK2)),sK0)
| spl6_1 ),
inference(resolution,[],[f82,f63]) ).
fof(f63,plain,
! [X0] :
( in(X0,sK1)
| ~ in(X0,sK0) ),
inference(resolution,[],[f37,f43]) ).
fof(f37,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f27]) ).
fof(f82,plain,
( ~ in(sK3(sK0,set_intersection2(sK1,sK2)),sK1)
| spl6_1 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f80,plain,
( spl6_1
<=> in(sK3(sK0,set_intersection2(sK1,sK2)),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f87,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f78,f84,f80]) ).
fof(f78,plain,
( ~ in(sK3(sK0,set_intersection2(sK1,sK2)),sK2)
| ~ in(sK3(sK0,set_intersection2(sK1,sK2)),sK1) ),
inference(resolution,[],[f66,f53]) ).
fof(f53,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f48]) ).
fof(f48,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ( ( ~ in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) )
| in(sK4(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f34,f35]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( ~ in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) )
| in(sK4(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f66,plain,
~ in(sK3(sK0,set_intersection2(sK1,sK2)),set_intersection2(sK1,sK2)),
inference(resolution,[],[f39,f45]) ).
fof(f45,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU128+1 : TPTP v8.2.0. Released v3.3.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n009.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 17:13:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.73/0.91 % (11436)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2994ds/34Mi)
% 0.73/0.91 % (11437)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2994ds/51Mi)
% 0.73/0.91 % (11438)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.73/0.91 % (11439)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.73/0.91 % (11440)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2994ds/34Mi)
% 0.73/0.91 % (11441)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.73/0.91 % (11442)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2994ds/83Mi)
% 0.73/0.91 % (11443)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2994ds/56Mi)
% 0.73/0.91 % (11443)First to succeed.
% 0.73/0.91 % (11441)Refutation not found, incomplete strategy% (11441)------------------------------
% 0.73/0.91 % (11441)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.91 % (11441)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.91
% 0.73/0.91 % (11441)Memory used [KB]: 1049
% 0.73/0.91 % (11441)Time elapsed: 0.004 s
% 0.73/0.91 % (11441)Instructions burned: 4 (million)
% 0.73/0.91 % (11441)------------------------------
% 0.73/0.91 % (11441)------------------------------
% 0.73/0.91 % (11443)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-11435"
% 0.73/0.91 % (11443)Refutation found. Thanks to Tanya!
% 0.73/0.91 % SZS status Theorem for theBenchmark
% 0.73/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 0.73/0.91 % (11443)------------------------------
% 0.73/0.91 % (11443)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.91 % (11443)Termination reason: Refutation
% 0.73/0.91
% 0.73/0.91 % (11443)Memory used [KB]: 1058
% 0.73/0.91 % (11443)Time elapsed: 0.004 s
% 0.73/0.91 % (11443)Instructions burned: 5 (million)
% 0.73/0.91 % (11435)Success in time 0.541 s
% 0.73/0.91 % Vampire---4.8 exiting
%------------------------------------------------------------------------------