TSTP Solution File: SEU125+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU125+1 : TPTP v8.1.2. 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 : n026.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 : Sun May 5 09:20:21 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% 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 : 194 ( 70 ~; 68 |; 44 &)
% ( 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(f96,plain,
$false,
inference(avatar_sat_refutation,[],[f85,f90,f95]) ).
fof(f95,plain,
~ spl8_1,
inference(avatar_contradiction_clause,[],[f94]) ).
fof(f94,plain,
( $false
| ~ spl8_1 ),
inference(subsumption_resolution,[],[f91,f73]) ).
fof(f73,plain,
~ in(sK3(set_union2(sK0,sK2),sK1),sK1),
inference(resolution,[],[f45,f51]) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,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])],[f31,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK3(X0,X1),X1)
& in(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f31,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,[],[f30]) ).
fof(f30,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,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.6mitUkbYeQ/Vampire---4.8_2281',d3_tarski) ).
fof(f45,plain,
~ subset(set_union2(sK0,sK2),sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
( ~ subset(set_union2(sK0,sK2),sK1)
& subset(sK2,sK1)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f22,f28]) ).
fof(f28,plain,
( ? [X0,X1,X2] :
( ~ subset(set_union2(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) )
=> ( ~ subset(set_union2(sK0,sK2),sK1)
& subset(sK2,sK1)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
? [X0,X1,X2] :
( ~ subset(set_union2(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
? [X0,X1,X2] :
( ~ subset(set_union2(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(set_union2(X0,X2),X1) ),
inference(negated_conjecture,[],[f18]) ).
fof(f18,conjecture,
! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(set_union2(X0,X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.6mitUkbYeQ/Vampire---4.8_2281',t8_xboole_1) ).
fof(f91,plain,
( in(sK3(set_union2(sK0,sK2),sK1),sK1)
| ~ spl8_1 ),
inference(resolution,[],[f80,f71]) ).
fof(f71,plain,
! [X0] :
( ~ in(X0,sK2)
| in(X0,sK1) ),
inference(resolution,[],[f44,f49]) ).
fof(f49,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f44,plain,
subset(sK2,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f80,plain,
( in(sK3(set_union2(sK0,sK2),sK1),sK2)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f78,plain,
( spl8_1
<=> in(sK3(set_union2(sK0,sK2),sK1),sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
fof(f90,plain,
~ spl8_2,
inference(avatar_contradiction_clause,[],[f89]) ).
fof(f89,plain,
( $false
| ~ spl8_2 ),
inference(subsumption_resolution,[],[f86,f73]) ).
fof(f86,plain,
( in(sK3(set_union2(sK0,sK2),sK1),sK1)
| ~ spl8_2 ),
inference(resolution,[],[f84,f70]) ).
fof(f70,plain,
! [X0] :
( ~ in(X0,sK0)
| in(X0,sK1) ),
inference(resolution,[],[f43,f49]) ).
fof(f43,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f84,plain,
( in(sK3(set_union2(sK0,sK2),sK1),sK0)
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f82,plain,
( spl8_2
<=> in(sK3(set_union2(sK0,sK2),sK1),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
fof(f85,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f74,f82,f78]) ).
fof(f74,plain,
( in(sK3(set_union2(sK0,sK2),sK1),sK0)
| in(sK3(set_union2(sK0,sK2),sK1),sK2) ),
inference(resolution,[],[f72,f64]) ).
fof(f64,plain,
! [X0,X1,X4] :
( ~ in(X4,set_union2(X0,X1))
| in(X4,X0)
| in(X4,X1) ),
inference(equality_resolution,[],[f55]) ).
fof(f55,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ( ( ( ~ in(sK6(X0,X1,X2),X1)
& ~ in(sK6(X0,X1,X2),X0) )
| ~ in(sK6(X0,X1,X2),X2) )
& ( in(sK6(X0,X1,X2),X1)
| in(sK6(X0,X1,X2),X0)
| in(sK6(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,[sK6])],[f40,f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) )
=> ( ( ( ~ in(sK6(X0,X1,X2),X1)
& ~ in(sK6(X0,X1,X2),X0) )
| ~ in(sK6(X0,X1,X2),X2) )
& ( in(sK6(X0,X1,X2),X1)
| in(sK6(X0,X1,X2),X0)
| in(sK6(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f40,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,[],[f39]) ).
fof(f39,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,[],[f38]) ).
fof(f38,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,[],[f3]) ).
fof(f3,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6mitUkbYeQ/Vampire---4.8_2281',d2_xboole_0) ).
fof(f72,plain,
in(sK3(set_union2(sK0,sK2),sK1),set_union2(sK0,sK2)),
inference(resolution,[],[f45,f50]) ).
fof(f50,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU125+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/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.16/0.36 % Computer : n026.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 11:46:21 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/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/tmp/tmp.6mitUkbYeQ/Vampire---4.8_2281
% 0.60/0.75 % (2619)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.60/0.75 % (2612)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 Vampire---4 for (2996ds/34Mi)
% 0.60/0.75 % (2614)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.60/0.75 % (2613)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 Vampire---4 for (2996ds/51Mi)
% 0.60/0.75 % (2615)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.60/0.75 % (2616)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 Vampire---4 for (2996ds/34Mi)
% 0.60/0.75 % (2617)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.60/0.75 % (2618)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 Vampire---4 for (2996ds/83Mi)
% 0.60/0.75 % (2619)First to succeed.
% 0.60/0.75 % (2619)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2535"
% 0.60/0.76 % (2619)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for Vampire---4
% 0.60/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76 % (2619)------------------------------
% 0.60/0.76 % (2619)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (2619)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (2619)Memory used [KB]: 992
% 0.60/0.76 % (2619)Time elapsed: 0.003 s
% 0.60/0.76 % (2619)Instructions burned: 4 (million)
% 0.60/0.76 % (2535)Success in time 0.378 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------