TSTP Solution File: SWV001-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV001-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 : n004.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:27 EDT 2024
% Result : Unsatisfiable 0.60s 0.80s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 33 ( 4 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 86 ( 44 ~; 39 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 4 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 22 ( 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f185,plain,
$false,
inference(avatar_sat_refutation,[],[f26,f45,f165,f184]) ).
fof(f184,plain,
( ~ spl0_1
| spl0_4 ),
inference(avatar_contradiction_clause,[],[f183]) ).
fof(f183,plain,
( $false
| ~ spl0_1
| spl0_4 ),
inference(subsumption_resolution,[],[f176,f21]) ).
fof(f21,plain,
( ! [X0] : ~ q3(a,b,X0)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f20]) ).
fof(f20,plain,
( spl0_1
<=> ! [X0] : ~ q3(a,b,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f176,plain,
( q3(a,b,c)
| spl0_4 ),
inference(unit_resulting_resolution,[],[f12,f34,f4]) ).
fof(f4,axiom,
! [X2,X0,X1] :
( q3(X0,X1,X2)
| less_or_equalish(X0,X1)
| ~ q1(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f34,plain,
( ~ less_or_equalish(a,b)
| spl0_4 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f32,plain,
( spl0_4
<=> less_or_equalish(a,b) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f12,axiom,
q1(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f165,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f164]) ).
fof(f164,plain,
( $false
| ~ spl0_4 ),
inference(subsumption_resolution,[],[f163,f33]) ).
fof(f33,plain,
( less_or_equalish(a,b)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f163,plain,
( ~ less_or_equalish(a,b)
| ~ spl0_4 ),
inference(subsumption_resolution,[],[f153,f7]) ).
fof(f7,axiom,
! [X0] : less_or_equalish(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_reflexivity) ).
fof(f153,plain,
( ~ less_or_equalish(b,b)
| ~ less_or_equalish(a,b)
| ~ spl0_4 ),
inference(duplicate_literal_removal,[],[f149]) ).
fof(f149,plain,
( ~ less_or_equalish(b,b)
| ~ less_or_equalish(a,b)
| ~ less_or_equalish(b,b)
| ~ spl0_4 ),
inference(resolution,[],[f14,f50]) ).
fof(f50,plain,
( q4(a,b,b)
| ~ spl0_4 ),
inference(unit_resulting_resolution,[],[f48,f5]) ).
fof(f5,axiom,
! [X2,X0,X1] :
( q4(X0,X1,X1)
| ~ q2(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f48,plain,
( q2(a,b,c)
| ~ spl0_4 ),
inference(unit_resulting_resolution,[],[f12,f33,f3]) ).
fof(f3,axiom,
! [X2,X0,X1] :
( q2(X0,X1,X2)
| ~ less_or_equalish(X0,X1)
| ~ q1(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f14,axiom,
! [X3] :
( ~ q4(a,b,X3)
| ~ less_or_equalish(b,X3)
| ~ less_or_equalish(a,X3)
| ~ less_or_equalish(X3,b) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
fof(f45,plain,
( spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f41,f23,f32]) ).
fof(f23,plain,
( spl0_2
<=> less_or_equalish(b,a) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f41,plain,
( less_or_equalish(a,b)
| spl0_2 ),
inference(resolution,[],[f25,f10]) ).
fof(f10,axiom,
! [X0,X1] :
( less_or_equalish(X1,X0)
| less_or_equalish(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_less_or_equal) ).
fof(f25,plain,
( ~ less_or_equalish(b,a)
| spl0_2 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f26,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f18,f23,f20]) ).
fof(f18,plain,
! [X0] :
( ~ less_or_equalish(b,a)
| ~ q3(a,b,X0) ),
inference(subsumption_resolution,[],[f17,f7]) ).
fof(f17,plain,
! [X0] :
( ~ less_or_equalish(b,a)
| ~ less_or_equalish(a,a)
| ~ q3(a,b,X0) ),
inference(duplicate_literal_removal,[],[f15]) ).
fof(f15,plain,
! [X0] :
( ~ less_or_equalish(b,a)
| ~ less_or_equalish(a,a)
| ~ less_or_equalish(a,a)
| ~ q3(a,b,X0) ),
inference(resolution,[],[f13,f6]) ).
fof(f6,axiom,
! [X2,X0,X1] :
( q4(X0,X1,X0)
| ~ q3(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f13,axiom,
! [X3] :
( ~ q4(a,b,X3)
| ~ less_or_equalish(b,X3)
| ~ less_or_equalish(a,X3)
| ~ less_or_equalish(X3,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV001-1 : TPTP v8.2.0. Released v1.0.0.
% 0.13/0.14 % 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.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun May 19 06:56:08 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.36 This is a CNF_UNS_EPR_NEQ_NHN problem
% 0.13/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.60/0.79 % (2587)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.60/0.79 % (2581)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.60/0.79 % (2583)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.79 % (2584)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.60/0.79 % (2582)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.60/0.79 % (2586)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.60/0.79 % (2586)Refutation not found, incomplete strategy% (2586)------------------------------
% 0.60/0.79 % (2586)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (2586)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.79
% 0.60/0.79 % (2586)Memory used [KB]: 946
% 0.60/0.79 % (2586)Time elapsed: 0.002 s
% 0.60/0.79 % (2586)Instructions burned: 2 (million)
% 0.60/0.79 % (2584)Refutation not found, incomplete strategy% (2584)------------------------------
% 0.60/0.79 % (2584)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (2584)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.79
% 0.60/0.79 % (2584)Memory used [KB]: 963
% 0.60/0.79 % (2584)Time elapsed: 0.002 s
% 0.60/0.79 % (2584)Instructions burned: 2 (million)
% 0.60/0.79 % (2584)------------------------------
% 0.60/0.79 % (2584)------------------------------
% 0.60/0.79 % (2586)------------------------------
% 0.60/0.79 % (2586)------------------------------
% 0.60/0.79 % (2587)First to succeed.
% 0.60/0.79 % (2581)Also succeeded, but the first one will report.
% 0.60/0.79 % (2583)Also succeeded, but the first one will report.
% 0.60/0.79 % (2587)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2580"
% 0.60/0.80 % (2587)Refutation found. Thanks to Tanya!
% 0.60/0.80 % SZS status Unsatisfiable for theBenchmark
% 0.60/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.80 % (2587)------------------------------
% 0.60/0.80 % (2587)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80 % (2587)Termination reason: Refutation
% 0.60/0.80
% 0.60/0.80 % (2587)Memory used [KB]: 1006
% 0.60/0.80 % (2587)Time elapsed: 0.004 s
% 0.60/0.80 % (2587)Instructions burned: 8 (million)
% 0.60/0.80 % (2580)Success in time 0.428 s
% 0.60/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------