TSTP Solution File: HEN003-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : HEN003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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 : 600s
% DateTime : Sat Jul 16 13:02:58 EDT 2022
% Result : Unsatisfiable 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 10 unt; 0 nHn; 24 RR)
% Number of literals : 53 ( 0 equ; 30 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ quotient(x__dfg,x__dfg,zero),
file('HEN003-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ less_equal(u,v)
| quotient(u,v,zero) ),
file('HEN003-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ quotient(u,v,zero)
| less_equal(u,v) ),
file('HEN003-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ quotient(u,v,w)
| less_equal(w,u) ),
file('HEN003-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ quotient(u,v,w)
| ~ quotient(x,y,z)
| ~ quotient(x1,v,x)
| ~ quotient(x2,v,y)
| ~ quotient(x1,x2,u)
| less_equal(z,w) ),
file('HEN003-1.p',unknown),
[] ).
cnf(6,axiom,
less_equal(zero,u),
file('HEN003-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ less_equal(u,v)
| ~ less_equal(v,u)
| equal(v,u) ),
file('HEN003-1.p',unknown),
[] ).
cnf(9,axiom,
quotient(u,v,divide(u,v)),
file('HEN003-1.p',unknown),
[] ).
cnf(14,plain,
less_equal(divide(u,v),u),
inference(res,[status(thm),theory(equality)],[9,4]),
[iquote('0:Res:9.0,4.0')] ).
cnf(16,plain,
( ~ less_equal(u,zero)
| equal(u,zero) ),
inference(res,[status(thm),theory(equality)],[6,7]),
[iquote('0:Res:6.0,7.0')] ).
cnf(20,plain,
equal(divide(zero,u),zero),
inference(res,[status(thm),theory(equality)],[14,16]),
[iquote('0:Res:14.0,16.0')] ).
cnf(21,plain,
quotient(zero,u,zero),
inference(spr,[status(thm),theory(equality)],[20,9]),
[iquote('0:SpR:20.0,9.0')] ).
cnf(47,plain,
( ~ less_equal(u,v)
| ~ quotient(w,x,y)
| ~ quotient(z,v,w)
| ~ quotient(x1,v,x)
| ~ quotient(z,x1,u)
| less_equal(y,zero) ),
inference(res,[status(thm),theory(equality)],[2,5]),
[iquote('0:Res:2.1,5.0')] ).
cnf(105,plain,
( ~ less_equal(u,v)
| ~ quotient(w,v,x)
| ~ quotient(y,v,z)
| ~ quotient(w,y,u)
| less_equal(divide(x,z),zero) ),
inference(res,[status(thm),theory(equality)],[9,47]),
[iquote('0:Res:9.0,47.1')] ).
cnf(177,plain,
( ~ less_equal(u,v)
| ~ quotient(w,v,x)
| ~ quotient(y,w,u)
| less_equal(divide(divide(y,v),x),zero) ),
inference(res,[status(thm),theory(equality)],[9,105]),
[iquote('0:Res:9.0,105.1')] ).
cnf(280,plain,
( ~ less_equal(u,v)
| ~ quotient(w,zero,u)
| less_equal(divide(divide(w,v),zero),zero) ),
inference(res,[status(thm),theory(equality)],[21,177]),
[iquote('0:Res:21.0,177.1')] ).
cnf(399,plain,
( ~ less_equal(divide(u,zero),v)
| less_equal(divide(divide(u,v),zero),zero) ),
inference(res,[status(thm),theory(equality)],[9,280]),
[iquote('0:Res:9.0,280.1')] ).
cnf(534,plain,
( ~ less_equal(divide(u,zero),v)
| equal(divide(divide(u,v),zero),zero) ),
inference(res,[status(thm),theory(equality)],[399,16]),
[iquote('0:Res:399.1,16.0')] ).
cnf(538,plain,
( ~ less_equal(divide(u,zero),v)
| quotient(divide(u,v),zero,zero) ),
inference(spr,[status(thm),theory(equality)],[534,9]),
[iquote('0:SpR:534.1,9.0')] ).
cnf(581,plain,
( ~ less_equal(divide(u,zero),v)
| less_equal(divide(u,v),zero) ),
inference(res,[status(thm),theory(equality)],[538,3]),
[iquote('0:Res:538.1,3.0')] ).
cnf(625,plain,
less_equal(divide(u,u),zero),
inference(res,[status(thm),theory(equality)],[14,581]),
[iquote('0:Res:14.0,581.0')] ).
cnf(733,plain,
equal(divide(u,u),zero),
inference(res,[status(thm),theory(equality)],[625,16]),
[iquote('0:Res:625.0,16.0')] ).
cnf(738,plain,
quotient(u,u,zero),
inference(spr,[status(thm),theory(equality)],[733,9]),
[iquote('0:SpR:733.0,9.0')] ).
cnf(766,plain,
$false,
inference(unc,[status(thm)],[738,1]),
[iquote('0:UnC:738.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HEN003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 13:51:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.49
% 0.19/0.49 SPASS V 3.9
% 0.19/0.49 SPASS beiseite: Proof found.
% 0.19/0.49 % SZS status Theorem
% 0.19/0.49 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 SPASS derived 633 clauses, backtracked 0 clauses, performed 0 splits and kept 167 clauses.
% 0.19/0.49 SPASS allocated 63691 KBytes.
% 0.19/0.49 SPASS spent 0:00:00.14 on the problem.
% 0.19/0.49 0:00:00.04 for the input.
% 0.19/0.49 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.49 0:00:00.01 for inferences.
% 0.19/0.49 0:00:00.00 for the backtracking.
% 0.19/0.49 0:00:00.06 for the reduction.
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 Here is a proof with depth 11, length 24 :
% 0.19/0.49 % SZS output start Refutation
% See solution above
% 0.19/0.49 Formulae used in the proof : prove_x_divide_x_is_zero quotient_less_equal less_equal_quotient divisor_existence quotient_property zero_is_smallest less_equal_and_equal closure
% 0.19/0.49
%------------------------------------------------------------------------------