TSTP Solution File: SEU223+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU223+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 : n010.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:52 EDT 2024
% Result : Theorem 0.58s 0.75s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 9 unt; 0 def)
% Number of atoms : 192 ( 47 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 243 ( 100 ~; 86 |; 40 &)
% ( 6 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 77 ( 64 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f245,plain,
$false,
inference(avatar_sat_refutation,[],[f214,f223,f244]) ).
fof(f244,plain,
spl14_4,
inference(avatar_contradiction_clause,[],[f243]) ).
fof(f243,plain,
( $false
| spl14_4 ),
inference(subsumption_resolution,[],[f242,f136]) ).
fof(f136,plain,
relation(sK11),
inference(cnf_transformation,[],[f86]) ).
fof(f86,plain,
( apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10)
& in(sK10,relation_dom(relation_dom_restriction(sK11,sK9)))
& function(sK11)
& relation(sK11) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11])],[f64,f85]) ).
fof(f85,plain,
( ? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,relation_dom(relation_dom_restriction(X2,X0)))
& function(X2)
& relation(X2) )
=> ( apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10)
& in(sK10,relation_dom(relation_dom_restriction(sK11,sK9)))
& function(sK11)
& relation(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f64,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,relation_dom(relation_dom_restriction(X2,X0)))
& function(X2)
& relation(X2) ),
inference(flattening,[],[f63]) ).
fof(f63,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,relation_dom(relation_dom_restriction(X2,X0)))
& function(X2)
& relation(X2) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
inference(negated_conjecture,[],[f36]) ).
fof(f36,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.lZZVipOzMA/Vampire---4.8_23053',t70_funct_1) ).
fof(f242,plain,
( ~ relation(sK11)
| spl14_4 ),
inference(subsumption_resolution,[],[f240,f137]) ).
fof(f137,plain,
function(sK11),
inference(cnf_transformation,[],[f86]) ).
fof(f240,plain,
( ~ function(sK11)
| ~ relation(sK11)
| spl14_4 ),
inference(resolution,[],[f213,f132]) ).
fof(f132,plain,
! [X0,X1] :
( function(relation_dom_restriction(X0,X1))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f57]) ).
fof(f57,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,axiom,
! [X0,X1] :
( ( function(X0)
& relation(X0) )
=> ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.lZZVipOzMA/Vampire---4.8_23053',fc4_funct_1) ).
fof(f213,plain,
( ~ function(relation_dom_restriction(sK11,sK9))
| spl14_4 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f211,plain,
( spl14_4
<=> function(relation_dom_restriction(sK11,sK9)) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f223,plain,
spl14_3,
inference(avatar_contradiction_clause,[],[f222]) ).
fof(f222,plain,
( $false
| spl14_3 ),
inference(subsumption_resolution,[],[f216,f136]) ).
fof(f216,plain,
( ~ relation(sK11)
| spl14_3 ),
inference(resolution,[],[f209,f128]) ).
fof(f128,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.lZZVipOzMA/Vampire---4.8_23053',dt_k7_relat_1) ).
fof(f209,plain,
( ~ relation(relation_dom_restriction(sK11,sK9))
| spl14_3 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f207,plain,
( spl14_3
<=> relation(relation_dom_restriction(sK11,sK9)) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f214,plain,
( ~ spl14_3
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f205,f211,f207]) ).
fof(f205,plain,
( ~ function(relation_dom_restriction(sK11,sK9))
| ~ relation(relation_dom_restriction(sK11,sK9)) ),
inference(subsumption_resolution,[],[f204,f136]) ).
fof(f204,plain,
( ~ relation(sK11)
| ~ function(relation_dom_restriction(sK11,sK9))
| ~ relation(relation_dom_restriction(sK11,sK9)) ),
inference(subsumption_resolution,[],[f203,f137]) ).
fof(f203,plain,
( ~ function(sK11)
| ~ relation(sK11)
| ~ function(relation_dom_restriction(sK11,sK9))
| ~ relation(relation_dom_restriction(sK11,sK9)) ),
inference(subsumption_resolution,[],[f200,f138]) ).
fof(f138,plain,
in(sK10,relation_dom(relation_dom_restriction(sK11,sK9))),
inference(cnf_transformation,[],[f86]) ).
fof(f200,plain,
( ~ in(sK10,relation_dom(relation_dom_restriction(sK11,sK9)))
| ~ function(sK11)
| ~ relation(sK11)
| ~ function(relation_dom_restriction(sK11,sK9))
| ~ relation(relation_dom_restriction(sK11,sK9)) ),
inference(resolution,[],[f187,f155]) ).
fof(f155,plain,
! [X2,X0,X4] :
( sQ13_eqProxy(apply(X2,X4),apply(relation_dom_restriction(X2,X0),X4))
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| ~ function(X2)
| ~ relation(X2)
| ~ function(relation_dom_restriction(X2,X0))
| ~ relation(relation_dom_restriction(X2,X0)) ),
inference(equality_proxy_replacement,[],[f144,f146]) ).
fof(f146,plain,
! [X0,X1] :
( sQ13_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ13_eqProxy])]) ).
fof(f144,plain,
! [X2,X0,X4] :
( apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| ~ function(X2)
| ~ relation(X2)
| ~ function(relation_dom_restriction(X2,X0))
| ~ relation(relation_dom_restriction(X2,X0)) ),
inference(equality_resolution,[],[f141]) ).
fof(f141,plain,
! [X2,X0,X1,X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1))
| relation_dom_restriction(X2,X0) != X1
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ( apply(X1,sK12(X1,X2)) != apply(X2,sK12(X1,X2))
& in(sK12(X1,X2),relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f89,f90]) ).
fof(f90,plain,
! [X1,X2] :
( ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
=> ( apply(X1,sK12(X1,X2)) != apply(X2,sK12(X1,X2))
& in(sK12(X1,X2),relation_dom(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f89,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(rectify,[],[f88]) ).
fof(f88,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f87]) ).
fof(f87,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(nnf_transformation,[],[f66]) ).
fof(f66,plain,
! [X0,X1] :
( ! [X2] :
( ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f65]) ).
fof(f65,plain,
! [X0,X1] :
( ! [X2] :
( ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0,X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( in(X3,relation_dom(X1))
=> apply(X1,X3) = apply(X2,X3) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lZZVipOzMA/Vampire---4.8_23053',t68_funct_1) ).
fof(f187,plain,
~ sQ13_eqProxy(apply(sK11,sK10),apply(relation_dom_restriction(sK11,sK9),sK10)),
inference(resolution,[],[f152,f158]) ).
fof(f158,plain,
! [X0,X1] :
( ~ sQ13_eqProxy(X0,X1)
| sQ13_eqProxy(X1,X0) ),
inference(equality_proxy_axiom,[],[f146]) ).
fof(f152,plain,
~ sQ13_eqProxy(apply(relation_dom_restriction(sK11,sK9),sK10),apply(sK11,sK10)),
inference(equality_proxy_replacement,[],[f139,f146]) ).
fof(f139,plain,
apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10),
inference(cnf_transformation,[],[f86]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU223+1 : TPTP v8.1.2. Released v3.3.0.
% 0.14/0.14 % 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.35 % Computer : n010.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 15:58:19 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.22/0.36 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.lZZVipOzMA/Vampire---4.8_23053
% 0.58/0.74 % (23430)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.58/0.74 % (23423)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.58/0.74 % (23426)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.58/0.74 % (23424)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.58/0.74 % (23425)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.58/0.74 % (23428)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.58/0.75 % (23427)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.58/0.75 % (23429)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.58/0.75 % (23430)Refutation not found, incomplete strategy% (23430)------------------------------
% 0.58/0.75 % (23430)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75 % (23430)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.75
% 0.58/0.75 % (23430)Memory used [KB]: 1047
% 0.58/0.75 % (23430)Time elapsed: 0.002 s
% 0.58/0.75 % (23430)Instructions burned: 3 (million)
% 0.58/0.75 % (23430)------------------------------
% 0.58/0.75 % (23430)------------------------------
% 0.58/0.75 % (23427)First to succeed.
% 0.58/0.75 % (23436)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.58/0.75 % (23423)Also succeeded, but the first one will report.
% 0.58/0.75 % (23426)Also succeeded, but the first one will report.
% 0.58/0.75 % (23427)Refutation found. Thanks to Tanya!
% 0.58/0.75 % SZS status Theorem for Vampire---4
% 0.58/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75 % (23427)------------------------------
% 0.58/0.75 % (23427)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75 % (23427)Termination reason: Refutation
% 0.58/0.75
% 0.58/0.75 % (23427)Memory used [KB]: 1075
% 0.58/0.75 % (23427)Time elapsed: 0.005 s
% 0.58/0.75 % (23427)Instructions burned: 6 (million)
% 0.58/0.75 % (23427)------------------------------
% 0.58/0.75 % (23427)------------------------------
% 0.58/0.75 % (23304)Success in time 0.383 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------