TSTP Solution File: HEN009-6 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HEN009-6 : 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 : n017.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.20s 0.64s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 19
% Syntax : Number of formulae : 48 ( 24 unt; 8 typ; 0 def)
% Number of atoms : 59 ( 20 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 22 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 43 ( 9 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 ).
tff(decl_27,type,
b: $i ).
tff(decl_28,type,
c: $i ).
tff(decl_29,type,
d: $i ).
cnf(property_of_divide3,axiom,
( less_equal(divide(X1,X3),divide(X2,X3))
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide3) ).
cnf(id_divide_a_is_b,hypothesis,
divide(identity,a) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id_divide_a_is_b) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',identity_is_largest) ).
cnf(property_of_divide1,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide1) ).
cnf(id_divide_b_is_c,hypothesis,
divide(identity,b) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id_divide_b_is_c) ).
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(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(id_divide_c_is_d,hypothesis,
divide(identity,c) = d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id_divide_c_is_d) ).
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(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(prove_b_equals_d,negated_conjecture,
b != d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_b_equals_d) ).
cnf(c_0_11,axiom,
( less_equal(divide(X1,X3),divide(X2,X3))
| ~ less_equal(X1,X2) ),
property_of_divide3 ).
cnf(c_0_12,hypothesis,
divide(identity,a) = b,
id_divide_a_is_b ).
cnf(c_0_13,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_14,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
property_of_divide1 ).
cnf(c_0_15,hypothesis,
less_equal(divide(X1,a),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,hypothesis,
( less_equal(divide(identity,X1),a)
| ~ less_equal(b,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_17,hypothesis,
divide(identity,b) = c,
id_divide_b_is_c ).
cnf(c_0_18,hypothesis,
less_equal(b,b),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_19,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_20,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
quotient_less_equal1 ).
cnf(c_0_21,hypothesis,
less_equal(c,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_22,hypothesis,
divide(identity,c) = d,
id_divide_c_is_d ).
cnf(c_0_23,hypothesis,
less_equal(divide(X1,b),c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_17]),c_0_13])]) ).
cnf(c_0_24,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
quotient_less_equal2 ).
cnf(c_0_25,plain,
( divide(X1,X2) = divide(X3,X2)
| ~ less_equal(divide(X1,X2),divide(X3,X2))
| ~ less_equal(X3,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_26,hypothesis,
divide(c,a) = zero,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_28,hypothesis,
less_equal(divide(X1,c),d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_22]),c_0_13])]) ).
cnf(c_0_29,hypothesis,
( less_equal(divide(identity,X1),b)
| ~ less_equal(c,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_30,hypothesis,
less_equal(c,c),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_31,plain,
( less_equal(divide(X1,X2),X3)
| divide(divide(X1,X3),X2) != zero ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_32,hypothesis,
( divide(X1,a) = zero
| ~ less_equal(X1,c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_33,hypothesis,
less_equal(divide(X1,d),c),
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_34,hypothesis,
less_equal(d,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_22]),c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
b != d,
prove_b_equals_d ).
cnf(c_0_36,hypothesis,
( less_equal(b,X1)
| divide(divide(identity,X1),a) != zero ),
inference(spm,[status(thm)],[c_0_31,c_0_12]) ).
cnf(c_0_37,hypothesis,
divide(divide(X1,d),a) = zero,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,hypothesis,
~ less_equal(b,d),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_34]),c_0_35]) ).
cnf(c_0_39,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HEN009-6 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n017.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:00:09 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.64 % Version : CSE_E---1.5
% 0.20/0.64 % Problem : theBenchmark.p
% 0.20/0.64 % Proof found
% 0.20/0.64 % SZS status Theorem for theBenchmark.p
% 0.20/0.64 % SZS output start Proof
% See solution above
% 0.20/0.64 % Total time : 0.061000 s
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time : 0.064000 s
%------------------------------------------------------------------------------