TSTP Solution File: HEN004-4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HEN004-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n008.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.13s 0.58s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 29 ( 20 unt; 5 typ; 0 def)
% Number of atoms : 30 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 6 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
less_equal: ( $i * $i ) > $o ).
tff(decl_23,type,
divide: ( $i * $i ) > $i ).
tff(decl_24,type,
zero: $i ).
tff(decl_25,type,
identity: $i ).
tff(decl_26,type,
a: $i ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(zero_divide_anything_is_zero,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(x_divide_x_is_zero,axiom,
divide(X1,X1) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(prove_x_divide_zero_is_x,negated_conjecture,
divide(a,zero) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_x_divide_zero_is_x) ).
cnf(c_0_8,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_9,axiom,
divide(zero,X1) = zero,
zero_divide_anything_is_zero ).
cnf(c_0_10,plain,
less_equal(divide(divide(X1,X2),zero),divide(divide(X1,zero),X2)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
divide(X1,X1) = zero,
x_divide_x_is_zero ).
cnf(c_0_12,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_13,plain,
less_equal(divide(divide(X1,divide(X1,zero)),zero),zero),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_15,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
quotient_less_equal2 ).
cnf(c_0_16,plain,
divide(divide(X1,divide(X1,zero)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
less_equal(divide(X1,divide(X1,zero)),zero),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_14])]) ).
cnf(c_0_19,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_20,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_21,negated_conjecture,
divide(a,zero) != a,
prove_x_divide_zero_is_x ).
cnf(c_0_22,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : HEN004-4 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.08/0.32 % Computer : n008.cluster.edu
% 0.08/0.32 % Model : x86_64 x86_64
% 0.08/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.32 % Memory : 8042.1875MB
% 0.08/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.32 % CPULimit : 300
% 0.08/0.32 % WCLimit : 300
% 0.08/0.32 % DateTime : Thu Aug 24 13:39:32 EDT 2023
% 0.08/0.32 % CPUTime :
% 0.13/0.57 start to proof: theBenchmark
% 0.13/0.58 % Version : CSE_E---1.5
% 0.13/0.58 % Problem : theBenchmark.p
% 0.13/0.58 % Proof found
% 0.13/0.58 % SZS status Theorem for theBenchmark.p
% 0.13/0.58 % SZS output start Proof
% See solution above
% 0.13/0.59 % Total time : 0.003000 s
% 0.13/0.59 % SZS output end Proof
% 0.13/0.59 % Total time : 0.005000 s
%------------------------------------------------------------------------------