TSTP Solution File: SEU104+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU104+1 : TPTP v8.1.2. Released v3.2.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 : n023.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:05 EDT 2024
% Result : Theorem 0.62s 0.79s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 10 unt; 0 def)
% Number of atoms : 141 ( 2 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 156 ( 61 ~; 47 |; 31 &)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 55 ( 46 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f235,plain,
$false,
inference(avatar_sat_refutation,[],[f171,f226,f233]) ).
fof(f233,plain,
spl12_2,
inference(avatar_contradiction_clause,[],[f232]) ).
fof(f232,plain,
( $false
| spl12_2 ),
inference(subsumption_resolution,[],[f231,f174]) ).
fof(f174,plain,
element(sK3(sK0),sK0),
inference(resolution,[],[f160,f100]) ).
fof(f100,plain,
! [X0,X1] :
( ~ in(X0,X1)
| element(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,axiom,
! [X0,X1] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.gVKZp9Cu4S/Vampire---4.8_5918',t1_subset) ).
fof(f160,plain,
in(sK3(sK0),sK0),
inference(resolution,[],[f95,f110]) ).
fof(f110,plain,
! [X0] :
( preboolean(X0)
| in(sK3(X0),X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f79,plain,
! [X0] :
( preboolean(X0)
| ( ( ~ in(set_difference(sK3(X0),sK4(X0)),X0)
| ~ in(set_union2(sK3(X0),sK4(X0)),X0) )
& in(sK4(X0),X0)
& in(sK3(X0),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f60,f78]) ).
fof(f78,plain,
! [X0] :
( ? [X1,X2] :
( ( ~ in(set_difference(X1,X2),X0)
| ~ in(set_union2(X1,X2),X0) )
& in(X2,X0)
& in(X1,X0) )
=> ( ( ~ in(set_difference(sK3(X0),sK4(X0)),X0)
| ~ in(set_union2(sK3(X0),sK4(X0)),X0) )
& in(sK4(X0),X0)
& in(sK3(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
! [X0] :
( preboolean(X0)
| ? [X1,X2] :
( ( ~ in(set_difference(X1,X2),X0)
| ~ in(set_union2(X1,X2),X0) )
& in(X2,X0)
& in(X1,X0) ) ),
inference(flattening,[],[f59]) ).
fof(f59,plain,
! [X0] :
( preboolean(X0)
| ? [X1,X2] :
( ( ~ in(set_difference(X1,X2),X0)
| ~ in(set_union2(X1,X2),X0) )
& in(X2,X0)
& in(X1,X0) ) ),
inference(ennf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0] :
( ! [X1,X2] :
( ( in(X2,X0)
& in(X1,X0) )
=> ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) )
=> preboolean(X0) ),
inference(unused_predicate_definition_removal,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(X2,X0)
& in(X1,X0) )
=> ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gVKZp9Cu4S/Vampire---4.8_5918',t10_finsub_1) ).
fof(f95,plain,
~ preboolean(sK0),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
( ~ preboolean(sK0)
& ! [X1] :
( ! [X2] :
( ( in(set_difference(X1,X2),sK0)
& in(symmetric_difference(X1,X2),sK0) )
| ~ element(X2,sK0) )
| ~ element(X1,sK0) )
& ~ empty(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f47,f72]) ).
fof(f72,plain,
( ? [X0] :
( ~ preboolean(X0)
& ! [X1] :
( ! [X2] :
( ( in(set_difference(X1,X2),X0)
& in(symmetric_difference(X1,X2),X0) )
| ~ element(X2,X0) )
| ~ element(X1,X0) )
& ~ empty(X0) )
=> ( ~ preboolean(sK0)
& ! [X1] :
( ! [X2] :
( ( in(set_difference(X1,X2),sK0)
& in(symmetric_difference(X1,X2),sK0) )
| ~ element(X2,sK0) )
| ~ element(X1,sK0) )
& ~ empty(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f47,plain,
? [X0] :
( ~ preboolean(X0)
& ! [X1] :
( ! [X2] :
( ( in(set_difference(X1,X2),X0)
& in(symmetric_difference(X1,X2),X0) )
| ~ element(X2,X0) )
| ~ element(X1,X0) )
& ~ empty(X0) ),
inference(flattening,[],[f46]) ).
fof(f46,plain,
? [X0] :
( ~ preboolean(X0)
& ! [X1] :
( ! [X2] :
( ( in(set_difference(X1,X2),X0)
& in(symmetric_difference(X1,X2),X0) )
| ~ element(X2,X0) )
| ~ element(X1,X0) )
& ~ empty(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,negated_conjecture,
~ ! [X0] :
( ~ empty(X0)
=> ( ! [X1] :
( element(X1,X0)
=> ! [X2] :
( element(X2,X0)
=> ( in(set_difference(X1,X2),X0)
& in(symmetric_difference(X1,X2),X0) ) ) )
=> preboolean(X0) ) ),
inference(negated_conjecture,[],[f29]) ).
fof(f29,conjecture,
! [X0] :
( ~ empty(X0)
=> ( ! [X1] :
( element(X1,X0)
=> ! [X2] :
( element(X2,X0)
=> ( in(set_difference(X1,X2),X0)
& in(symmetric_difference(X1,X2),X0) ) ) )
=> preboolean(X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gVKZp9Cu4S/Vampire---4.8_5918',t15_finsub_1) ).
fof(f231,plain,
( ~ element(sK3(sK0),sK0)
| spl12_2 ),
inference(subsumption_resolution,[],[f229,f186]) ).
fof(f186,plain,
element(sK4(sK0),sK0),
inference(resolution,[],[f161,f100]) ).
fof(f161,plain,
in(sK4(sK0),sK0),
inference(resolution,[],[f95,f111]) ).
fof(f111,plain,
! [X0] :
( preboolean(X0)
| in(sK4(X0),X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f229,plain,
( ~ element(sK4(sK0),sK0)
| ~ element(sK3(sK0),sK0)
| spl12_2 ),
inference(resolution,[],[f170,f94]) ).
fof(f94,plain,
! [X2,X1] :
( in(set_difference(X1,X2),sK0)
| ~ element(X2,sK0)
| ~ element(X1,sK0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f170,plain,
( ~ in(set_difference(sK3(sK0),sK4(sK0)),sK0)
| spl12_2 ),
inference(avatar_component_clause,[],[f168]) ).
fof(f168,plain,
( spl12_2
<=> in(set_difference(sK3(sK0),sK4(sK0)),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f226,plain,
spl12_1,
inference(avatar_contradiction_clause,[],[f225]) ).
fof(f225,plain,
( $false
| spl12_1 ),
inference(subsumption_resolution,[],[f224,f174]) ).
fof(f224,plain,
( ~ element(sK3(sK0),sK0)
| spl12_1 ),
inference(subsumption_resolution,[],[f222,f186]) ).
fof(f222,plain,
( ~ element(sK4(sK0),sK0)
| ~ element(sK3(sK0),sK0)
| spl12_1 ),
inference(resolution,[],[f208,f192]) ).
fof(f192,plain,
! [X0,X1] :
( element(set_difference(X1,X0),sK0)
| ~ element(X1,sK0)
| ~ element(X0,sK0) ),
inference(resolution,[],[f94,f100]) ).
fof(f208,plain,
( ~ element(set_difference(sK4(sK0),sK3(sK0)),sK0)
| spl12_1 ),
inference(subsumption_resolution,[],[f206,f174]) ).
fof(f206,plain,
( ~ element(set_difference(sK4(sK0),sK3(sK0)),sK0)
| ~ element(sK3(sK0),sK0)
| spl12_1 ),
inference(resolution,[],[f166,f93]) ).
fof(f93,plain,
! [X2,X1] :
( in(symmetric_difference(X1,X2),sK0)
| ~ element(X2,sK0)
| ~ element(X1,sK0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f166,plain,
( ~ in(symmetric_difference(sK3(sK0),set_difference(sK4(sK0),sK3(sK0))),sK0)
| spl12_1 ),
inference(avatar_component_clause,[],[f164]) ).
fof(f164,plain,
( spl12_1
<=> in(symmetric_difference(sK3(sK0),set_difference(sK4(sK0),sK3(sK0))),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f171,plain,
( ~ spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f162,f168,f164]) ).
fof(f162,plain,
( ~ in(set_difference(sK3(sK0),sK4(sK0)),sK0)
| ~ in(symmetric_difference(sK3(sK0),set_difference(sK4(sK0),sK3(sK0))),sK0) ),
inference(resolution,[],[f95,f141]) ).
fof(f141,plain,
! [X0] :
( preboolean(X0)
| ~ in(set_difference(sK3(X0),sK4(X0)),X0)
| ~ in(symmetric_difference(sK3(X0),set_difference(sK4(X0),sK3(X0))),X0) ),
inference(definition_unfolding,[],[f112,f104]) ).
fof(f104,plain,
! [X0,X1] : set_union2(X0,X1) = symmetric_difference(X0,set_difference(X1,X0)),
inference(cnf_transformation,[],[f43]) ).
fof(f43,axiom,
! [X0,X1] : set_union2(X0,X1) = symmetric_difference(X0,set_difference(X1,X0)),
file('/export/starexec/sandbox2/tmp/tmp.gVKZp9Cu4S/Vampire---4.8_5918',t98_xboole_1) ).
fof(f112,plain,
! [X0] :
( preboolean(X0)
| ~ in(set_difference(sK3(X0),sK4(X0)),X0)
| ~ in(set_union2(sK3(X0),sK4(X0)),X0) ),
inference(cnf_transformation,[],[f79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU104+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.15 % 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.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 16:25:40 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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.gVKZp9Cu4S/Vampire---4.8_5918
% 0.62/0.78 % (6286)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 (2995ds/56Mi)
% 0.62/0.78 % (6284)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.62/0.78 % (6279)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 (2995ds/34Mi)
% 0.62/0.78 % (6281)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.62/0.78 % (6282)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.62/0.78 % (6280)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 (2995ds/51Mi)
% 0.62/0.78 % (6283)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 (2995ds/34Mi)
% 0.62/0.78 % (6285)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 (2995ds/83Mi)
% 0.62/0.79 % (6286)First to succeed.
% 0.62/0.79 % (6286)Refutation found. Thanks to Tanya!
% 0.62/0.79 % SZS status Theorem for Vampire---4
% 0.62/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.79 % (6286)------------------------------
% 0.62/0.79 % (6286)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.79 % (6286)Termination reason: Refutation
% 0.62/0.79
% 0.62/0.79 % (6286)Memory used [KB]: 1077
% 0.62/0.79 % (6286)Time elapsed: 0.004 s
% 0.62/0.79 % (6286)Instructions burned: 6 (million)
% 0.62/0.79 % (6286)------------------------------
% 0.62/0.79 % (6286)------------------------------
% 0.62/0.79 % (6116)Success in time 0.422 s
% 0.62/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------