TSTP Solution File: SEU138+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU138+2 : 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 : n021.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 May 1 03:50:12 EDT 2024
% Result : Theorem 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 8 unt; 0 def)
% Number of atoms : 243 ( 32 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 303 ( 116 ~; 127 |; 50 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 103 ( 91 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f671,plain,
$false,
inference(avatar_sat_refutation,[],[f265,f267,f636,f670]) ).
fof(f670,plain,
( ~ spl13_1
| spl13_2 ),
inference(avatar_contradiction_clause,[],[f669]) ).
fof(f669,plain,
( $false
| ~ spl13_1
| spl13_2 ),
inference(subsumption_resolution,[],[f668,f256]) ).
fof(f256,plain,
in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK9),
inference(subsumption_resolution,[],[f248,f208]) ).
fof(f208,plain,
! [X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,set_difference(X0,X1)) ),
inference(equality_resolution,[],[f146]) ).
fof(f146,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0,X1,X2] :
( ( set_difference(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_difference(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f104,f105]) ).
fof(f105,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(f104,plain,
! [X0,X1,X2] :
( ( set_difference(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_difference(X0,X1) != X2 ) ),
inference(rectify,[],[f103]) ).
fof(f103,plain,
! [X0,X1,X2] :
( ( set_difference(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_difference(X0,X1) != X2 ) ),
inference(flattening,[],[f102]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ( set_difference(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_difference(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1,X2] :
( set_difference(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( ~ in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RIUaPGVrtJ/Vampire---4.8_21058',d4_xboole_0) ).
fof(f248,plain,
( in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK9)
| in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,set_difference(sK9,sK10))) ),
inference(resolution,[],[f242,f219]) ).
fof(f219,plain,
! [X2,X0,X1] :
( sQ12_eqProxy(set_intersection2(X0,X1),X2)
| in(sK3(X0,X1,X2),X0)
| in(sK3(X0,X1,X2),X2) ),
inference(equality_proxy_replacement,[],[f143,f209]) ).
fof(f209,plain,
! [X0,X1] :
( sQ12_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ12_eqProxy])]) ).
fof(f143,plain,
! [X2,X0,X1] :
( set_intersection2(X0,X1) = X2
| in(sK3(X0,X1,X2),X0)
| in(sK3(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,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])],[f99,f100]) ).
fof(f100,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(f99,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,[],[f98]) ).
fof(f98,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,[],[f97]) ).
fof(f97,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/tmp/tmp.RIUaPGVrtJ/Vampire---4.8_21058',d3_xboole_0) ).
fof(f242,plain,
~ sQ12_eqProxy(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),
inference(equality_proxy_replacement,[],[f188,f209]) ).
fof(f188,plain,
set_intersection2(sK9,sK10) != set_difference(sK9,set_difference(sK9,sK10)),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
set_intersection2(sK9,sK10) != set_difference(sK9,set_difference(sK9,sK10)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f75,f119]) ).
fof(f119,plain,
( ? [X0,X1] : set_intersection2(X0,X1) != set_difference(X0,set_difference(X0,X1))
=> set_intersection2(sK9,sK10) != set_difference(sK9,set_difference(sK9,sK10)) ),
introduced(choice_axiom,[]) ).
fof(f75,plain,
? [X0,X1] : set_intersection2(X0,X1) != set_difference(X0,set_difference(X0,X1)),
inference(ennf_transformation,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
file('/export/starexec/sandbox/tmp/tmp.RIUaPGVrtJ/Vampire---4.8_21058',t48_xboole_1) ).
fof(f668,plain,
( ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK9)
| ~ spl13_1
| spl13_2 ),
inference(subsumption_resolution,[],[f660,f263]) ).
fof(f263,plain,
( ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK10)
| spl13_2 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f262,plain,
( spl13_2
<=> in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).
fof(f660,plain,
( in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK10)
| ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK9)
| ~ spl13_1 ),
inference(resolution,[],[f649,f206]) ).
fof(f206,plain,
! [X0,X1,X4] :
( in(X4,set_difference(X0,X1))
| in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f148]) ).
fof(f148,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| in(X4,X1)
| ~ in(X4,X0)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f106]) ).
fof(f649,plain,
( ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,sK10))
| ~ spl13_1 ),
inference(resolution,[],[f260,f207]) ).
fof(f207,plain,
! [X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,set_difference(X0,X1)) ),
inference(equality_resolution,[],[f147]) ).
fof(f147,plain,
! [X2,X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f106]) ).
fof(f260,plain,
( in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,set_difference(sK9,sK10)))
| ~ spl13_1 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f258,plain,
( spl13_1
<=> in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,set_difference(sK9,sK10))) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).
fof(f636,plain,
( spl13_1
| ~ spl13_2 ),
inference(avatar_contradiction_clause,[],[f635]) ).
fof(f635,plain,
( $false
| spl13_1
| ~ spl13_2 ),
inference(subsumption_resolution,[],[f624,f264]) ).
fof(f264,plain,
( in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK10)
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f624,plain,
( ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK10)
| spl13_1 ),
inference(resolution,[],[f566,f207]) ).
fof(f566,plain,
( in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,sK10))
| spl13_1 ),
inference(subsumption_resolution,[],[f558,f256]) ).
fof(f558,plain,
( in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,sK10))
| ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK9)
| spl13_1 ),
inference(resolution,[],[f259,f206]) ).
fof(f259,plain,
( ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,set_difference(sK9,sK10)))
| spl13_1 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f267,plain,
( ~ spl13_1
| ~ spl13_2 ),
inference(avatar_split_clause,[],[f266,f262,f258]) ).
fof(f266,plain,
( ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK10)
| ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,set_difference(sK9,sK10))) ),
inference(subsumption_resolution,[],[f250,f256]) ).
fof(f250,plain,
( ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK10)
| ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK9)
| ~ in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,set_difference(sK9,sK10))) ),
inference(resolution,[],[f242,f217]) ).
fof(f217,plain,
! [X2,X0,X1] :
( sQ12_eqProxy(set_intersection2(X0,X1),X2)
| ~ in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X2) ),
inference(equality_proxy_replacement,[],[f145,f209]) ).
fof(f145,plain,
! [X2,X0,X1] :
( set_intersection2(X0,X1) = X2
| ~ in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f101]) ).
fof(f265,plain,
( spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f249,f262,f258]) ).
fof(f249,plain,
( in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),sK10)
| in(sK3(sK9,sK10,set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,set_difference(sK9,sK10))) ),
inference(resolution,[],[f242,f218]) ).
fof(f218,plain,
! [X2,X0,X1] :
( sQ12_eqProxy(set_intersection2(X0,X1),X2)
| in(sK3(X0,X1,X2),X1)
| in(sK3(X0,X1,X2),X2) ),
inference(equality_proxy_replacement,[],[f144,f209]) ).
fof(f144,plain,
! [X2,X0,X1] :
( set_intersection2(X0,X1) = X2
| in(sK3(X0,X1,X2),X1)
| in(sK3(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SEU138+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.16 % 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 : n021.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 : Tue Apr 30 16:19:11 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/tmp/tmp.RIUaPGVrtJ/Vampire---4.8_21058
% 0.55/0.76 % (21399)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.55/0.76 % (21394)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.55/0.76 % (21392)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.55/0.76 % (21395)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.55/0.76 % (21396)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.55/0.76 % (21397)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.76 % (21398)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.76 % (21396)First to succeed.
% 0.60/0.77 % (21396)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Theorem for Vampire---4
% 0.60/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.77 % (21396)------------------------------
% 0.60/0.77 % (21396)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.77 % (21396)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (21396)Memory used [KB]: 1180
% 0.60/0.77 % (21396)Time elapsed: 0.010 s
% 0.60/0.77 % (21396)Instructions burned: 14 (million)
% 0.60/0.77 % (21396)------------------------------
% 0.60/0.77 % (21396)------------------------------
% 0.60/0.77 % (21300)Success in time 0.389 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------