TSTP Solution File: SWV002-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV002-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 : n021.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.51s 0.69s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 34 ( 11 unt; 0 def)
% Number of atoms : 61 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 56 ( 29 ~; 23 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 10 ( 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f208,plain,
$false,
inference(avatar_sat_refutation,[],[f79,f175,f182,f195,f207]) ).
fof(f207,plain,
~ spl0_18,
inference(avatar_contradiction_clause,[],[f206]) ).
fof(f206,plain,
( $false
| ~ spl0_18 ),
inference(subsumption_resolution,[],[f201,f100]) ).
fof(f100,plain,
~ less_than(a(k),a(j)),
inference(resolution,[],[f17,f10]) ).
fof(f10,axiom,
! [X0,X1] :
( ~ less_than(X1,X0)
| ~ less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',anti_symmetry_of_less_than) ).
fof(f17,axiom,
less_than(a(j),a(k)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f201,plain,
( less_than(a(k),a(j))
| ~ spl0_18 ),
inference(superposition,[],[f23,f174]) ).
fof(f174,plain,
( a(k) = a(q)
| ~ spl0_18 ),
inference(avatar_component_clause,[],[f172]) ).
fof(f172,plain,
( spl0_18
<=> a(k) = a(q) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_18])]) ).
fof(f23,axiom,
less_than(a(q),a(j)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
fof(f195,plain,
~ spl0_10,
inference(avatar_contradiction_clause,[],[f194]) ).
fof(f194,plain,
( $false
| ~ spl0_10 ),
inference(subsumption_resolution,[],[f188,f9]) ).
fof(f9,axiom,
! [X0] : ~ less_than(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_not_less_than_x) ).
fof(f188,plain,
( less_than(a(j),a(j))
| ~ spl0_10 ),
inference(superposition,[],[f23,f78]) ).
fof(f78,plain,
( j = q
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f76,plain,
( spl0_10
<=> j = q ),
introduced(avatar_definition,[new_symbols(naming,[spl0_10])]) ).
fof(f182,plain,
( ~ spl0_9
| ~ spl0_17 ),
inference(avatar_split_clause,[],[f181,f168,f72]) ).
fof(f72,plain,
( spl0_9
<=> less_than(q,j) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
fof(f168,plain,
( spl0_17
<=> less_than(a(q),a(k)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_17])]) ).
fof(f181,plain,
( ~ less_than(q,j)
| ~ spl0_17 ),
inference(subsumption_resolution,[],[f176,f21]) ).
fof(f21,axiom,
~ less_than(q,i),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
fof(f176,plain,
( ~ less_than(q,j)
| less_than(q,i)
| ~ spl0_17 ),
inference(resolution,[],[f170,f18]) ).
fof(f18,axiom,
! [X0] :
( ~ less_than(a(X0),a(k))
| ~ less_than(X0,j)
| less_than(X0,i) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
fof(f170,plain,
( less_than(a(q),a(k))
| ~ spl0_17 ),
inference(avatar_component_clause,[],[f168]) ).
fof(f175,plain,
( spl0_17
| spl0_18 ),
inference(avatar_split_clause,[],[f165,f172,f168]) ).
fof(f165,plain,
( a(k) = a(q)
| less_than(a(q),a(k)) ),
inference(resolution,[],[f162,f8]) ).
fof(f8,axiom,
! [X0,X1] :
( less_than(X1,X0)
| X0 = X1
| less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_related) ).
fof(f162,plain,
~ less_than(a(k),a(q)),
inference(resolution,[],[f105,f17]) ).
fof(f105,plain,
! [X0] :
( ~ less_than(a(j),X0)
| ~ less_than(X0,a(q)) ),
inference(resolution,[],[f101,f7]) ).
fof(f7,axiom,
! [X2,X0,X1] :
( less_than(X0,X2)
| ~ less_than(X0,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less_than) ).
fof(f101,plain,
~ less_than(a(j),a(q)),
inference(resolution,[],[f23,f10]) ).
fof(f79,plain,
( spl0_9
| spl0_10 ),
inference(avatar_split_clause,[],[f69,f76,f72]) ).
fof(f69,plain,
( j = q
| less_than(q,j) ),
inference(resolution,[],[f22,f8]) ).
fof(f22,axiom,
~ less_than(j,q),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SWV002-1 : TPTP v8.2.0. Released v1.0.0.
% 0.13/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.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 06:16:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.13/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.68 % (13782)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.51/0.69 % (13777)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.69 % (13780)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.69 % (13781)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.69 % (13784)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.69 % (13782)First to succeed.
% 0.51/0.69 % (13783)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.69 % (13782)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13776"
% 0.51/0.69 % (13782)Refutation found. Thanks to Tanya!
% 0.51/0.69 % SZS status Unsatisfiable for theBenchmark
% 0.51/0.69 % SZS output start Proof for theBenchmark
% See solution above
% 0.51/0.69 % (13782)------------------------------
% 0.51/0.69 % (13782)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.69 % (13782)Termination reason: Refutation
% 0.51/0.69
% 0.51/0.69 % (13782)Memory used [KB]: 1093
% 0.51/0.69 % (13782)Time elapsed: 0.004 s
% 0.51/0.69 % (13782)Instructions burned: 7 (million)
% 0.51/0.69 % (13776)Success in time 0.332 s
% 0.51/0.69 % Vampire---4.8 exiting
%------------------------------------------------------------------------------