TSTP Solution File: SEU212+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU212+3 : 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 : n019.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:43 EDT 2024
% Result : Theorem 0.55s 0.77s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 56 ( 3 unt; 0 def)
% Number of atoms : 254 ( 46 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 314 ( 116 ~; 123 |; 48 &)
% ( 15 <=>; 10 =>; 0 <=; 2 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 90 ( 62 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f149,plain,
$false,
inference(avatar_sat_refutation,[],[f123,f124,f125,f134,f145,f148]) ).
fof(f148,plain,
( ~ spl11_2
| ~ spl11_1
| spl11_3 ),
inference(avatar_split_clause,[],[f147,f120,f112,f116]) ).
fof(f116,plain,
( spl11_2
<=> in(sK0,relation_dom(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f112,plain,
( spl11_1
<=> in(ordered_pair(sK0,sK1),sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f120,plain,
( spl11_3
<=> sK1 = apply(sK2,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f147,plain,
( ~ in(sK0,relation_dom(sK2))
| ~ spl11_1
| spl11_3 ),
inference(subsumption_resolution,[],[f146,f72]) ).
fof(f72,plain,
relation(sK2),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
( ( sK1 != apply(sK2,sK0)
| ~ in(sK0,relation_dom(sK2))
| ~ in(ordered_pair(sK0,sK1),sK2) )
& ( ( sK1 = apply(sK2,sK0)
& in(sK0,relation_dom(sK2)) )
| in(ordered_pair(sK0,sK1),sK2) )
& function(sK2)
& relation(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f52,f53]) ).
fof(f53,plain,
( ? [X0,X1,X2] :
( ( apply(X2,X0) != X1
| ~ in(X0,relation_dom(X2))
| ~ in(ordered_pair(X0,X1),X2) )
& ( ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) )
| in(ordered_pair(X0,X1),X2) )
& function(X2)
& relation(X2) )
=> ( ( sK1 != apply(sK2,sK0)
| ~ in(sK0,relation_dom(sK2))
| ~ in(ordered_pair(sK0,sK1),sK2) )
& ( ( sK1 = apply(sK2,sK0)
& in(sK0,relation_dom(sK2)) )
| in(ordered_pair(sK0,sK1),sK2) )
& function(sK2)
& relation(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
? [X0,X1,X2] :
( ( apply(X2,X0) != X1
| ~ in(X0,relation_dom(X2))
| ~ in(ordered_pair(X0,X1),X2) )
& ( ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) )
| in(ordered_pair(X0,X1),X2) )
& function(X2)
& relation(X2) ),
inference(flattening,[],[f51]) ).
fof(f51,plain,
? [X0,X1,X2] :
( ( apply(X2,X0) != X1
| ~ in(X0,relation_dom(X2))
| ~ in(ordered_pair(X0,X1),X2) )
& ( ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) )
| in(ordered_pair(X0,X1),X2) )
& function(X2)
& relation(X2) ),
inference(nnf_transformation,[],[f38]) ).
fof(f38,plain,
? [X0,X1,X2] :
( ( in(ordered_pair(X0,X1),X2)
<~> ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) ) )
& function(X2)
& relation(X2) ),
inference(flattening,[],[f37]) ).
fof(f37,plain,
? [X0,X1,X2] :
( ( in(ordered_pair(X0,X1),X2)
<~> ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) ) )
& function(X2)
& relation(X2) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(ordered_pair(X0,X1),X2)
<=> ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) ) ) ),
inference(negated_conjecture,[],[f35]) ).
fof(f35,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(ordered_pair(X0,X1),X2)
<=> ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Xyz991B0VJ/Vampire---4.8_22783',t8_funct_1) ).
fof(f146,plain,
( ~ in(sK0,relation_dom(sK2))
| ~ relation(sK2)
| ~ spl11_1
| spl11_3 ),
inference(subsumption_resolution,[],[f139,f73]) ).
fof(f73,plain,
function(sK2),
inference(cnf_transformation,[],[f54]) ).
fof(f139,plain,
( ~ in(sK0,relation_dom(sK2))
| ~ function(sK2)
| ~ relation(sK2)
| ~ spl11_1
| spl11_3 ),
inference(subsumption_resolution,[],[f135,f122]) ).
fof(f122,plain,
( sK1 != apply(sK2,sK0)
| spl11_3 ),
inference(avatar_component_clause,[],[f120]) ).
fof(f135,plain,
( sK1 = apply(sK2,sK0)
| ~ in(sK0,relation_dom(sK2))
| ~ function(sK2)
| ~ relation(sK2)
| ~ spl11_1 ),
inference(resolution,[],[f113,f88]) ).
fof(f88,plain,
! [X2,X0,X1] :
( ~ in(ordered_pair(X1,X2),X0)
| apply(X0,X1) = X2
| ~ in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0] :
( ! [X1,X2] :
( ( ( ( apply(X0,X1) = X2
| empty_set != X2 )
& ( empty_set = X2
| apply(X0,X1) != X2 ) )
| in(X1,relation_dom(X0)) )
& ( ( ( apply(X0,X1) = X2
| ~ in(ordered_pair(X1,X2),X0) )
& ( in(ordered_pair(X1,X2),X0)
| apply(X0,X1) != X2 ) )
| ~ in(X1,relation_dom(X0)) ) )
| ~ function(X0)
| ~ relation(X0) ),
inference(nnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0] :
( ! [X1,X2] :
( ( ( apply(X0,X1) = X2
<=> empty_set = X2 )
| in(X1,relation_dom(X0)) )
& ( ( apply(X0,X1) = X2
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) ) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f46]) ).
fof(f46,plain,
! [X0] :
( ! [X1,X2] :
( ( ( apply(X0,X1) = X2
<=> empty_set = X2 )
| in(X1,relation_dom(X0)) )
& ( ( apply(X0,X1) = X2
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) ) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ! [X1,X2] :
( ( ~ in(X1,relation_dom(X0))
=> ( apply(X0,X1) = X2
<=> empty_set = X2 ) )
& ( in(X1,relation_dom(X0))
=> ( apply(X0,X1) = X2
<=> in(ordered_pair(X1,X2),X0) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Xyz991B0VJ/Vampire---4.8_22783',d4_funct_1) ).
fof(f113,plain,
( in(ordered_pair(sK0,sK1),sK2)
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f112]) ).
fof(f145,plain,
( spl11_2
| ~ spl11_1 ),
inference(avatar_split_clause,[],[f144,f112,f116]) ).
fof(f144,plain,
( in(sK0,relation_dom(sK2))
| ~ spl11_1 ),
inference(subsumption_resolution,[],[f136,f72]) ).
fof(f136,plain,
( in(sK0,relation_dom(sK2))
| ~ relation(sK2)
| ~ spl11_1 ),
inference(resolution,[],[f113,f106]) ).
fof(f106,plain,
! [X0,X6,X5] :
( ~ in(ordered_pair(X5,X6),X0)
| in(X5,relation_dom(X0))
| ~ relation(X0) ),
inference(equality_resolution,[],[f84]) ).
fof(f84,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(ordered_pair(X5,X6),X0)
| relation_dom(X0) != X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
! [X0] :
( ! [X1] :
( ( relation_dom(X0) = X1
| ( ( ! [X3] : ~ in(ordered_pair(sK3(X0,X1),X3),X0)
| ~ in(sK3(X0,X1),X1) )
& ( in(ordered_pair(sK3(X0,X1),sK4(X0,X1)),X0)
| in(sK3(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( in(ordered_pair(X5,sK5(X0,X5)),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f56,f59,f58,f57]) ).
fof(f57,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X4] : in(ordered_pair(X2,X4),X0)
| in(X2,X1) ) )
=> ( ( ! [X3] : ~ in(ordered_pair(sK3(X0,X1),X3),X0)
| ~ in(sK3(X0,X1),X1) )
& ( ? [X4] : in(ordered_pair(sK3(X0,X1),X4),X0)
| in(sK3(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f58,plain,
! [X0,X1] :
( ? [X4] : in(ordered_pair(sK3(X0,X1),X4),X0)
=> in(ordered_pair(sK3(X0,X1),sK4(X0,X1)),X0) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
! [X0,X5] :
( ? [X7] : in(ordered_pair(X5,X7),X0)
=> in(ordered_pair(X5,sK5(X0,X5)),X0) ),
introduced(choice_axiom,[]) ).
fof(f56,plain,
! [X0] :
( ! [X1] :
( ( relation_dom(X0) = X1
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X4] : in(ordered_pair(X2,X4),X0)
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( ? [X7] : in(ordered_pair(X5,X7),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(rectify,[],[f55]) ).
fof(f55,plain,
! [X0] :
( ! [X1] :
( ( relation_dom(X0) = X1
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] : ~ in(ordered_pair(X2,X3),X0) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0] :
( ! [X1] :
( relation_dom(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( relation_dom(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Xyz991B0VJ/Vampire---4.8_22783',d4_relat_1) ).
fof(f134,plain,
( spl11_1
| ~ spl11_2
| ~ spl11_3 ),
inference(avatar_contradiction_clause,[],[f133]) ).
fof(f133,plain,
( $false
| spl11_1
| ~ spl11_2
| ~ spl11_3 ),
inference(subsumption_resolution,[],[f132,f72]) ).
fof(f132,plain,
( ~ relation(sK2)
| spl11_1
| ~ spl11_2
| ~ spl11_3 ),
inference(subsumption_resolution,[],[f131,f73]) ).
fof(f131,plain,
( ~ function(sK2)
| ~ relation(sK2)
| spl11_1
| ~ spl11_2
| ~ spl11_3 ),
inference(subsumption_resolution,[],[f130,f117]) ).
fof(f117,plain,
( in(sK0,relation_dom(sK2))
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f130,plain,
( ~ in(sK0,relation_dom(sK2))
| ~ function(sK2)
| ~ relation(sK2)
| spl11_1
| ~ spl11_3 ),
inference(resolution,[],[f126,f110]) ).
fof(f110,plain,
! [X0,X1] :
( in(ordered_pair(X1,apply(X0,X1)),X0)
| ~ in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(equality_resolution,[],[f87]) ).
fof(f87,plain,
! [X2,X0,X1] :
( in(ordered_pair(X1,X2),X0)
| apply(X0,X1) != X2
| ~ in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f126,plain,
( ~ in(ordered_pair(sK0,apply(sK2,sK0)),sK2)
| spl11_1
| ~ spl11_3 ),
inference(forward_demodulation,[],[f114,f121]) ).
fof(f121,plain,
( sK1 = apply(sK2,sK0)
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f120]) ).
fof(f114,plain,
( ~ in(ordered_pair(sK0,sK1),sK2)
| spl11_1 ),
inference(avatar_component_clause,[],[f112]) ).
fof(f125,plain,
( spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f74,f116,f112]) ).
fof(f74,plain,
( in(sK0,relation_dom(sK2))
| in(ordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f54]) ).
fof(f124,plain,
( spl11_1
| spl11_3 ),
inference(avatar_split_clause,[],[f75,f120,f112]) ).
fof(f75,plain,
( sK1 = apply(sK2,sK0)
| in(ordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f54]) ).
fof(f123,plain,
( ~ spl11_1
| ~ spl11_2
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f76,f120,f116,f112]) ).
fof(f76,plain,
( sK1 != apply(sK2,sK0)
| ~ in(sK0,relation_dom(sK2))
| ~ in(ordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU212+3 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.10 % 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.10/0.30 % Computer : n019.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Apr 30 16:12:59 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31 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.Xyz991B0VJ/Vampire---4.8_22783
% 0.55/0.76 % (22900)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.55/0.76 % (22899)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.55/0.76 % (22898)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.55/0.76 % (22895)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.55/0.76 % (22897)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.55/0.76 % (22896)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.55/0.76 % (22901)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.55/0.76 % (22902)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.55/0.76 % (22899)Refutation not found, incomplete strategy% (22899)------------------------------
% 0.55/0.76 % (22899)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.76 % (22899)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76
% 0.55/0.76 % (22899)Memory used [KB]: 1058
% 0.55/0.76 % (22899)Time elapsed: 0.004 s
% 0.55/0.76 % (22899)Instructions burned: 4 (million)
% 0.55/0.76 % (22902)Refutation not found, incomplete strategy% (22902)------------------------------
% 0.55/0.76 % (22902)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.76 % (22902)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76
% 0.55/0.76 % (22902)Memory used [KB]: 1053
% 0.55/0.76 % (22902)Time elapsed: 0.003 s
% 0.55/0.76 % (22902)Instructions burned: 4 (million)
% 0.55/0.76 % (22902)------------------------------
% 0.55/0.76 % (22902)------------------------------
% 0.55/0.76 % (22899)------------------------------
% 0.55/0.76 % (22899)------------------------------
% 0.55/0.76 % (22900)First to succeed.
% 0.55/0.77 % (22901)Also succeeded, but the first one will report.
% 0.55/0.77 % (22900)Refutation found. Thanks to Tanya!
% 0.55/0.77 % SZS status Theorem for Vampire---4
% 0.55/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.77 % (22900)------------------------------
% 0.55/0.77 % (22900)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.77 % (22900)Termination reason: Refutation
% 0.55/0.77
% 0.55/0.77 % (22900)Memory used [KB]: 1069
% 0.55/0.77 % (22900)Time elapsed: 0.005 s
% 0.55/0.77 % (22900)Instructions burned: 6 (million)
% 0.55/0.77 % (22900)------------------------------
% 0.55/0.77 % (22900)------------------------------
% 0.55/0.77 % (22892)Success in time 0.454 s
% 0.55/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------