TSTP Solution File: SEU239+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU239+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 : 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:51:04 EDT 2024
% Result : Theorem 0.61s 0.77s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 2 unt; 0 def)
% Number of atoms : 200 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 235 ( 92 ~; 92 |; 30 &)
% ( 10 <=>; 10 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 45 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f115,plain,
$false,
inference(avatar_sat_refutation,[],[f80,f85,f89,f103,f112,f114]) ).
fof(f114,plain,
( spl5_4
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f113,f73,f87]) ).
fof(f87,plain,
( spl5_4
<=> ! [X2] :
( in(ordered_pair(X2,X2),sK0)
| ~ in(X2,relation_field(sK0)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
fof(f73,plain,
( spl5_1
<=> reflexive(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f113,plain,
( ! [X0] :
( ~ in(X0,relation_field(sK0))
| in(ordered_pair(X0,X0),sK0) )
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f109,f58]) ).
fof(f58,plain,
relation(sK0),
inference(cnf_transformation,[],[f48]) ).
fof(f48,plain,
( ( ( ~ in(ordered_pair(sK1,sK1),sK0)
& in(sK1,relation_field(sK0)) )
| ~ reflexive(sK0) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),sK0)
| ~ in(X2,relation_field(sK0)) )
| reflexive(sK0) )
& relation(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f45,f47,f46]) ).
fof(f46,plain,
( ? [X0] :
( ( ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) )
| ~ reflexive(X0) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) )
| reflexive(X0) )
& relation(X0) )
=> ( ( ? [X1] :
( ~ in(ordered_pair(X1,X1),sK0)
& in(X1,relation_field(sK0)) )
| ~ reflexive(sK0) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),sK0)
| ~ in(X2,relation_field(sK0)) )
| reflexive(sK0) )
& relation(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f47,plain,
( ? [X1] :
( ~ in(ordered_pair(X1,X1),sK0)
& in(X1,relation_field(sK0)) )
=> ( ~ in(ordered_pair(sK1,sK1),sK0)
& in(sK1,relation_field(sK0)) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
? [X0] :
( ( ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) )
| ~ reflexive(X0) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) )
| reflexive(X0) )
& relation(X0) ),
inference(rectify,[],[f44]) ).
fof(f44,plain,
? [X0] :
( ( ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) )
| ~ reflexive(X0) )
& ( ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) )
| reflexive(X0) )
& relation(X0) ),
inference(flattening,[],[f43]) ).
fof(f43,plain,
? [X0] :
( ( ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) )
| ~ reflexive(X0) )
& ( ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) )
| reflexive(X0) )
& relation(X0) ),
inference(nnf_transformation,[],[f38]) ).
fof(f38,plain,
? [X0] :
( ( reflexive(X0)
<~> ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) ) )
& relation(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> ! [X1] :
( in(X1,relation_field(X0))
=> in(ordered_pair(X1,X1),X0) ) ) ),
inference(negated_conjecture,[],[f25]) ).
fof(f25,conjecture,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> ! [X1] :
( in(X1,relation_field(X0))
=> in(ordered_pair(X1,X1),X0) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rpo7jp6lsq/Vampire---4.8_19940',l1_wellord1) ).
fof(f109,plain,
( ! [X0] :
( ~ in(X0,relation_field(sK0))
| in(ordered_pair(X0,X0),sK0)
| ~ relation(sK0) )
| ~ spl5_1 ),
inference(resolution,[],[f105,f69]) ).
fof(f69,plain,
! [X3,X0,X1] :
( ~ is_reflexive_in(X0,X1)
| ~ in(X3,X1)
| in(ordered_pair(X3,X3),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ( ~ in(ordered_pair(sK4(X0,X1),sK4(X0,X1)),X0)
& in(sK4(X0,X1),X1) ) )
& ( ! [X3] :
( in(ordered_pair(X3,X3),X0)
| ~ in(X3,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f55,f56]) ).
fof(f56,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(ordered_pair(X2,X2),X0)
& in(X2,X1) )
=> ( ~ in(ordered_pair(sK4(X0,X1),sK4(X0,X1)),X0)
& in(sK4(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ? [X2] :
( ~ in(ordered_pair(X2,X2),X0)
& in(X2,X1) ) )
& ( ! [X3] :
( in(ordered_pair(X3,X3),X0)
| ~ in(X3,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(rectify,[],[f54]) ).
fof(f54,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ? [X2] :
( ~ in(ordered_pair(X2,X2),X0)
& in(X2,X1) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0] :
( ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,X1) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( in(X2,X1)
=> in(ordered_pair(X2,X2),X0) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rpo7jp6lsq/Vampire---4.8_19940',d1_relat_2) ).
fof(f105,plain,
( is_reflexive_in(sK0,relation_field(sK0))
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f104,f58]) ).
fof(f104,plain,
( is_reflexive_in(sK0,relation_field(sK0))
| ~ relation(sK0)
| ~ spl5_1 ),
inference(resolution,[],[f74,f65]) ).
fof(f65,plain,
! [X0] :
( ~ reflexive(X0)
| is_reflexive_in(X0,relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f49,plain,
! [X0] :
( ( ( reflexive(X0)
| ~ is_reflexive_in(X0,relation_field(X0)) )
& ( is_reflexive_in(X0,relation_field(X0))
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0] :
( ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rpo7jp6lsq/Vampire---4.8_19940',d9_relat_2) ).
fof(f74,plain,
( reflexive(sK0)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f73]) ).
fof(f112,plain,
( spl5_2
| ~ spl5_3
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f111]) ).
fof(f111,plain,
( $false
| spl5_2
| ~ spl5_3
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f110,f84]) ).
fof(f84,plain,
( in(sK1,relation_field(sK0))
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f82,plain,
( spl5_3
<=> in(sK1,relation_field(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f110,plain,
( ~ in(sK1,relation_field(sK0))
| spl5_2
| ~ spl5_4 ),
inference(resolution,[],[f79,f88]) ).
fof(f88,plain,
( ! [X2] :
( in(ordered_pair(X2,X2),sK0)
| ~ in(X2,relation_field(sK0)) )
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f87]) ).
fof(f79,plain,
( ~ in(ordered_pair(sK1,sK1),sK0)
| spl5_2 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f77,plain,
( spl5_2
<=> in(ordered_pair(sK1,sK1),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f103,plain,
( spl5_1
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f102]) ).
fof(f102,plain,
( $false
| spl5_1
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f101,f94]) ).
fof(f94,plain,
( in(sK4(sK0,relation_field(sK0)),relation_field(sK0))
| spl5_1 ),
inference(subsumption_resolution,[],[f92,f58]) ).
fof(f92,plain,
( in(sK4(sK0,relation_field(sK0)),relation_field(sK0))
| ~ relation(sK0)
| spl5_1 ),
inference(resolution,[],[f91,f70]) ).
fof(f70,plain,
! [X0,X1] :
( is_reflexive_in(X0,X1)
| in(sK4(X0,X1),X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f91,plain,
( ~ is_reflexive_in(sK0,relation_field(sK0))
| spl5_1 ),
inference(subsumption_resolution,[],[f90,f58]) ).
fof(f90,plain,
( ~ is_reflexive_in(sK0,relation_field(sK0))
| ~ relation(sK0)
| spl5_1 ),
inference(resolution,[],[f75,f66]) ).
fof(f66,plain,
! [X0] :
( reflexive(X0)
| ~ is_reflexive_in(X0,relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f75,plain,
( ~ reflexive(sK0)
| spl5_1 ),
inference(avatar_component_clause,[],[f73]) ).
fof(f101,plain,
( ~ in(sK4(sK0,relation_field(sK0)),relation_field(sK0))
| spl5_1
| ~ spl5_4 ),
inference(resolution,[],[f95,f88]) ).
fof(f95,plain,
( ~ in(ordered_pair(sK4(sK0,relation_field(sK0)),sK4(sK0,relation_field(sK0))),sK0)
| spl5_1 ),
inference(subsumption_resolution,[],[f93,f58]) ).
fof(f93,plain,
( ~ in(ordered_pair(sK4(sK0,relation_field(sK0)),sK4(sK0,relation_field(sK0))),sK0)
| ~ relation(sK0)
| spl5_1 ),
inference(resolution,[],[f91,f71]) ).
fof(f71,plain,
! [X0,X1] :
( is_reflexive_in(X0,X1)
| ~ in(ordered_pair(sK4(X0,X1),sK4(X0,X1)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f89,plain,
( spl5_1
| spl5_4 ),
inference(avatar_split_clause,[],[f59,f87,f73]) ).
fof(f59,plain,
! [X2] :
( in(ordered_pair(X2,X2),sK0)
| ~ in(X2,relation_field(sK0))
| reflexive(sK0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f85,plain,
( ~ spl5_1
| spl5_3 ),
inference(avatar_split_clause,[],[f60,f82,f73]) ).
fof(f60,plain,
( in(sK1,relation_field(sK0))
| ~ reflexive(sK0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f80,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f61,f77,f73]) ).
fof(f61,plain,
( ~ in(ordered_pair(sK1,sK1),sK0)
| ~ reflexive(sK0) ),
inference(cnf_transformation,[],[f48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SEU239+1 : TPTP v8.1.2. Released v3.3.0.
% 0.14/0.16 % 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.17/0.37 % Computer : n021.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 300
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Tue Apr 30 16:18:56 EDT 2024
% 0.17/0.37 % CPUTime :
% 0.17/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.17/0.38 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.rpo7jp6lsq/Vampire---4.8_19940
% 0.61/0.77 % (20295)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.61/0.77 % (20288)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.61/0.77 % (20289)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.61/0.77 % (20290)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.61/0.77 % (20293)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.61/0.77 % (20292)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.61/0.77 % (20295)First to succeed.
% 0.61/0.77 % (20294)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.61/0.77 % (20291)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.61/0.77 % (20295)Refutation found. Thanks to Tanya!
% 0.61/0.77 % SZS status Theorem for Vampire---4
% 0.61/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.77 % (20295)------------------------------
% 0.61/0.77 % (20295)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (20295)Termination reason: Refutation
% 0.61/0.77
% 0.61/0.77 % (20295)Memory used [KB]: 1067
% 0.61/0.77 % (20295)Time elapsed: 0.003 s
% 0.61/0.77 % (20295)Instructions burned: 4 (million)
% 0.61/0.77 % (20295)------------------------------
% 0.61/0.77 % (20295)------------------------------
% 0.61/0.77 % (20131)Success in time 0.39 s
% 0.61/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------