TSTP Solution File: HEN009-5 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HEN009-5 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n024.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:24 EDT 2023
% Result : Unsatisfiable 0.76s 0.82s
% Output : CNFRefutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 32 ( 17 unt; 4 typ; 0 def)
% Number of atoms : 42 ( 41 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 10 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 ).
cnf(divide_and_equal,axiom,
( X1 = X2
| divide(X1,X2) != zero
| divide(X2,X1) != zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',divide_and_equal) ).
cnf(quotient_smaller_than_numerator,axiom,
divide(divide(X1,X2),X1) = zero,
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/HEN003-0.ax',quotient_property) ).
cnf(identity_is_largest,axiom,
divide(X1,identity) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',identity_is_largest) ).
cnf(zero_is_smallest,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',zero_is_smallest) ).
cnf(property_of_divide2,axiom,
( divide(divide(X3,X2),divide(X3,X1)) = zero
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide2) ).
cnf(property_of_divide1,axiom,
( divide(divide(X1,X3),X2) = zero
| divide(divide(X1,X2),X3) != zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide1) ).
cnf(prove_this,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_8,axiom,
( X1 = X2
| divide(X1,X2) != zero
| divide(X2,X1) != zero ),
divide_and_equal ).
cnf(c_0_9,axiom,
divide(divide(X1,X2),X1) = zero,
quotient_smaller_than_numerator ).
cnf(c_0_10,axiom,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
quotient_property ).
cnf(c_0_11,axiom,
divide(X1,identity) = zero,
identity_is_largest ).
cnf(c_0_12,axiom,
divide(zero,X1) = zero,
zero_is_smallest ).
cnf(c_0_13,plain,
( divide(X1,X2) = X1
| divide(X1,divide(X1,X2)) != zero ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
divide(divide(divide(X1,X2),divide(identity,X2)),zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,axiom,
( divide(divide(X3,X2),divide(X3,X1)) = zero
| divide(X1,X2) != zero ),
property_of_divide2 ).
cnf(c_0_16,axiom,
( divide(divide(X1,X3),X2) = zero
| divide(divide(X1,X2),X3) != zero ),
property_of_divide1 ).
cnf(c_0_17,plain,
divide(divide(X1,X2),divide(identity,X2)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14])]) ).
cnf(c_0_18,plain,
( divide(X1,X2) = divide(X1,X3)
| divide(divide(X1,X2),divide(X1,X3)) != zero
| divide(X2,X3) != zero ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_19,plain,
divide(divide(X1,divide(identity,X2)),X2) = zero,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( X1 = zero
| divide(X1,zero) != zero ),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_21,plain,
divide(divide(X1,X1),X2) = zero,
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_22,plain,
( divide(X1,divide(identity,divide(X1,X2))) = divide(X1,X2)
| divide(divide(identity,divide(X1,X2)),X2) != zero ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( divide(divide(X1,divide(X1,X2)),X3) = zero
| divide(X2,X3) != zero ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_24,plain,
divide(X1,X1) = zero,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
prove_this ).
cnf(c_0_26,plain,
divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN009-5 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 13:23:39 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.76/0.82 % Version : CSE_E---1.5
% 0.76/0.82 % Problem : theBenchmark.p
% 0.76/0.82 % Proof found
% 0.76/0.82 % SZS status Theorem for theBenchmark.p
% 0.76/0.82 % SZS output start Proof
% See solution above
% 0.76/0.82 % Total time : 0.245000 s
% 0.76/0.83 % SZS output end Proof
% 0.76/0.83 % Total time : 0.247000 s
%------------------------------------------------------------------------------