TSTP Solution File: SYN374+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN374+1 : TPTP v8.1.2. Released v2.0.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 : n015.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 11:57:06 EDT 2024
% Result : Theorem 0.62s 0.77s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 48 ( 1 unt; 0 def)
% Number of atoms : 182 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 218 ( 84 ~; 90 |; 19 &)
% ( 18 <=>; 6 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 8 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 75 ( 49 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f74,plain,
$false,
inference(avatar_sat_refutation,[],[f32,f45,f60,f61,f63,f65,f68,f70,f73]) ).
fof(f73,plain,
( ~ spl6_2
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f72]) ).
fof(f72,plain,
( $false
| ~ spl6_2
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f71,f27]) ).
fof(f27,plain,
( ! [X1] : ~ big_p(X1)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f26]) ).
fof(f26,plain,
( spl6_2
<=> ! [X1] : ~ big_p(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f71,plain,
( ! [X4] : big_p(X4)
| ~ spl6_2
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f35,f27]) ).
fof(f35,plain,
( ! [X4] :
( big_p(sK2(X4))
| big_p(X4) )
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f34,plain,
( spl6_4
<=> ! [X4] :
( big_p(sK2(X4))
| big_p(X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f70,plain,
( ~ spl6_2
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f69]) ).
fof(f69,plain,
( $false
| ~ spl6_2
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f30,f27]) ).
fof(f30,plain,
( big_p(sK0)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl6_3
<=> big_p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f68,plain,
( ~ spl6_1
| ~ spl6_6 ),
inference(avatar_contradiction_clause,[],[f67]) ).
fof(f67,plain,
( $false
| ~ spl6_1
| ~ spl6_6 ),
inference(subsumption_resolution,[],[f66,f43]) ).
fof(f43,plain,
( ! [X2] : big_p(X2)
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f42,plain,
( spl6_6
<=> ! [X2] : big_p(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f66,plain,
( ! [X4] : ~ big_p(X4)
| ~ spl6_1
| ~ spl6_6 ),
inference(subsumption_resolution,[],[f24,f43]) ).
fof(f24,plain,
( ! [X4] :
( ~ big_p(sK2(X4))
| ~ big_p(X4) )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f23,plain,
( spl6_1
<=> ! [X4] :
( ~ big_p(sK2(X4))
| ~ big_p(X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f65,plain,
( spl6_3
| ~ spl6_6 ),
inference(avatar_contradiction_clause,[],[f64]) ).
fof(f64,plain,
( $false
| spl6_3
| ~ spl6_6 ),
inference(resolution,[],[f43,f31]) ).
fof(f31,plain,
( ~ big_p(sK0)
| spl6_3 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f63,plain,
( ~ spl6_2
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f62]) ).
fof(f62,plain,
( $false
| ~ spl6_2
| ~ spl6_5 ),
inference(subsumption_resolution,[],[f40,f27]) ).
fof(f40,plain,
( big_p(sK1)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f38,plain,
( spl6_5
<=> big_p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f61,plain,
( ~ spl6_7
| spl6_6
| spl6_2
| spl6_6 ),
inference(avatar_split_clause,[],[f14,f42,f26,f42,f47]) ).
fof(f47,plain,
( spl6_7
<=> big_p(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).
fof(f14,plain,
! [X11,X8,X9] :
( big_p(X8)
| ~ big_p(X9)
| big_p(X11)
| ~ big_p(sK5) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
( ( ( ( ~ big_p(sK0)
| ! [X1] : ~ big_p(X1) )
& ( ! [X2] : big_p(X2)
| big_p(sK1) ) )
| ! [X4] :
( ( ~ big_p(sK2(X4))
| ~ big_p(X4) )
& ( big_p(sK2(X4))
| big_p(X4) ) ) )
& ( ( ( big_p(sK3)
| ~ big_p(sK4) )
& ( ! [X8] : big_p(X8)
| ! [X9] : ~ big_p(X9) ) )
| ! [X11] :
( ( big_p(sK5)
| ~ big_p(X11) )
& ( big_p(X11)
| ~ big_p(sK5) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f6,f12,f11,f10,f9,f8,f7]) ).
fof(f7,plain,
( ? [X0] : ~ big_p(X0)
=> ~ big_p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X3] : big_p(X3)
=> big_p(sK1) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X4] :
( ? [X5] :
( ( ~ big_p(X5)
| ~ big_p(X4) )
& ( big_p(X5)
| big_p(X4) ) )
=> ( ( ~ big_p(sK2(X4))
| ~ big_p(X4) )
& ( big_p(sK2(X4))
| big_p(X4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X6] : big_p(X6)
=> big_p(sK3) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( ? [X7] : ~ big_p(X7)
=> ~ big_p(sK4) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X10] :
! [X11] :
( ( big_p(X10)
| ~ big_p(X11) )
& ( big_p(X11)
| ~ big_p(X10) ) )
=> ! [X11] :
( ( big_p(sK5)
| ~ big_p(X11) )
& ( big_p(X11)
| ~ big_p(sK5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ( ( ? [X0] : ~ big_p(X0)
| ! [X1] : ~ big_p(X1) )
& ( ! [X2] : big_p(X2)
| ? [X3] : big_p(X3) ) )
| ! [X4] :
? [X5] :
( ( ~ big_p(X5)
| ~ big_p(X4) )
& ( big_p(X5)
| big_p(X4) ) ) )
& ( ( ( ? [X6] : big_p(X6)
| ? [X7] : ~ big_p(X7) )
& ( ! [X8] : big_p(X8)
| ! [X9] : ~ big_p(X9) ) )
| ? [X10] :
! [X11] :
( ( big_p(X10)
| ~ big_p(X11) )
& ( big_p(X11)
| ~ big_p(X10) ) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ( ( ? [X3] : ~ big_p(X3)
| ! [X2] : ~ big_p(X2) )
& ( ! [X3] : big_p(X3)
| ? [X2] : big_p(X2) ) )
| ! [X0] :
? [X1] :
( ( ~ big_p(X1)
| ~ big_p(X0) )
& ( big_p(X1)
| big_p(X0) ) ) )
& ( ( ( ? [X2] : big_p(X2)
| ? [X3] : ~ big_p(X3) )
& ( ! [X3] : big_p(X3)
| ! [X2] : ~ big_p(X2) ) )
| ? [X0] :
! [X1] :
( ( big_p(X0)
| ~ big_p(X1) )
& ( big_p(X1)
| ~ big_p(X0) ) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) )
<~> ( ? [X2] : big_p(X2)
<=> ! [X3] : big_p(X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) )
<=> ( ? [X2] : big_p(X2)
<=> ! [X3] : big_p(X3) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) )
<=> ( ? [X0] : big_p(X0)
<=> ! [X1] : big_p(X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) )
<=> ( ? [X0] : big_p(X0)
<=> ! [X1] : big_p(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rBuXes1537/Vampire---4.8_31584',x2125) ).
fof(f60,plain,
( spl6_2
| spl6_7
| spl6_2
| spl6_6 ),
inference(avatar_split_clause,[],[f15,f42,f26,f47,f26]) ).
fof(f15,plain,
! [X11,X8,X9] :
( big_p(X8)
| ~ big_p(X9)
| big_p(sK5)
| ~ big_p(X11) ),
inference(cnf_transformation,[],[f13]) ).
fof(f45,plain,
( spl6_4
| spl6_5
| spl6_6 ),
inference(avatar_split_clause,[],[f18,f42,f38,f34]) ).
fof(f18,plain,
! [X2,X4] :
( big_p(X2)
| big_p(sK1)
| big_p(sK2(X4))
| big_p(X4) ),
inference(cnf_transformation,[],[f13]) ).
fof(f32,plain,
( spl6_1
| spl6_2
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f21,f29,f26,f23]) ).
fof(f21,plain,
! [X1,X4] :
( ~ big_p(sK0)
| ~ big_p(X1)
| ~ big_p(sK2(X4))
| ~ big_p(X4) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SYN374+1 : TPTP v8.1.2. Released v2.0.0.
% 0.02/0.11 % 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.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 17:16:08 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_NEQ problem
% 0.11/0.32 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.rBuXes1537/Vampire---4.8_31584
% 0.62/0.77 % (31697)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.77 % (31696)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.77 % (31693)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.77 % (31692)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.77 % (31694)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.77 % (31695)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.77 % (31698)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.77 % (31699)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.77 % (31694)Also succeeded, but the first one will report.
% 0.62/0.77 % (31699)Also succeeded, but the first one will report.
% 0.62/0.77 % (31697)Also succeeded, but the first one will report.
% 0.62/0.77 % (31693)Also succeeded, but the first one will report.
% 0.62/0.77 % (31692)First to succeed.
% 0.62/0.77 % (31695)Also succeeded, but the first one will report.
% 0.62/0.77 % (31698)Also succeeded, but the first one will report.
% 0.62/0.77 % (31696)Also succeeded, but the first one will report.
% 0.62/0.77 % (31692)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-31691"
% 0.62/0.77 % (31692)Refutation found. Thanks to Tanya!
% 0.62/0.77 % SZS status Theorem for Vampire---4
% 0.62/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.77 % (31692)------------------------------
% 0.62/0.77 % (31692)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.77 % (31692)Termination reason: Refutation
% 0.62/0.77
% 0.62/0.77 % (31692)Memory used [KB]: 985
% 0.62/0.77 % (31692)Time elapsed: 0.005 s
% 0.62/0.77 % (31692)Instructions burned: 4 (million)
% 0.62/0.77 % (31691)Success in time 0.447 s
% 0.62/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------