TSTP Solution File: SWV009-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n002.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 Aug 31 18:55:12 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 62 ( 31 ~; 31 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f40,plain,
$false,
inference(subsumption_resolution,[],[f39,f15]) ).
fof(f15,plain,
~ less_or_equal(i,p),
inference(subsumption_resolution,[],[f14,f4]) ).
fof(f4,axiom,
less_or_equal(p,q),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
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(i,p)
| ~ less_or_equal(p,q) ),
inference(resolution,[],[f8,f9]) ).
fof(f9,axiom,
~ less_or_equal(a(p),a(q)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
fof(f8,axiom,
! [X0,X1] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(i,X0)
| ~ less_or_equal(X1,n) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
fof(f39,plain,
less_or_equal(i,p),
inference(subsumption_resolution,[],[f38,f12]) ).
fof(f12,plain,
~ less_or_equal(q,j),
inference(subsumption_resolution,[],[f11,f4]) ).
fof(f11,plain,
( ~ less_or_equal(q,j)
| ~ less_or_equal(p,q) ),
inference(subsumption_resolution,[],[f10,f3]) ).
fof(f3,axiom,
less_or_equal(m,p),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f10,plain,
( ~ less_or_equal(m,p)
| ~ less_or_equal(p,q)
| ~ less_or_equal(q,j) ),
inference(resolution,[],[f7,f9]) ).
fof(f7,axiom,
! [X0,X1] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,j) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
fof(f38,plain,
( less_or_equal(q,j)
| less_or_equal(i,p) ),
inference(subsumption_resolution,[],[f37,f3]) ).
fof(f37,plain,
( ~ less_or_equal(m,p)
| less_or_equal(q,j)
| less_or_equal(i,p) ),
inference(subsumption_resolution,[],[f36,f5]) ).
fof(f36,plain,
( ~ less_or_equal(q,n)
| less_or_equal(q,j)
| ~ less_or_equal(m,p)
| less_or_equal(i,p) ),
inference(resolution,[],[f27,f9]) ).
fof(f27,plain,
! [X2,X1] :
( less_or_equal(a(X2),a(X1))
| less_or_equal(X1,j)
| less_or_equal(i,X2)
| ~ less_or_equal(m,X2)
| ~ less_or_equal(X1,n) ),
inference(resolution,[],[f17,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( less(X1,X0)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f17,plain,
! [X2,X1] :
( ~ less(X1,i)
| less_or_equal(X2,j)
| ~ less_or_equal(m,X1)
| less_or_equal(a(X1),a(X2))
| ~ less_or_equal(X2,n) ),
inference(resolution,[],[f6,f1]) ).
fof(f6,axiom,
! [X0,X1] :
( ~ less(j,X1)
| ~ less(X0,i)
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,n)
| less_or_equal(a(X0),a(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n002.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 19:15:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.49 % (7067)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.49 % (7067)First to succeed.
% 0.19/0.49 % (7049)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.50 % (7054)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50 % (7075)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.50 % (7067)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (7067)------------------------------
% 0.19/0.50 % (7067)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (7067)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (7067)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (7067)Memory used [KB]: 5373
% 0.19/0.50 % (7067)Time elapsed: 0.096 s
% 0.19/0.50 % (7067)Instructions burned: 2 (million)
% 0.19/0.50 % (7067)------------------------------
% 0.19/0.50 % (7067)------------------------------
% 0.19/0.50 % (7046)Success in time 0.158 s
%------------------------------------------------------------------------------