TSTP Solution File: SYN941+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN941+1 : TPTP v8.1.2. Released v3.1.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 : n006.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 : Sun May 5 12:07:55 EDT 2024
% Result : Theorem 0.57s 0.74s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 42 ( 3 unt; 0 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 115 ( 50 ~; 40 |; 9 &)
% ( 10 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 11 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 31 ( 25 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f62,plain,
$false,
inference(avatar_sat_refutation,[],[f19,f23,f31,f35,f44,f51,f55,f59,f61]) ).
fof(f61,plain,
( ~ spl4_2
| spl4_8 ),
inference(avatar_contradiction_clause,[],[f60]) ).
fof(f60,plain,
( $false
| ~ spl4_2
| spl4_8 ),
inference(subsumption_resolution,[],[f43,f18]) ).
fof(f18,plain,
( ! [X3] : r(X3)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f17,plain,
( spl4_2
<=> ! [X3] : r(X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f43,plain,
( ~ r(sK0)
| spl4_8 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f41,plain,
( spl4_8
<=> r(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_8])]) ).
fof(f59,plain,
( ~ spl4_2
| spl4_7 ),
inference(avatar_contradiction_clause,[],[f56]) ).
fof(f56,plain,
( $false
| ~ spl4_2
| spl4_7 ),
inference(unit_resulting_resolution,[],[f18,f39]) ).
fof(f39,plain,
( ~ r(sK1)
| spl4_7 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f37,plain,
( spl4_7
<=> r(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_7])]) ).
fof(f55,plain,
~ spl4_6,
inference(avatar_contradiction_clause,[],[f52]) ).
fof(f52,plain,
( $false
| ~ spl4_6 ),
inference(unit_resulting_resolution,[],[f7,f34]) ).
fof(f34,plain,
( ! [X2] : ~ q(X2)
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f33,plain,
( spl4_6
<=> ! [X2] : ~ q(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
fof(f7,plain,
q(f(sK0)),
inference(cnf_transformation,[],[f3]) ).
fof(f3,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ q(X2)
| ( ( ( ( ~ r(X1)
| ~ r(X0) )
& r(X3) )
| ~ p(X2) )
& p(f(X3)) ) )
& q(f(X0)) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
( q(f(X0))
=> ? [X2,X3] :
( q(X2)
& ( p(f(X3))
=> ( ( r(X3)
=> ( r(X1)
& r(X0) ) )
& p(X2) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1] :
( q(f(X0))
=> ? [X2,X3] :
( q(X2)
& ( p(f(X3))
=> ( ( r(X3)
=> ( r(X1)
& r(X0) ) )
& p(X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3EaSWIrQPg/Vampire---4.8_21241',prove_this) ).
fof(f51,plain,
( ~ spl4_3
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f50]) ).
fof(f50,plain,
( $false
| ~ spl4_3
| ~ spl4_5 ),
inference(subsumption_resolution,[],[f45,f30]) ).
fof(f30,plain,
( ! [X3] : p(f(X3))
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl4_5
<=> ! [X3] : p(f(X3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
fof(f45,plain,
( ~ p(f(sK0))
| ~ spl4_3 ),
inference(unit_resulting_resolution,[],[f7,f22]) ).
fof(f22,plain,
( ! [X2] :
( ~ p(X2)
| ~ q(X2) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f21,plain,
( spl4_3
<=> ! [X2] :
( ~ p(X2)
| ~ q(X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f44,plain,
( ~ spl4_7
| ~ spl4_8
| spl4_3 ),
inference(avatar_split_clause,[],[f4,f21,f41,f37]) ).
fof(f4,plain,
! [X2] :
( ~ p(X2)
| ~ r(sK0)
| ~ r(sK1)
| ~ q(X2) ),
inference(cnf_transformation,[],[f3]) ).
fof(f35,plain,
( spl4_4
| spl4_6 ),
inference(avatar_split_clause,[],[f8,f33,f25]) ).
fof(f25,plain,
( spl4_4
<=> sP2 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f8,plain,
! [X2] :
( ~ q(X2)
| sP2 ),
inference(cnf_transformation,[],[f8_D]) ).
fof(f8_D,plain,
( ! [X2] : ~ q(X2)
<=> ~ sP2 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP2])]) ).
fof(f31,plain,
( ~ spl4_4
| spl4_5 ),
inference(avatar_split_clause,[],[f9,f29,f25]) ).
fof(f9,plain,
! [X3] :
( p(f(X3))
| ~ sP2 ),
inference(general_splitting,[],[f6,f8_D]) ).
fof(f6,plain,
! [X2,X3] :
( p(f(X3))
| ~ q(X2) ),
inference(cnf_transformation,[],[f3]) ).
fof(f23,plain,
( spl4_1
| spl4_3 ),
inference(avatar_split_clause,[],[f10,f21,f13]) ).
fof(f13,plain,
( spl4_1
<=> sP3 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f10,plain,
! [X2] :
( ~ p(X2)
| ~ q(X2)
| sP3 ),
inference(cnf_transformation,[],[f10_D]) ).
fof(f10_D,plain,
( ! [X2] :
( ~ p(X2)
| ~ q(X2) )
<=> ~ sP3 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP3])]) ).
fof(f19,plain,
( ~ spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f11,f17,f13]) ).
fof(f11,plain,
! [X3] :
( r(X3)
| ~ sP3 ),
inference(general_splitting,[],[f5,f10_D]) ).
fof(f5,plain,
! [X2,X3] :
( ~ p(X2)
| r(X3)
| ~ q(X2) ),
inference(cnf_transformation,[],[f3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN941+1 : TPTP v8.1.2. Released v3.1.0.
% 0.14/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.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 17:49:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_NEQ problem
% 0.14/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.3EaSWIrQPg/Vampire---4.8_21241
% 0.57/0.73 % (21357)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.57/0.73 % (21358)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.57/0.73 % (21351)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.57/0.73 % (21353)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.57/0.73 % (21352)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.57/0.73 % (21354)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.57/0.73 % (21355)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.57/0.73 % (21356)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.57/0.73 % (21357)First to succeed.
% 0.57/0.73 % (21358)Also succeeded, but the first one will report.
% 0.57/0.74 % (21357)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21349"
% 0.57/0.74 % (21357)Refutation found. Thanks to Tanya!
% 0.57/0.74 % SZS status Theorem for Vampire---4
% 0.57/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.74 % (21357)------------------------------
% 0.57/0.74 % (21357)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (21357)Termination reason: Refutation
% 0.57/0.74
% 0.57/0.74 % (21357)Memory used [KB]: 983
% 0.57/0.74 % (21357)Time elapsed: 0.003 s
% 0.57/0.74 % (21357)Instructions burned: 3 (million)
% 0.57/0.74 % (21349)Success in time 0.377 s
% 0.57/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------