TSTP Solution File: HEN007-5 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HEN007-5 : 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 : n022.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:21 EDT 2023
% Result : Unsatisfiable 0.19s 0.63s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 28 ( 15 unt; 6 typ; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 13 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 34 ( 5 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
divide: ( $i * $i ) > $i ).
tff(decl_23,type,
zero: $i ).
tff(decl_24,type,
identity: $i ).
tff(decl_25,type,
a: $i ).
tff(decl_26,type,
b: $i ).
tff(decl_27,type,
c: $i ).
cnf(transitivity_of_divide_to_zero,axiom,
( divide(X1,X3) = zero
| divide(X1,X2) != zero
| divide(X2,X3) != zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_divide_to_zero) ).
cnf(quotient_smaller_than_numerator,axiom,
divide(divide(X1,X2),X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',quotient_smaller_than_numerator) ).
cnf(quotient_property,axiom,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',quotient_property) ).
cnf(a_divide_b_is_zero,hypothesis,
divide(a,b) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_divide_b_is_zero) ).
cnf(divide_and_equal,axiom,
( X1 = X2
| divide(X1,X2) != zero
| divide(X2,X1) != zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',divide_and_equal) ).
cnf(zero_is_smallest,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',zero_is_smallest) ).
cnf(prove_property_of_divide2,negated_conjecture,
divide(divide(c,b),divide(c,a)) != zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_of_divide2) ).
cnf(c_0_7,axiom,
( divide(X1,X3) = zero
| divide(X1,X2) != zero
| divide(X2,X3) != zero ),
transitivity_of_divide_to_zero ).
cnf(c_0_8,axiom,
divide(divide(X1,X2),X1) = zero,
quotient_smaller_than_numerator ).
cnf(c_0_9,axiom,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
quotient_property ).
cnf(c_0_10,hypothesis,
divide(a,b) = zero,
a_divide_b_is_zero ).
cnf(c_0_11,axiom,
( X1 = X2
| divide(X1,X2) != zero
| divide(X2,X1) != zero ),
divide_and_equal ).
cnf(c_0_12,plain,
( divide(X1,X2) = zero
| divide(X1,divide(X2,X3)) != zero ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,hypothesis,
divide(divide(divide(X1,b),zero),divide(divide(X1,a),b)) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X3),X2)
| divide(divide(divide(X1,X3),X2),divide(divide(X1,X2),divide(X3,X2))) != zero ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_15,hypothesis,
divide(divide(divide(X1,b),zero),divide(X1,a)) = zero,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
divide(zero,X1) = zero,
zero_is_smallest ).
cnf(c_0_17,plain,
( divide(X1,X2) = X1
| divide(X1,divide(X1,X2)) != zero ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_18,hypothesis,
divide(divide(divide(X1,b),divide(X1,a)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_16]),c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
divide(divide(c,b),divide(c,a)) != zero,
prove_property_of_divide2 ).
cnf(c_0_20,hypothesis,
divide(divide(X1,b),divide(X1,a)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN007-5 : 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.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 24 13:32:26 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.58 start to proof: theBenchmark
% 0.19/0.63 % Version : CSE_E---1.5
% 0.19/0.63 % Problem : theBenchmark.p
% 0.19/0.63 % Proof found
% 0.19/0.63 % SZS status Theorem for theBenchmark.p
% 0.19/0.63 % SZS output start Proof
% See solution above
% 0.19/0.63 % Total time : 0.034000 s
% 0.19/0.63 % SZS output end Proof
% 0.19/0.63 % Total time : 0.037000 s
%------------------------------------------------------------------------------