TSTP Solution File: SEU125+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU125+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n008.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:53 EDT 2024
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 9 unt; 0 def)
% Number of atoms : 150 ( 10 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 178 ( 63 ~; 61 |; 44 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 78 ( 62 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f323,plain,
$false,
inference(subsumption_resolution,[],[f314,f172]) ).
fof(f172,plain,
~ in(sK2(set_union2(sK8,sK10),sK9),sK9),
inference(resolution,[],[f134,f101]) ).
fof(f101,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f68]) ).
fof(f68,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])],[f66,f67]) ).
fof(f67,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f66,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,[],[f65]) ).
fof(f65,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,[],[f40]) ).
fof(f40,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/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f134,plain,
~ subset(set_union2(sK8,sK10),sK9),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
( ~ subset(set_union2(sK8,sK10),sK9)
& subset(sK10,sK9)
& subset(sK8,sK9) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10])],[f53,f83]) ).
fof(f83,plain,
( ? [X0,X1,X2] :
( ~ subset(set_union2(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) )
=> ( ~ subset(set_union2(sK8,sK10),sK9)
& subset(sK10,sK9)
& subset(sK8,sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
? [X0,X1,X2] :
( ~ subset(set_union2(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) ),
inference(flattening,[],[f52]) ).
fof(f52,plain,
? [X0,X1,X2] :
( ~ subset(set_union2(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(set_union2(X0,X2),X1) ),
inference(negated_conjecture,[],[f32]) ).
fof(f32,conjecture,
! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(set_union2(X0,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(f314,plain,
in(sK2(set_union2(sK8,sK10),sK9),sK9),
inference(resolution,[],[f298,f168]) ).
fof(f168,plain,
! [X0] :
( ~ in(X0,sK10)
| in(X0,sK9) ),
inference(resolution,[],[f133,f99]) ).
fof(f99,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f68]) ).
fof(f133,plain,
subset(sK10,sK9),
inference(cnf_transformation,[],[f84]) ).
fof(f298,plain,
in(sK2(set_union2(sK8,sK10),sK9),sK10),
inference(subsumption_resolution,[],[f289,f254]) ).
fof(f254,plain,
~ in(sK2(set_union2(sK8,sK10),sK9),sK8),
inference(resolution,[],[f172,f165]) ).
fof(f165,plain,
! [X0] :
( in(X0,sK9)
| ~ in(X0,sK8) ),
inference(resolution,[],[f132,f99]) ).
fof(f132,plain,
subset(sK8,sK9),
inference(cnf_transformation,[],[f84]) ).
fof(f289,plain,
( in(sK2(set_union2(sK8,sK10),sK9),sK10)
| in(sK2(set_union2(sK8,sK10),sK9),sK8) ),
inference(resolution,[],[f171,f140]) ).
fof(f140,plain,
! [X0,X1,X4] :
( in(X4,X1)
| in(X4,X0)
| ~ in(X4,set_union2(X0,X1)) ),
inference(equality_resolution,[],[f93]) ).
fof(f93,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ( ( ( ~ in(sK1(X0,X1,X2),X1)
& ~ in(sK1(X0,X1,X2),X0) )
| ~ in(sK1(X0,X1,X2),X2) )
& ( in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f62,f63]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) )
=> ( ( ( ~ in(sK1(X0,X1,X2),X1)
& ~ in(sK1(X0,X1,X2),X0) )
| ~ in(sK1(X0,X1,X2),X2) )
& ( in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f61]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f60]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f171,plain,
in(sK2(set_union2(sK8,sK10),sK9),set_union2(sK8,sK10)),
inference(resolution,[],[f134,f100]) ).
fof(f100,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU125+2 : TPTP v8.2.0. Released v3.3.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 15:42:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.80 % (22852)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.80 % (22847)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 (2995ds/34Mi)
% 0.60/0.80 % (22849)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.80 % (22848)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 (2995ds/51Mi)
% 0.60/0.80 % (22850)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.80 % (22851)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 (2995ds/34Mi)
% 0.60/0.80 % (22853)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 (2995ds/83Mi)
% 0.60/0.80 % (22851)First to succeed.
% 0.60/0.80 % (22851)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22798"
% 0.60/0.81 % (22850)Also succeeded, but the first one will report.
% 0.60/0.81 % (22851)Refutation found. Thanks to Tanya!
% 0.60/0.81 % SZS status Theorem for theBenchmark
% 0.60/0.81 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.81 % (22851)------------------------------
% 0.60/0.81 % (22851)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.81 % (22851)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (22851)Memory used [KB]: 1072
% 0.60/0.81 % (22851)Time elapsed: 0.007 s
% 0.60/0.81 % (22851)Instructions burned: 8 (million)
% 0.60/0.81 % (22798)Success in time 0.439 s
% 0.60/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------