TSTP Solution File: SYN722+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN722+1 : TPTP v8.1.2. 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 : n018.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 04:36:02 EDT 2024
% Result : Theorem 0.61s 0.77s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 4 unt; 0 def)
% Number of atoms : 125 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 167 ( 75 ~; 70 |; 16 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 6 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 25 ( 19 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,plain,
$false,
inference(avatar_sat_refutation,[],[f19,f31,f33,f35,f39,f41]) ).
fof(f41,plain,
( spl1_2
| ~ spl1_3 ),
inference(avatar_contradiction_clause,[],[f40]) ).
fof(f40,plain,
( $false
| spl1_2
| ~ spl1_3 ),
inference(subsumption_resolution,[],[f18,f37]) ).
fof(f37,plain,
( ! [X0] : p(X0)
| ~ spl1_3 ),
inference(subsumption_resolution,[],[f36,f8]) ).
fof(f8,plain,
! [X2] : q(X2),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
( ( ~ p(b)
| ~ p(a) )
& ! [X0] :
( ~ q(d)
| ~ q(c)
| ~ q(sK0(X0))
| ~ q(X0)
| p(X0) )
& ! [X2] : q(X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).
fof(f6,plain,
! [X0] :
( ? [X1] :
( ~ q(d)
| ~ q(c)
| ~ q(X1)
| ~ q(X0)
| p(X0) )
=> ( ~ q(d)
| ~ q(c)
| ~ q(sK0(X0))
| ~ q(X0)
| p(X0) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ( ~ p(b)
| ~ p(a) )
& ! [X0] :
? [X1] :
( ~ q(d)
| ~ q(c)
| ~ q(X1)
| ~ q(X0)
| p(X0) )
& ! [X2] : q(X2) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f4,plain,
( ( ~ p(b)
| ~ p(a) )
& ! [X0] :
? [X1] :
( ~ q(d)
| ~ q(c)
| ~ q(X1)
| ~ q(X0)
| p(X0) )
& ! [X2] :
( q(X2)
& ( r(X2)
| p(X2) ) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
~ ~ ( ( ~ p(b)
| ~ p(a) )
& ! [X0] :
? [X1] :
( ~ q(d)
| ~ q(c)
| ~ q(X1)
| ~ q(X0)
| p(X0) )
& ! [X2] :
( q(X2)
& ( r(X2)
| p(X2) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ~ ( ( ~ p(b)
| ~ p(a) )
& ! [X1] :
? [X2] :
( ~ q(d)
| ~ q(c)
| ~ q(X2)
| ~ q(X1)
| p(X1) )
& ! [X0] :
( q(X0)
& ( r(X0)
| p(X0) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
~ ( ( ~ p(b)
| ~ p(a) )
& ! [X1] :
? [X2] :
( ~ q(d)
| ~ q(c)
| ~ q(X2)
| ~ q(X1)
| p(X1) )
& ! [X0] :
( q(X0)
& ( r(X0)
| p(X0) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gMLP2VrAA8/Vampire---4.8_31936',thm119) ).
fof(f36,plain,
( ! [X0] :
( p(X0)
| ~ q(X0) )
| ~ spl1_3 ),
inference(subsumption_resolution,[],[f22,f8]) ).
fof(f22,plain,
( ! [X0] :
( ~ q(sK0(X0))
| p(X0)
| ~ q(X0) )
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f21,plain,
( spl1_3
<=> ! [X0] :
( ~ q(sK0(X0))
| p(X0)
| ~ q(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
fof(f18,plain,
( ~ p(b)
| spl1_2 ),
inference(avatar_component_clause,[],[f16]) ).
fof(f16,plain,
( spl1_2
<=> p(b) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f39,plain,
( spl1_1
| ~ spl1_3 ),
inference(avatar_contradiction_clause,[],[f38]) ).
fof(f38,plain,
( $false
| spl1_1
| ~ spl1_3 ),
inference(resolution,[],[f37,f14]) ).
fof(f14,plain,
( ~ p(a)
| spl1_1 ),
inference(avatar_component_clause,[],[f12]) ).
fof(f12,plain,
( spl1_1
<=> p(a) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f35,plain,
spl1_4,
inference(avatar_contradiction_clause,[],[f34]) ).
fof(f34,plain,
( $false
| spl1_4 ),
inference(subsumption_resolution,[],[f26,f8]) ).
fof(f26,plain,
( ~ q(c)
| spl1_4 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f24,plain,
( spl1_4
<=> q(c) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
fof(f33,plain,
spl1_5,
inference(avatar_contradiction_clause,[],[f32]) ).
fof(f32,plain,
( $false
| spl1_5 ),
inference(subsumption_resolution,[],[f30,f8]) ).
fof(f30,plain,
( ~ q(d)
| spl1_5 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f28,plain,
( spl1_5
<=> q(d) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_5])]) ).
fof(f31,plain,
( spl1_3
| ~ spl1_4
| ~ spl1_5 ),
inference(avatar_split_clause,[],[f9,f28,f24,f21]) ).
fof(f9,plain,
! [X0] :
( ~ q(d)
| ~ q(c)
| ~ q(sK0(X0))
| ~ q(X0)
| p(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f19,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f10,f16,f12]) ).
fof(f10,plain,
( ~ p(b)
| ~ p(a) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN722+1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/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 : n018.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 : Tue Apr 30 17:35:44 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_EPR_NEQ problem
% 0.14/0.37 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.gMLP2VrAA8/Vampire---4.8_31936
% 0.61/0.77 % (32124)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.61/0.77 % (32127)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.61/0.77 % (32127)First to succeed.
% 0.61/0.77 % (32122)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.61/0.77 % (32120)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.61/0.77 % (32121)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.61/0.77 % (32125)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.61/0.77 % (32123)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.61/0.77 % (32124)Also succeeded, but the first one will report.
% 0.61/0.77 % (32126)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.61/0.77 % (32120)Also succeeded, but the first one will report.
% 0.61/0.77 % (32127)Refutation found. Thanks to Tanya!
% 0.61/0.77 % SZS status Theorem for Vampire---4
% 0.61/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.77 % (32127)------------------------------
% 0.61/0.77 % (32127)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (32127)Termination reason: Refutation
% 0.61/0.77
% 0.61/0.77 % (32127)Memory used [KB]: 971
% 0.61/0.77 % (32127)Time elapsed: 0.003 s
% 0.61/0.77 % (32127)Instructions burned: 3 (million)
% 0.61/0.77 % (32127)------------------------------
% 0.61/0.77 % (32127)------------------------------
% 0.61/0.77 % (32105)Success in time 0.396 s
% 0.61/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------