TSTP Solution File: SYN922+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN922+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 : n014.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:51 EDT 2024
% Result : Theorem 0.55s 0.75s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 52 ( 1 unt; 0 def)
% Number of atoms : 124 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 116 ( 44 ~; 50 |; 8 &)
% ( 13 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 11 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 31 ( 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f82,plain,
$false,
inference(avatar_sat_refutation,[],[f22,f26,f34,f35,f48,f55,f57,f65,f70,f72,f81]) ).
fof(f81,plain,
( ~ spl6_3
| ~ spl6_5
| spl6_6 ),
inference(avatar_contradiction_clause,[],[f80]) ).
fof(f80,plain,
( $false
| ~ spl6_3
| ~ spl6_5
| spl6_6 ),
inference(subsumption_resolution,[],[f79,f25]) ).
fof(f25,plain,
( ! [X2] : p(X2)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f24,plain,
( spl6_3
<=> ! [X2] : p(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f79,plain,
( ~ p(sK0)
| ~ spl6_5
| spl6_6 ),
inference(subsumption_resolution,[],[f76,f33]) ).
fof(f33,plain,
( ! [X1] : q(X1)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f32,plain,
( spl6_5
<=> ! [X1] : q(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f76,plain,
( ~ q(sK0)
| ~ p(sK0)
| spl6_6 ),
inference(resolution,[],[f5,f39]) ).
fof(f39,plain,
( ~ sP1(sK0)
| spl6_6 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f37,plain,
( spl6_6
<=> sP1(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f5,plain,
! [X0] :
( sP1(X0)
| ~ q(X0)
| ~ p(X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f4,plain,
( ! [X0] :
( q(X0)
& p(X0) )
<~> ( ! [X1] : q(X1)
& ! [X2] : p(X2) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ! [X0] :
( q(X0)
& p(X0) )
<=> ( ! [X1] : q(X1)
& ! [X2] : p(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( q(X0)
& p(X0) )
<=> ( ! [X0] : q(X0)
& ! [X0] : p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( q(X0)
& p(X0) )
<=> ( ! [X0] : q(X0)
& ! [X0] : p(X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QMEaHY2OYG/Vampire---4.8_28607',prove_this) ).
fof(f72,plain,
( ~ spl6_3
| spl6_8 ),
inference(avatar_contradiction_clause,[],[f71]) ).
fof(f71,plain,
( $false
| ~ spl6_3
| spl6_8 ),
inference(subsumption_resolution,[],[f47,f25]) ).
fof(f47,plain,
( ~ p(sK2)
| spl6_8 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f45,plain,
( spl6_8
<=> p(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_8])]) ).
fof(f70,plain,
( ~ spl6_5
| spl6_7 ),
inference(avatar_contradiction_clause,[],[f67]) ).
fof(f67,plain,
( $false
| ~ spl6_5
| spl6_7 ),
inference(unit_resulting_resolution,[],[f43,f33]) ).
fof(f43,plain,
( ~ q(sK3)
| spl6_7 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f41,plain,
( spl6_7
<=> q(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).
fof(f65,plain,
( ~ spl6_2
| spl6_7 ),
inference(avatar_contradiction_clause,[],[f64]) ).
fof(f64,plain,
( $false
| ~ spl6_2
| spl6_7 ),
inference(subsumption_resolution,[],[f58,f21]) ).
fof(f21,plain,
( ! [X0] : sP1(X0)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f20]) ).
fof(f20,plain,
( spl6_2
<=> ! [X0] : sP1(X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f58,plain,
( ~ sP1(sK3)
| spl6_7 ),
inference(unit_resulting_resolution,[],[f43,f7]) ).
fof(f7,plain,
! [X0] :
( ~ sP1(X0)
| q(X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f57,plain,
( ~ spl6_2
| spl6_6 ),
inference(avatar_contradiction_clause,[],[f56]) ).
fof(f56,plain,
( $false
| ~ spl6_2
| spl6_6 ),
inference(subsumption_resolution,[],[f39,f21]) ).
fof(f55,plain,
( ~ spl6_2
| spl6_8 ),
inference(avatar_contradiction_clause,[],[f54]) ).
fof(f54,plain,
( $false
| ~ spl6_2
| spl6_8 ),
inference(subsumption_resolution,[],[f49,f21]) ).
fof(f49,plain,
( ~ sP1(sK2)
| spl6_8 ),
inference(unit_resulting_resolution,[],[f47,f6]) ).
fof(f6,plain,
! [X0] :
( ~ sP1(X0)
| p(X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f48,plain,
( ~ spl6_6
| ~ spl6_7
| ~ spl6_8 ),
inference(avatar_split_clause,[],[f8,f45,f41,f37]) ).
fof(f8,plain,
( ~ p(sK2)
| ~ q(sK3)
| ~ sP1(sK0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f35,plain,
( spl6_4
| spl6_2 ),
inference(avatar_split_clause,[],[f11,f20,f28]) ).
fof(f28,plain,
( spl6_4
<=> sP4 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f11,plain,
! [X0] :
( sP1(X0)
| sP4 ),
inference(cnf_transformation,[],[f11_D]) ).
fof(f11_D,plain,
( ! [X0] : sP1(X0)
<=> ~ sP4 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP4])]) ).
fof(f34,plain,
( ~ spl6_4
| spl6_5 ),
inference(avatar_split_clause,[],[f12,f32,f28]) ).
fof(f12,plain,
! [X1] :
( q(X1)
| ~ sP4 ),
inference(general_splitting,[],[f10,f11_D]) ).
fof(f10,plain,
! [X0,X1] :
( q(X1)
| sP1(X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f26,plain,
( spl6_1
| spl6_3 ),
inference(avatar_split_clause,[],[f13,f24,f16]) ).
fof(f16,plain,
( spl6_1
<=> sP5 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f13,plain,
! [X2] :
( p(X2)
| sP5 ),
inference(cnf_transformation,[],[f13_D]) ).
fof(f13_D,plain,
( ! [X2] : p(X2)
<=> ~ sP5 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP5])]) ).
fof(f22,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f14,f20,f16]) ).
fof(f14,plain,
! [X0] :
( sP1(X0)
| ~ sP5 ),
inference(general_splitting,[],[f9,f13_D]) ).
fof(f9,plain,
! [X2,X0] :
( p(X2)
| sP1(X0) ),
inference(cnf_transformation,[],[f4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN922+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.15 % 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.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 17:33:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_EPR_NEQ problem
% 0.14/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/tmp/tmp.QMEaHY2OYG/Vampire---4.8_28607
% 0.55/0.74 % (28884)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.55/0.74 % (28878)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.55/0.74 % (28880)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.55/0.74 % (28884)First to succeed.
% 0.55/0.74 % (28879)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.55/0.74 % (28881)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.55/0.74 % (28882)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.55/0.74 % (28883)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.55/0.75 % (28884)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-28787"
% 0.55/0.75 % (28879)Also succeeded, but the first one will report.
% 0.55/0.75 % (28880)Also succeeded, but the first one will report.
% 0.55/0.75 % (28881)Also succeeded, but the first one will report.
% 0.55/0.75 % (28878)Also succeeded, but the first one will report.
% 0.55/0.75 % (28882)Also succeeded, but the first one will report.
% 0.55/0.75 % (28883)Also succeeded, but the first one will report.
% 0.55/0.75 % (28884)Refutation found. Thanks to Tanya!
% 0.55/0.75 % SZS status Theorem for Vampire---4
% 0.55/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.75 % (28884)------------------------------
% 0.55/0.75 % (28884)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (28884)Termination reason: Refutation
% 0.55/0.75
% 0.55/0.75 % (28884)Memory used [KB]: 985
% 0.55/0.75 % (28884)Time elapsed: 0.002 s
% 0.55/0.75 % (28884)Instructions burned: 3 (million)
% 0.55/0.75 % (28787)Success in time 0.377 s
% 0.55/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------