TSTP Solution File: SWV009-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV009-1 : TPTP v8.2.0. Released v1.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 : n017.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 05:53:28 EDT 2024
% Result : Unsatisfiable 0.51s 0.73s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 9 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 68 ( 36 ~; 30 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 8 ( 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f34,plain,
$false,
inference(avatar_sat_refutation,[],[f27,f30,f33]) ).
fof(f33,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f32]) ).
fof(f32,plain,
( $false
| spl0_2 ),
inference(subsumption_resolution,[],[f31,f12]) ).
fof(f12,plain,
~ less_or_equal(q,j),
inference(subsumption_resolution,[],[f11,f3]) ).
fof(f3,axiom,
less_or_equal(m,p),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f11,plain,
( ~ less_or_equal(q,j)
| ~ less_or_equal(m,p) ),
inference(subsumption_resolution,[],[f10,f4]) ).
fof(f4,axiom,
less_or_equal(p,q),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f10,plain,
( ~ less_or_equal(q,j)
| ~ less_or_equal(p,q)
| ~ less_or_equal(m,p) ),
inference(resolution,[],[f7,f9]) ).
fof(f9,axiom,
~ less_or_equal(a(p),a(q)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
fof(f7,axiom,
! [X0,X1] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(X1,j)
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(m,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
fof(f31,plain,
( less_or_equal(q,j)
| spl0_2 ),
inference(resolution,[],[f26,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( less(X1,X0)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f26,plain,
( ~ less(j,q)
| spl0_2 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f24,plain,
( spl0_2
<=> less(j,q) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f30,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f29]) ).
fof(f29,plain,
( $false
| spl0_1 ),
inference(subsumption_resolution,[],[f28,f15]) ).
fof(f15,plain,
~ less_or_equal(i,p),
inference(subsumption_resolution,[],[f14,f4]) ).
fof(f14,plain,
( ~ less_or_equal(p,q)
| ~ less_or_equal(i,p) ),
inference(subsumption_resolution,[],[f13,f5]) ).
fof(f5,axiom,
less_or_equal(q,n),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f13,plain,
( ~ less_or_equal(q,n)
| ~ less_or_equal(p,q)
| ~ less_or_equal(i,p) ),
inference(resolution,[],[f8,f9]) ).
fof(f8,axiom,
! [X0,X1] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(X1,n)
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(i,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
fof(f28,plain,
( less_or_equal(i,p)
| spl0_1 ),
inference(resolution,[],[f22,f1]) ).
fof(f22,plain,
( ~ less(p,i)
| spl0_1 ),
inference(avatar_component_clause,[],[f20]) ).
fof(f20,plain,
( spl0_1
<=> less(p,i) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f27,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f18,f24,f20]) ).
fof(f18,plain,
( ~ less(j,q)
| ~ less(p,i) ),
inference(subsumption_resolution,[],[f17,f3]) ).
fof(f17,plain,
( ~ less(j,q)
| ~ less(p,i)
| ~ less_or_equal(m,p) ),
inference(subsumption_resolution,[],[f16,f5]) ).
fof(f16,plain,
( ~ less_or_equal(q,n)
| ~ less(j,q)
| ~ less(p,i)
| ~ less_or_equal(m,p) ),
inference(resolution,[],[f6,f9]) ).
fof(f6,axiom,
! [X0,X1] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(X1,n)
| ~ less(j,X1)
| ~ less(X0,i)
| ~ less_or_equal(m,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV009-1 : TPTP v8.2.0. Released v1.0.0.
% 0.04/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.14/0.35 % Computer : n017.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 : Sun May 19 08:57:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a CNF_UNS_RFO_NEQ_NHN 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/benchmark/theBenchmark.p
% 0.51/0.72 % (5604)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 (2996ds/51Mi)
% 0.51/0.72 % (5603)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 (2996ds/34Mi)
% 0.51/0.72 % (5605)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.51/0.72 % (5606)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.51/0.72 % (5609)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 (2996ds/83Mi)
% 0.51/0.72 % (5610)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 (2996ds/56Mi)
% 0.51/0.72 % (5605)Also succeeded, but the first one will report.
% 0.51/0.72 % (5603)First to succeed.
% 0.51/0.72 % (5606)Also succeeded, but the first one will report.
% 0.51/0.72 % (5604)Also succeeded, but the first one will report.
% 0.51/0.72 % (5607)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 (2996ds/34Mi)
% 0.51/0.72 % (5609)Also succeeded, but the first one will report.
% 0.51/0.72 % (5603)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5602"
% 0.51/0.73 % (5607)Also succeeded, but the first one will report.
% 0.51/0.73 % (5603)Refutation found. Thanks to Tanya!
% 0.51/0.73 % SZS status Unsatisfiable for theBenchmark
% 0.51/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.51/0.73 % (5603)------------------------------
% 0.51/0.73 % (5603)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.73 % (5603)Termination reason: Refutation
% 0.51/0.73
% 0.51/0.73 % (5603)Memory used [KB]: 983
% 0.51/0.73 % (5603)Time elapsed: 0.003 s
% 0.51/0.73 % (5603)Instructions burned: 3 (million)
% 0.51/0.73 % (5602)Success in time 0.369 s
% 0.51/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------