TSTP Solution File: HEN006-7 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HEN006-7 : 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 : n027.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:20 EDT 2023
% Result : Unsatisfiable 3.32s 3.48s
% Output : CNFRefutation 3.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 23
% Syntax : Number of formulae : 53 ( 24 unt; 10 typ; 0 def)
% Number of atoms : 90 ( 4 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 96 ( 49 ~; 47 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 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 : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 85 ( 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 ).
tff(decl_28,type,
y: $i ).
tff(decl_29,type,
xQy: $i ).
tff(decl_30,type,
z: $i ).
tff(decl_31,type,
xQz: $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(quotient_less_equal,axiom,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
cnf(xQz,hypothesis,
quotient(x,z,xQz),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xQz) ).
cnf(x_divde_zero_is_x,axiom,
quotient(X1,zero,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divde_zero_is_x) ).
cnf(xQy,hypothesis,
quotient(x,y,xQy),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xQy) ).
cnf(xQyLEz,hypothesis,
less_equal(xQy,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xQyLEz) ).
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(zero_divide_anything_is_zero,axiom,
quotient(zero,X1,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(divisor_existence,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
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(prove_xQzLEy,negated_conjecture,
~ less_equal(xQz,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_xQzLEy) ).
cnf(c_0_13,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_14,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_15,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_13,c_0_14]) ).
cnf(c_0_16,axiom,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
quotient_less_equal ).
cnf(c_0_17,plain,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,X4,X2)
| ~ quotient(X5,X4,X1)
| ~ quotient(X5,X3,X6)
| ~ less_equal(X6,X4) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
( less_equal(divide(X1,divide(X2,X3)),zero)
| ~ quotient(X4,X3,X1)
| ~ quotient(X4,X2,X5)
| ~ less_equal(X5,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_19,hypothesis,
quotient(x,z,xQz),
xQz ).
cnf(c_0_20,axiom,
quotient(X1,zero,X1),
x_divde_zero_is_x ).
cnf(c_0_21,hypothesis,
( less_equal(divide(xQz,divide(X1,z)),zero)
| ~ quotient(x,X1,X2)
| ~ less_equal(X2,z) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
quotient(x,y,xQy),
xQy ).
cnf(c_0_23,hypothesis,
less_equal(xQy,z),
xQyLEz ).
cnf(c_0_24,plain,
( less_equal(X1,X2)
| ~ quotient(X3,X4,zero)
| ~ quotient(X5,X4,X2)
| ~ quotient(X6,X4,X1)
| ~ quotient(X6,X3,X5) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_25,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_26,hypothesis,
less_equal(divide(xQz,divide(y,z)),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_27,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_28,plain,
( less_equal(X1,X2)
| ~ quotient(X3,X4,X2)
| ~ quotient(X5,X4,X1)
| ~ quotient(X5,X6,X3)
| ~ less_equal(X6,X4) ),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_29,axiom,
quotient(zero,X1,zero),
zero_divide_anything_is_zero ).
cnf(c_0_30,hypothesis,
divide(xQz,divide(y,z)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
( less_equal(X1,zero)
| ~ quotient(X2,X3,zero)
| ~ quotient(X2,X4,X1)
| ~ less_equal(X3,X4) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,hypothesis,
quotient(xQz,divide(y,z),zero),
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_33,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
divisor_existence ).
cnf(c_0_34,hypothesis,
( less_equal(X1,zero)
| ~ quotient(xQz,X2,X1)
| ~ less_equal(divide(y,z),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_33,c_0_14]) ).
cnf(c_0_36,hypothesis,
( less_equal(X1,zero)
| ~ quotient(xQz,y,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,hypothesis,
less_equal(divide(xQz,y),zero),
inference(spm,[status(thm)],[c_0_36,c_0_14]) ).
cnf(c_0_38,hypothesis,
divide(xQz,y) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_37]),c_0_27])]) ).
cnf(c_0_39,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
less_equal_quotient ).
cnf(c_0_40,hypothesis,
quotient(xQz,y,zero),
inference(spm,[status(thm)],[c_0_14,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ less_equal(xQz,y),
prove_xQzLEy ).
cnf(c_0_42,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN006-7 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n027.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:50:17 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 3.32/3.48 % Version : CSE_E---1.5
% 3.32/3.48 % Problem : theBenchmark.p
% 3.32/3.48 % Proof found
% 3.32/3.48 % SZS status Theorem for theBenchmark.p
% 3.32/3.48 % SZS output start Proof
% See solution above
% 3.32/3.49 % Total time : 2.913000 s
% 3.32/3.49 % SZS output end Proof
% 3.32/3.49 % Total time : 2.916000 s
%------------------------------------------------------------------------------