TSTP Solution File: SEU126+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU126+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/sandbox2/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 : Wed May 1 03:50:09 EDT 2024
% Result : Theorem 0.59s 0.75s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 53 ( 6 unt; 0 def)
% Number of atoms : 195 ( 25 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 224 ( 82 ~; 87 |; 41 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 89 ( 78 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f119,plain,
$false,
inference(avatar_sat_refutation,[],[f97,f106,f118]) ).
fof(f118,plain,
spl7_2,
inference(avatar_contradiction_clause,[],[f117]) ).
fof(f117,plain,
( $false
| spl7_2 ),
inference(subsumption_resolution,[],[f114,f109]) ).
fof(f109,plain,
( ~ in(sK2(set_union2(sK0,sK1),sK1),sK1)
| spl7_2 ),
inference(resolution,[],[f96,f57]) ).
fof(f57,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,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])],[f33,f34]) ).
fof(f34,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f33,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,[],[f32]) ).
fof(f32,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,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.g8apE0fqwX/Vampire---4.8_26184',d3_tarski) ).
fof(f96,plain,
( ~ subset(set_union2(sK0,sK1),sK1)
| spl7_2 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f94,plain,
( spl7_2
<=> subset(set_union2(sK0,sK1),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f114,plain,
( in(sK2(set_union2(sK0,sK1),sK1),sK1)
| spl7_2 ),
inference(resolution,[],[f113,f86]) ).
fof(f86,plain,
! [X0] :
( ~ in(X0,sK0)
| in(X0,sK1) ),
inference(resolution,[],[f47,f55]) ).
fof(f55,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f47,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
( sK1 != set_union2(sK0,sK1)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f23,f30]) ).
fof(f30,plain,
( ? [X0,X1] :
( set_union2(X0,X1) != X1
& subset(X0,X1) )
=> ( sK1 != set_union2(sK0,sK1)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0,X1] :
( set_union2(X0,X1) != X1
& subset(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
inference(negated_conjecture,[],[f15]) ).
fof(f15,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.g8apE0fqwX/Vampire---4.8_26184',t12_xboole_1) ).
fof(f113,plain,
( in(sK2(set_union2(sK0,sK1),sK1),sK0)
| spl7_2 ),
inference(subsumption_resolution,[],[f110,f109]) ).
fof(f110,plain,
( in(sK2(set_union2(sK0,sK1),sK1),sK0)
| in(sK2(set_union2(sK0,sK1),sK1),sK1)
| spl7_2 ),
inference(resolution,[],[f108,f75]) ).
fof(f75,plain,
! [X0,X1,X4] :
( ~ in(X4,set_union2(X0,X1))
| in(X4,X0)
| in(X4,X1) ),
inference(equality_resolution,[],[f64]) ).
fof(f64,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ( ( ( ~ in(sK5(X0,X1,X2),X1)
& ~ in(sK5(X0,X1,X2),X0) )
| ~ in(sK5(X0,X1,X2),X2) )
& ( in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X0)
| in(sK5(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,[sK5])],[f44,f45]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) )
=> ( ( ( ~ in(sK5(X0,X1,X2),X1)
& ~ in(sK5(X0,X1,X2),X0) )
| ~ in(sK5(X0,X1,X2),X2) )
& ( in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X0)
| in(sK5(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f44,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,[],[f43]) ).
fof(f43,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,[],[f42]) ).
fof(f42,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,[],[f4]) ).
fof(f4,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.g8apE0fqwX/Vampire---4.8_26184',d2_xboole_0) ).
fof(f108,plain,
( in(sK2(set_union2(sK0,sK1),sK1),set_union2(sK0,sK1))
| spl7_2 ),
inference(resolution,[],[f96,f56]) ).
fof(f56,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f106,plain,
spl7_1,
inference(avatar_contradiction_clause,[],[f105]) ).
fof(f105,plain,
( $false
| spl7_1 ),
inference(subsumption_resolution,[],[f104,f99]) ).
fof(f99,plain,
( in(sK2(sK1,set_union2(sK0,sK1)),sK1)
| spl7_1 ),
inference(resolution,[],[f92,f56]) ).
fof(f92,plain,
( ~ subset(sK1,set_union2(sK0,sK1))
| spl7_1 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f90,plain,
( spl7_1
<=> subset(sK1,set_union2(sK0,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f104,plain,
( ~ in(sK2(sK1,set_union2(sK0,sK1)),sK1)
| spl7_1 ),
inference(resolution,[],[f100,f73]) ).
fof(f73,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f66]) ).
fof(f66,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f46]) ).
fof(f100,plain,
( ~ in(sK2(sK1,set_union2(sK0,sK1)),set_union2(sK0,sK1))
| spl7_1 ),
inference(resolution,[],[f92,f57]) ).
fof(f97,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f87,f94,f90]) ).
fof(f87,plain,
( ~ subset(set_union2(sK0,sK1),sK1)
| ~ subset(sK1,set_union2(sK0,sK1)) ),
inference(resolution,[],[f77,f81]) ).
fof(f81,plain,
! [X0,X1] :
( sQ6_eqProxy(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(equality_proxy_replacement,[],[f60,f76]) ).
fof(f76,plain,
! [X0,X1] :
( sQ6_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ6_eqProxy])]) ).
fof(f60,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.g8apE0fqwX/Vampire---4.8_26184',d10_xboole_0) ).
fof(f77,plain,
~ sQ6_eqProxy(sK1,set_union2(sK0,sK1)),
inference(equality_proxy_replacement,[],[f48,f76]) ).
fof(f48,plain,
sK1 != set_union2(sK0,sK1),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU126+1 : TPTP v8.1.2. 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.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 16:34:04 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/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/tmp/tmp.g8apE0fqwX/Vampire---4.8_26184
% 0.59/0.74 % (26538)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.59/0.74 % (26531)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.59/0.74 % (26533)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.59/0.74 % (26534)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.59/0.74 % (26532)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.59/0.74 % (26535)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.59/0.74 % (26536)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.59/0.74 % (26538)First to succeed.
% 0.59/0.74 % (26537)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.59/0.75 % (26538)Refutation found. Thanks to Tanya!
% 0.59/0.75 % SZS status Theorem for Vampire---4
% 0.59/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.75 % (26538)------------------------------
% 0.59/0.75 % (26538)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.75 % (26538)Termination reason: Refutation
% 0.59/0.75
% 0.59/0.75 % (26538)Memory used [KB]: 1058
% 0.59/0.75 % (26538)Time elapsed: 0.003 s
% 0.59/0.75 % (26538)Instructions burned: 5 (million)
% 0.59/0.75 % (26538)------------------------------
% 0.59/0.75 % (26538)------------------------------
% 0.59/0.75 % (26366)Success in time 0.385 s
% 0.59/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------