TSTP Solution File: HEN012-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : HEN012-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 : n001.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 16:24:42 EDT 2022
% Result : Unsatisfiable 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 55 ( 9 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 53 ( 27 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 67 ( 67 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f269,plain,
$false,
inference(resolution,[],[f241,f10]) ).
fof(f10,axiom,
~ less_equal(x,x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_X_less_than_or_equal_to_X) ).
fof(f241,plain,
! [X0] : less_equal(X0,X0),
inference(resolution,[],[f234,f2]) ).
fof(f2,axiom,
! [X0,X1] :
( ~ quotient(X0,X1,zero)
| less_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_equal_quotient) ).
fof(f234,plain,
! [X0] : quotient(X0,X0,zero),
inference(superposition,[],[f8,f203]) ).
fof(f203,plain,
! [X0] : zero = divide(X0,X0),
inference(resolution,[],[f193,f14]) ).
fof(f14,plain,
! [X0] :
( ~ less_equal(X0,zero)
| zero = X0 ),
inference(resolution,[],[f6,f5]) ).
fof(f5,axiom,
! [X0] : less_equal(zero,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_is_smallest) ).
fof(f6,axiom,
! [X0,X1] :
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X0)
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_equal_and_equal) ).
fof(f193,plain,
! [X12] : less_equal(divide(X12,X12),zero),
inference(resolution,[],[f180,f2]) ).
fof(f180,plain,
! [X0] : quotient(divide(X0,X0),zero,zero),
inference(superposition,[],[f8,f172]) ).
fof(f172,plain,
! [X14] : zero = divide(divide(X14,X14),zero),
inference(subsumption_resolution,[],[f168,f5]) ).
fof(f168,plain,
! [X14] :
( ~ less_equal(zero,divide(divide(X14,X14),zero))
| zero = divide(divide(X14,X14),zero) ),
inference(resolution,[],[f155,f6]) ).
fof(f155,plain,
! [X2] : less_equal(divide(divide(X2,X2),zero),zero),
inference(superposition,[],[f120,f60]) ).
fof(f60,plain,
! [X2,X3] : zero = divide(divide(X2,X3),X2),
inference(resolution,[],[f31,f12]) ).
fof(f12,plain,
! [X0,X1] : less_equal(divide(X0,X1),X0),
inference(resolution,[],[f3,f8]) ).
fof(f3,axiom,
! [X2,X0,X1] :
( ~ quotient(X0,X1,X2)
| less_equal(X2,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor_existence) ).
fof(f31,plain,
! [X2,X3] :
( ~ less_equal(X2,X3)
| zero = divide(X2,X3) ),
inference(resolution,[],[f16,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( quotient(X0,X1,zero)
| ~ less_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_less_equal) ).
fof(f16,plain,
! [X2,X0,X1] :
( ~ quotient(X0,X1,X2)
| divide(X0,X1) = X2 ),
inference(resolution,[],[f9,f8]) ).
fof(f9,axiom,
! [X2,X0,X1,X8] :
( ~ quotient(X0,X1,X2)
| X2 = X8
| ~ quotient(X0,X1,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',well_defined) ).
fof(f120,plain,
! [X0,X1] : less_equal(divide(divide(X0,X0),divide(X1,X0)),zero),
inference(resolution,[],[f110,f8]) ).
fof(f110,plain,
! [X2,X0,X1] :
( ~ quotient(divide(X1,X1),divide(X2,X1),X0)
| less_equal(X0,zero) ),
inference(resolution,[],[f69,f81]) ).
fof(f81,plain,
! [X8,X7] : quotient(divide(X7,X8),X7,zero),
inference(superposition,[],[f8,f60]) ).
fof(f69,plain,
! [X2,X3,X0,X1,X4] :
( ~ quotient(divide(X0,X2),X1,X4)
| less_equal(X3,X4)
| ~ quotient(divide(X0,X1),divide(X2,X1),X3) ),
inference(resolution,[],[f42,f8]) ).
fof(f42,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ quotient(X0,X2,X4)
| ~ quotient(X4,divide(X1,X2),X5)
| ~ quotient(divide(X0,X1),X2,X3)
| less_equal(X5,X3) ),
inference(resolution,[],[f18,f8]) ).
fof(f18,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ quotient(X6,X4,X0)
| ~ quotient(X0,X1,X2)
| ~ quotient(X3,divide(X4,X1),X5)
| ~ quotient(X6,X1,X3)
| less_equal(X5,X2) ),
inference(resolution,[],[f4,f8]) ).
fof(f4,axiom,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ quotient(X1,X2,X4)
| ~ quotient(X3,X2,X7)
| ~ quotient(X5,X4,X6)
| less_equal(X6,X7)
| ~ quotient(X0,X1,X3)
| ~ quotient(X0,X2,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_property) ).
fof(f8,axiom,
! [X0,X1] : quotient(X0,X1,divide(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',closure) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : HEN012-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % 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 : n001.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.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 29 23:16:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.42 % (23163)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.19/0.43 % (23155)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.19/0.44 % (23147)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.19/0.45 % (23155)First to succeed.
% 0.19/0.45 % (23147)Instruction limit reached!
% 0.19/0.45 % (23147)------------------------------
% 0.19/0.45 % (23147)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.45 % (23147)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.45 % (23147)Termination reason: Unknown
% 0.19/0.45 % (23147)Termination phase: Saturation
% 0.19/0.45
% 0.19/0.45 % (23147)Memory used [KB]: 5500
% 0.19/0.45 % (23147)Time elapsed: 0.047 s
% 0.19/0.45 % (23147)Instructions burned: 7 (million)
% 0.19/0.45 % (23147)------------------------------
% 0.19/0.45 % (23147)------------------------------
% 0.19/0.45 % (23155)Refutation found. Thanks to Tanya!
% 0.19/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.45 % (23155)------------------------------
% 0.19/0.45 % (23155)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.45 % (23155)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.45 % (23155)Termination reason: Refutation
% 0.19/0.45
% 0.19/0.45 % (23155)Memory used [KB]: 1023
% 0.19/0.45 % (23155)Time elapsed: 0.045 s
% 0.19/0.45 % (23155)Instructions burned: 14 (million)
% 0.19/0.45 % (23155)------------------------------
% 0.19/0.45 % (23155)------------------------------
% 0.19/0.45 % (23139)Success in time 0.113 s
%------------------------------------------------------------------------------