TSTP Solution File: HEN004-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HEN004-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n015.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 : Thu Aug 31 01:54:16 EDT 2023
% Result : Unsatisfiable 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of formulae : 39 ( 21 unt; 6 typ; 0 def)
% Number of atoms : 61 ( 5 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 58 ( 30 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 3 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 7 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
less_equal: ( $i * $i ) > $o ).
tff(decl_23,type,
zero: $i ).
tff(decl_24,type,
quotient: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
identity: $i ).
tff(decl_26,type,
divide: ( $i * $i ) > $i ).
tff(decl_27,type,
x: $i ).
cnf(quotient_property,axiom,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(x_divide_x_is_zero,axiom,
quotient(X1,X1,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
cnf(zero_divide_anything_is_zero,axiom,
quotient(zero,X1,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
cnf(less_equal_quotient,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(divisor_existence,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(prove_x_divde_zero_is_x,negated_conjecture,
~ quotient(x,zero,x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_x_divde_zero_is_x) ).
cnf(c_0_9,axiom,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
quotient_property ).
cnf(c_0_10,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_11,plain,
( less_equal(divide(X1,X2),X3)
| ~ quotient(X4,X5,X3)
| ~ quotient(X6,X5,X2)
| ~ quotient(X7,X5,X1)
| ~ quotient(X7,X6,X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
quotient(X1,X1,zero),
x_divide_x_is_zero ).
cnf(c_0_13,plain,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,X4,X2)
| ~ quotient(X5,X4,X1)
| ~ quotient(X5,X3,X4) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
quotient(zero,X1,zero),
zero_divide_anything_is_zero ).
cnf(c_0_15,plain,
( less_equal(divide(X1,zero),zero)
| ~ quotient(X2,zero,X3)
| ~ quotient(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( less_equal(divide(X1,zero),zero)
| ~ quotient(X2,divide(X2,zero),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_17,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_18,plain,
less_equal(divide(divide(X1,divide(X1,zero)),zero),zero),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_19,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_20,plain,
divide(divide(X1,divide(X1,zero)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_21,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
less_equal_quotient ).
cnf(c_0_22,plain,
quotient(divide(X1,divide(X1,zero)),zero,zero),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_23,plain,
less_equal(divide(X1,divide(X1,zero)),zero),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_19])]) ).
cnf(c_0_25,plain,
quotient(X1,divide(X1,zero),zero),
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
cnf(c_0_26,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
divisor_existence ).
cnf(c_0_27,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_28,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_26,c_0_10]) ).
cnf(c_0_29,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_27]),c_0_28])]) ).
cnf(c_0_30,negated_conjecture,
~ quotient(x,zero,x),
prove_x_divde_zero_is_x ).
cnf(c_0_31,plain,
quotient(X1,zero,X1),
inference(spm,[status(thm)],[c_0_10,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN004-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 24 13:42:51 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.57 start to proof: theBenchmark
% 0.21/0.59 % Version : CSE_E---1.5
% 0.21/0.59 % Problem : theBenchmark.p
% 0.21/0.59 % Proof found
% 0.21/0.59 % SZS status Theorem for theBenchmark.p
% 0.21/0.59 % SZS output start Proof
% See solution above
% 0.21/0.59 % Total time : 0.008000 s
% 0.21/0.59 % SZS output end Proof
% 0.21/0.59 % Total time : 0.011000 s
%------------------------------------------------------------------------------