TSTP Solution File: SEU128+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU128+2 : 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 : n004.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.71s 0.94s
% Output : Refutation 0.71s
% 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(f393,plain,
$false,
inference(avatar_sat_refutation,[],[f350,f365,f392]) ).
fof(f392,plain,
spl12_5,
inference(avatar_contradiction_clause,[],[f391]) ).
fof(f391,plain,
( $false
| spl12_5 ),
inference(subsumption_resolution,[],[f385,f184]) ).
fof(f184,plain,
in(sK2(sK6,set_intersection2(sK7,sK8)),sK6),
inference(resolution,[],[f130,f107]) ).
fof(f107,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f75,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f73,f74]) ).
fof(f74,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f73,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,[],[f72]) ).
fof(f72,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,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f130,plain,
~ subset(sK6,set_intersection2(sK7,sK8)),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
( ~ subset(sK6,set_intersection2(sK7,sK8))
& subset(sK6,sK8)
& subset(sK6,sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f50,f86]) ).
fof(f86,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) )
=> ( ~ subset(sK6,set_intersection2(sK7,sK8))
& subset(sK6,sK8)
& subset(sK6,sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) ),
inference(flattening,[],[f49]) ).
fof(f49,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
inference(negated_conjecture,[],[f24]) ).
fof(f24,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(f385,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK6)
| spl12_5 ),
inference(resolution,[],[f349,f181]) ).
fof(f181,plain,
! [X0] :
( in(X0,sK8)
| ~ in(X0,sK6) ),
inference(resolution,[],[f129,f106]) ).
fof(f106,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f129,plain,
subset(sK6,sK8),
inference(cnf_transformation,[],[f87]) ).
fof(f349,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK8)
| spl12_5 ),
inference(avatar_component_clause,[],[f347]) ).
fof(f347,plain,
( spl12_5
<=> in(sK2(sK6,set_intersection2(sK7,sK8)),sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f365,plain,
spl12_4,
inference(avatar_contradiction_clause,[],[f364]) ).
fof(f364,plain,
( $false
| spl12_4 ),
inference(subsumption_resolution,[],[f358,f184]) ).
fof(f358,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK6)
| spl12_4 ),
inference(resolution,[],[f345,f178]) ).
fof(f178,plain,
! [X0] :
( in(X0,sK7)
| ~ in(X0,sK6) ),
inference(resolution,[],[f128,f106]) ).
fof(f128,plain,
subset(sK6,sK7),
inference(cnf_transformation,[],[f87]) ).
fof(f345,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK7)
| spl12_4 ),
inference(avatar_component_clause,[],[f343]) ).
fof(f343,plain,
( spl12_4
<=> in(sK2(sK6,set_intersection2(sK7,sK8)),sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f350,plain,
( ~ spl12_4
| ~ spl12_5 ),
inference(avatar_split_clause,[],[f336,f347,f343]) ).
fof(f336,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK8)
| ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK7) ),
inference(resolution,[],[f185,f152]) ).
fof(f152,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f111]) ).
fof(f111,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f80]) ).
fof(f80,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ( ( ~ in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X2) )
& ( ( in(sK3(X0,X1,X2),X1)
& in(sK3(X0,X1,X2),X0) )
| in(sK3(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,[sK3])],[f78,f79]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( ~ in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X2) )
& ( ( in(sK3(X0,X1,X2),X1)
& in(sK3(X0,X1,X2),X0) )
| in(sK3(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f78,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,[],[f77]) ).
fof(f77,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,[],[f76]) ).
fof(f76,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,[],[f8]) ).
fof(f8,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(f185,plain,
~ in(sK2(sK6,set_intersection2(sK7,sK8)),set_intersection2(sK7,sK8)),
inference(resolution,[],[f130,f108]) ).
fof(f108,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU128+2 : TPTP v8.2.0. Released v3.3.0.
% 0.04/0.15 % 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.15/0.37 % Computer : n004.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 17:14:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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.71/0.93 % (9366)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.71/0.93 % (9364)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.71/0.93 % (9365)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.71/0.93 % (9367)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.71/0.93 % (9368)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.71/0.93 % (9369)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.71/0.93 % (9370)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.71/0.93 % (9371)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.71/0.94 % (9368)First to succeed.
% 0.71/0.94 % (9371)Also succeeded, but the first one will report.
% 0.71/0.94 % (9368)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-9363"
% 0.71/0.94 % (9368)Refutation found. Thanks to Tanya!
% 0.71/0.94 % SZS status Theorem for theBenchmark
% 0.71/0.94 % SZS output start Proof for theBenchmark
% See solution above
% 0.71/0.94 % (9368)------------------------------
% 0.71/0.94 % (9368)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.94 % (9368)Termination reason: Refutation
% 0.71/0.94
% 0.71/0.94 % (9368)Memory used [KB]: 1109
% 0.71/0.94 % (9368)Time elapsed: 0.007 s
% 0.71/0.94 % (9368)Instructions burned: 9 (million)
% 0.71/0.94 % (9363)Success in time 0.553 s
% 0.71/0.94 % Vampire---4.8 exiting
%------------------------------------------------------------------------------