TSTP Solution File: SYN728+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN728+1 : TPTP v8.2.0. Released v2.5.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 : n027.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 : Tue May 21 08:24:24 EDT 2024
% Result : Theorem 0.70s 0.87s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 2 unt; 0 def)
% Number of atoms : 123 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 144 ( 55 ~; 44 |; 30 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 77 ( 60 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f39,plain,
$false,
inference(avatar_sat_refutation,[],[f22,f29,f34,f36,f38]) ).
fof(f38,plain,
( ~ spl2_1
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f37]) ).
fof(f37,plain,
( $false
| ~ spl2_1
| ~ spl2_4 ),
inference(resolution,[],[f17,f28]) ).
fof(f28,plain,
( ! [X6] : p(X6,X6)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f27,plain,
( spl2_4
<=> ! [X6] : p(X6,X6) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
fof(f17,plain,
( ! [X1] : ~ p(g(sK0),X1)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f16]) ).
fof(f16,plain,
( spl2_1
<=> ! [X1] : ~ p(g(sK0),X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f36,plain,
( spl2_2
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f35]) ).
fof(f35,plain,
( $false
| spl2_2
| ~ spl2_4 ),
inference(resolution,[],[f28,f21]) ).
fof(f21,plain,
( ~ p(sK0,sK0)
| spl2_2 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f19,plain,
( spl2_2
<=> p(sK0,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f34,plain,
~ spl2_3,
inference(avatar_contradiction_clause,[],[f33]) ).
fof(f33,plain,
( $false
| ~ spl2_3 ),
inference(resolution,[],[f31,f32]) ).
fof(f32,plain,
( ! [X3] : q(f(X3,sK1(X3)))
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f12,f25]) ).
fof(f25,plain,
( ! [X7,X5] : ~ p(X5,X7)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f24,plain,
( spl2_3
<=> ! [X5,X7] : ~ p(X5,X7) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f12,plain,
! [X3] :
( q(f(X3,sK1(X3)))
| p(X3,sK1(X3)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ! [X1] :
( ~ p(sK0,sK0)
| ~ p(g(sK0),X1) )
& ! [X2] :
( ~ m(g(X2))
| ~ q(X2) )
& ! [X3] :
( ( q(f(X3,sK1(X3)))
& m(X3) )
| p(X3,sK1(X3)) )
& ! [X5] :
( ! [X6] : p(X6,X6)
| ! [X7] : ~ p(X5,X7) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0] :
! [X1] :
( ~ p(X0,X0)
| ~ p(g(X0),X1) )
=> ! [X1] :
( ~ p(sK0,sK0)
| ~ p(g(sK0),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X3] :
( ? [X4] :
( ( q(f(X3,X4))
& m(X3) )
| p(X3,X4) )
=> ( ( q(f(X3,sK1(X3)))
& m(X3) )
| p(X3,sK1(X3)) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ? [X0] :
! [X1] :
( ~ p(X0,X0)
| ~ p(g(X0),X1) )
& ! [X2] :
( ~ m(g(X2))
| ~ q(X2) )
& ! [X3] :
? [X4] :
( ( q(f(X3,X4))
& m(X3) )
| p(X3,X4) )
& ! [X5] :
( ! [X6] : p(X6,X6)
| ! [X7] : ~ p(X5,X7) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ? [X6] :
! [X7] :
( ~ p(X6,X6)
| ~ p(g(X6),X7) )
& ! [X0] :
( ~ m(g(X0))
| ~ q(X0) )
& ! [X1] :
? [X2] :
( ( q(f(X1,X2))
& m(X1) )
| p(X1,X2) )
& ! [X3] :
( ! [X5] : p(X5,X5)
| ! [X4] : ~ p(X3,X4) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ? [X6] :
! [X7] :
( ~ p(X6,X6)
| ~ p(g(X6),X7) )
& ! [X0] :
( ~ m(g(X0))
| ~ q(X0) )
& ! [X1] :
? [X2] :
( ( q(f(X1,X2))
& m(X1) )
| p(X1,X2) )
& ! [X3] :
( ! [X5] : p(X5,X5)
| ! [X4] : ~ p(X3,X4) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ! [X0] :
( q(X0)
=> ~ m(g(X0)) )
& ! [X1] :
? [X2] :
( ( q(f(X1,X2))
& m(X1) )
| p(X1,X2) )
& ! [X3] :
( ? [X4] : p(X3,X4)
=> ! [X5] : p(X5,X5) ) )
=> ! [X6] :
? [X7] :
( p(X6,X6)
& p(g(X6),X7) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ! [X5] :
( q(X5)
=> ~ m(g(X5)) )
& ! [X3] :
? [X4] :
( ( q(f(X3,X4))
& m(X3) )
| p(X3,X4) )
& ! [X0] :
( ? [X1] : p(X0,X1)
=> ! [X2] : p(X2,X2) ) )
=> ! [X6] :
? [X7] :
( p(X6,X6)
& p(g(X6),X7) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ! [X5] :
( q(X5)
=> ~ m(g(X5)) )
& ! [X3] :
? [X4] :
( ( q(f(X3,X4))
& m(X3) )
| p(X3,X4) )
& ! [X0] :
( ? [X1] : p(X0,X1)
=> ! [X2] : p(X2,X2) ) )
=> ! [X6] :
? [X7] :
( p(X6,X6)
& p(g(X6),X7) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm69) ).
fof(f31,plain,
( ! [X0] : ~ q(X0)
| ~ spl2_3 ),
inference(resolution,[],[f30,f13]) ).
fof(f13,plain,
! [X2] :
( ~ m(g(X2))
| ~ q(X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f30,plain,
( ! [X3] : m(X3)
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f11,f25]) ).
fof(f11,plain,
! [X3] :
( m(X3)
| p(X3,sK1(X3)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f29,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f10,f27,f24]) ).
fof(f10,plain,
! [X6,X7,X5] :
( p(X6,X6)
| ~ p(X5,X7) ),
inference(cnf_transformation,[],[f9]) ).
fof(f22,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f14,f19,f16]) ).
fof(f14,plain,
! [X1] :
( ~ p(sK0,sK0)
| ~ p(g(sK0),X1) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN728+1 : TPTP v8.2.0. Released v2.5.0.
% 0.03/0.13 % 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.12/0.36 % Computer : n027.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8042.1875MB
% 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon May 20 15:44:08 EDT 2024
% 0.21/0.36 % CPUTime :
% 0.21/0.36 This is a FOF_THM_RFO_NEQ problem
% 0.21/0.36 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/benchmark/theBenchmark.p
% 0.70/0.87 % (11460)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 theBenchmark for (2995ds/34Mi)
% 0.70/0.87 % (11462)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.70/0.87 % (11463)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.70/0.87 % (11464)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 theBenchmark for (2995ds/34Mi)
% 0.70/0.87 % (11465)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.70/0.87 % (11461)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 theBenchmark for (2995ds/51Mi)
% 0.70/0.87 % (11466)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 theBenchmark for (2995ds/83Mi)
% 0.70/0.87 % (11467)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.70/0.87 % (11461)Also succeeded, but the first one will report.
% 0.70/0.87 % (11464)Also succeeded, but the first one will report.
% 0.70/0.87 % (11462)Also succeeded, but the first one will report.
% 0.70/0.87 % (11465)Also succeeded, but the first one will report.
% 0.70/0.87 % (11460)First to succeed.
% 0.70/0.87 % (11463)Also succeeded, but the first one will report.
% 0.70/0.87 % (11466)Also succeeded, but the first one will report.
% 0.70/0.87 % (11467)Also succeeded, but the first one will report.
% 0.70/0.87 % (11460)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11459"
% 0.70/0.87 % (11460)Refutation found. Thanks to Tanya!
% 0.70/0.87 % SZS status Theorem for theBenchmark
% 0.70/0.87 % SZS output start Proof for theBenchmark
% See solution above
% 0.70/0.87 % (11460)------------------------------
% 0.70/0.87 % (11460)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.87 % (11460)Termination reason: Refutation
% 0.70/0.87
% 0.70/0.87 % (11460)Memory used [KB]: 971
% 0.70/0.87 % (11460)Time elapsed: 0.004 s
% 0.70/0.87 % (11460)Instructions burned: 3 (million)
% 0.70/0.87 % (11459)Success in time 0.499 s
% 0.70/0.87 % Vampire---4.8 exiting
%------------------------------------------------------------------------------