TSTP Solution File: HEN010-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : HEN010-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : Sat May 4 08:02:45 EDT 2024
% Result : Unsatisfiable 9.52s 1.71s
% Output : CNFRefutation 9.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 13
% Syntax : Number of clauses : 128 ( 59 unt; 0 nHn; 96 RR)
% Number of literals : 244 ( 43 equ; 119 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 228 ( 33 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(divisor_existence,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',divisor_existence) ).
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/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',quotient_property) ).
cnf(quotient_less_equal,axiom,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',quotient_less_equal) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',closure) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',zero_is_smallest) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',identity_is_largest) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',less_equal_and_equal) ).
cnf(less_equal_quotient,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',less_equal_quotient) ).
cnf(identity_divide_idQa,hypothesis,
quotient(identity,idQa,idQ_idQa),
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',identity_divide_idQa) ).
cnf(identity_divide_idQ_idQa,hypothesis,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',identity_divide_idQ_idQa) ).
cnf(well_defined,axiom,
( X3 = X4
| ~ quotient(X1,X2,X3)
| ~ quotient(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',well_defined) ).
cnf(identity_divide_a,hypothesis,
quotient(identity,a,idQa),
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',identity_divide_a) ).
cnf(prove_idQa_equals_idQa_Q__idQ_idQa,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
file('/export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p',prove_idQa_equals_idQa_Q__idQ_idQa) ).
cnf(c_0_13,plain,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[divisor_existence]) ).
cnf(c_0_14,plain,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
inference(fof_simplification,[status(thm)],[quotient_property]) ).
cnf(c_0_15,plain,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal]) ).
cnf(c_0_16,plain,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
c_0_13 ).
cnf(c_0_17,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_18,plain,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
c_0_14 ).
cnf(c_0_19,plain,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
c_0_15 ).
cnf(c_0_20,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,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_18,c_0_17]) ).
cnf(c_0_22,plain,
quotient(divide(X1,X2),X1,zero),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_24,plain,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,X4,divide(X5,X6))
| ~ quotient(X4,X5,X2)
| ~ quotient(X3,X5,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
quotient(zero,X1,zero),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_26,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_27,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_28,plain,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
inference(fof_simplification,[status(thm)],[less_equal_quotient]) ).
cnf(c_0_29,plain,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,X4,X2)
| ~ quotient(X4,X4,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_30,plain,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,X4,zero)
| ~ quotient(X4,X5,X2)
| ~ quotient(X3,X5,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_31,plain,
quotient(X1,identity,zero),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_32,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
c_0_27 ).
cnf(c_0_33,plain,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
c_0_28 ).
cnf(c_0_34,plain,
( less_equal(divide(X1,zero),zero)
| ~ quotient(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_35,plain,
( less_equal(divide(X1,X2),zero)
| ~ quotient(identity,X3,X2)
| ~ quotient(X4,X3,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,hypothesis,
quotient(identity,idQa,idQ_idQa),
identity_divide_idQa ).
cnf(c_0_37,plain,
( X1 = X2
| ~ quotient(X2,X1,zero)
| ~ less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
less_equal(divide(divide(X1,X1),zero),zero),
inference(spm,[status(thm)],[c_0_34,c_0_17]) ).
cnf(c_0_39,hypothesis,
( less_equal(divide(X1,idQ_idQa),zero)
| ~ quotient(X2,idQa,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
divide(divide(X1,X1),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_25])]) ).
cnf(c_0_41,hypothesis,
less_equal(divide(divide(X1,idQa),idQ_idQa),zero),
inference(spm,[status(thm)],[c_0_39,c_0_17]) ).
cnf(c_0_42,plain,
( X1 = X2
| ~ quotient(X2,X1,zero)
| ~ quotient(X1,X2,zero) ),
inference(spm,[status(thm)],[c_0_37,c_0_33]) ).
cnf(c_0_43,plain,
quotient(divide(X1,X1),zero,zero),
inference(spm,[status(thm)],[c_0_17,c_0_40]) ).
cnf(c_0_44,hypothesis,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
identity_divide_idQ_idQa ).
cnf(c_0_45,hypothesis,
divide(divide(X1,idQa),idQ_idQa) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_41]),c_0_25])]) ).
cnf(c_0_46,plain,
( X3 = X4
| ~ quotient(X1,X2,X3)
| ~ quotient(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[well_defined]) ).
cnf(c_0_47,plain,
divide(X1,X1) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_25])]) ).
cnf(c_0_48,hypothesis,
less_equal(idQa_Q__idQ_idQa,idQa),
inference(spm,[status(thm)],[c_0_16,c_0_44]) ).
cnf(c_0_49,hypothesis,
quotient(divide(X1,idQa),idQ_idQa,zero),
inference(spm,[status(thm)],[c_0_17,c_0_45]) ).
cnf(c_0_50,plain,
( X3 = X4
| ~ quotient(X1,X2,X3)
| ~ quotient(X1,X2,X4) ),
c_0_46 ).
cnf(c_0_51,plain,
quotient(X1,X1,zero),
inference(spm,[status(thm)],[c_0_17,c_0_47]) ).
cnf(c_0_52,hypothesis,
quotient(idQa_Q__idQ_idQa,idQa,zero),
inference(spm,[status(thm)],[c_0_19,c_0_48]) ).
cnf(c_0_53,hypothesis,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,X4,divide(X5,idQa))
| ~ quotient(X4,idQ_idQa,X2)
| ~ quotient(X3,idQ_idQa,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_49]) ).
cnf(c_0_54,hypothesis,
( X1 = idQa_Q__idQ_idQa
| ~ quotient(idQa,idQ_idQa,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_44]) ).
cnf(c_0_55,plain,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,X4,X2)
| ~ quotient(X5,X4,X1)
| ~ quotient(X5,X3,X4) ),
inference(spm,[status(thm)],[c_0_21,c_0_51]) ).
cnf(c_0_56,hypothesis,
quotient(identity,a,idQa),
identity_divide_a ).
cnf(c_0_57,hypothesis,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,idQa,X2)
| ~ quotient(X4,idQa,X1)
| ~ quotient(X4,X3,idQa_Q__idQ_idQa) ),
inference(spm,[status(thm)],[c_0_21,c_0_52]) ).
cnf(c_0_58,plain,
( less_equal(divide(X1,divide(identity,X2)),zero)
| ~ quotient(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_59,hypothesis,
( less_equal(divide(X1,X2),zero)
| ~ quotient(idQa,idQ_idQa,X2)
| ~ quotient(X3,idQ_idQa,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_17]) ).
cnf(c_0_60,hypothesis,
divide(idQa,idQ_idQa) = idQa_Q__idQ_idQa,
inference(spm,[status(thm)],[c_0_54,c_0_17]) ).
cnf(c_0_61,plain,
( less_equal(divide(X1,zero),zero)
| ~ quotient(X2,zero,X3)
| ~ quotient(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_25]) ).
cnf(c_0_62,hypothesis,
( less_equal(divide(X1,idQa),zero)
| ~ quotient(X2,a,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_56]) ).
cnf(c_0_63,hypothesis,
( less_equal(divide(X1,divide(X2,idQa)),zero)
| ~ quotient(X3,idQa,X1)
| ~ quotient(X3,X2,idQa_Q__idQ_idQa) ),
inference(spm,[status(thm)],[c_0_57,c_0_17]) ).
cnf(c_0_64,hypothesis,
less_equal(divide(idQa_Q__idQ_idQa,divide(identity,idQ_idQa)),zero),
inference(spm,[status(thm)],[c_0_58,c_0_44]) ).
cnf(c_0_65,hypothesis,
( less_equal(divide(X1,idQa_Q__idQ_idQa),zero)
| ~ quotient(X2,idQ_idQa,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_17]),c_0_60]) ).
cnf(c_0_66,plain,
( less_equal(divide(X1,zero),zero)
| ~ quotient(X2,divide(X2,zero),X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_17]) ).
cnf(c_0_67,hypothesis,
less_equal(divide(divide(X1,a),idQa),zero),
inference(spm,[status(thm)],[c_0_62,c_0_17]) ).
cnf(c_0_68,hypothesis,
( less_equal(divide(idQ_idQa,divide(X1,idQa)),zero)
| ~ quotient(identity,X1,idQa_Q__idQ_idQa) ),
inference(spm,[status(thm)],[c_0_63,c_0_36]) ).
cnf(c_0_69,hypothesis,
divide(idQa_Q__idQ_idQa,divide(identity,idQ_idQa)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_64]),c_0_25])]) ).
cnf(c_0_70,hypothesis,
less_equal(divide(divide(X1,idQ_idQa),idQa_Q__idQ_idQa),zero),
inference(spm,[status(thm)],[c_0_65,c_0_17]) ).
cnf(c_0_71,plain,
less_equal(divide(divide(X1,divide(X1,zero)),zero),zero),
inference(spm,[status(thm)],[c_0_66,c_0_17]) ).
cnf(c_0_72,hypothesis,
divide(divide(X1,a),idQa) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_67]),c_0_25])]) ).
cnf(c_0_73,hypothesis,
( divide(idQ_idQa,divide(X1,idQa)) = zero
| ~ quotient(identity,X1,idQa_Q__idQ_idQa) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_68]),c_0_25])]) ).
cnf(c_0_74,hypothesis,
quotient(idQa_Q__idQ_idQa,divide(identity,idQ_idQa),zero),
inference(spm,[status(thm)],[c_0_17,c_0_69]) ).
cnf(c_0_75,hypothesis,
divide(divide(X1,idQ_idQa),idQa_Q__idQ_idQa) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_70]),c_0_25])]) ).
cnf(c_0_76,plain,
divide(divide(X1,divide(X1,zero)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_71]),c_0_25])]) ).
cnf(c_0_77,hypothesis,
quotient(divide(X1,a),idQa,zero),
inference(spm,[status(thm)],[c_0_17,c_0_72]) ).
cnf(c_0_78,hypothesis,
( quotient(idQ_idQa,divide(X1,idQa),zero)
| ~ quotient(identity,X1,idQa_Q__idQ_idQa) ),
inference(spm,[status(thm)],[c_0_17,c_0_73]) ).
cnf(c_0_79,hypothesis,
( divide(identity,idQ_idQa) = idQa_Q__idQ_idQa
| ~ quotient(divide(identity,idQ_idQa),idQa_Q__idQ_idQa,zero) ),
inference(spm,[status(thm)],[c_0_42,c_0_74]) ).
cnf(c_0_80,hypothesis,
quotient(divide(X1,idQ_idQa),idQa_Q__idQ_idQa,zero),
inference(spm,[status(thm)],[c_0_17,c_0_75]) ).
cnf(c_0_81,plain,
quotient(divide(X1,divide(X1,zero)),zero,zero),
inference(spm,[status(thm)],[c_0_17,c_0_76]) ).
cnf(c_0_82,hypothesis,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,X4,divide(X5,a))
| ~ quotient(X4,idQa,X2)
| ~ quotient(X3,idQa,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_77]) ).
cnf(c_0_83,hypothesis,
( divide(X1,idQa) = idQ_idQa
| ~ quotient(identity,X1,idQa_Q__idQ_idQa) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_78]),c_0_49])]) ).
cnf(c_0_84,hypothesis,
divide(identity,idQ_idQa) = idQa_Q__idQ_idQa,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]) ).
cnf(c_0_85,plain,
( less_equal(divide(X1,X2),divide(X3,X4))
| ~ quotient(X5,X4,X2)
| ~ quotient(X6,X4,X1)
| ~ quotient(X6,X5,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_86,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_81]),c_0_25])]) ).
cnf(c_0_87,hypothesis,
( less_equal(divide(X1,X2),zero)
| ~ quotient(a,idQa,X2)
| ~ quotient(X3,idQa,X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_17]) ).
cnf(c_0_88,hypothesis,
( quotient(X1,idQa,idQ_idQa)
| ~ quotient(identity,X1,idQa_Q__idQ_idQa) ),
inference(spm,[status(thm)],[c_0_17,c_0_83]) ).
cnf(c_0_89,hypothesis,
quotient(identity,idQ_idQa,idQa_Q__idQ_idQa),
inference(spm,[status(thm)],[c_0_17,c_0_84]) ).
cnf(c_0_90,plain,
( less_equal(divide(X1,zero),divide(X2,X3))
| ~ quotient(X4,X3,X1)
| ~ quotient(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_85,c_0_51]) ).
cnf(c_0_91,plain,
quotient(X1,divide(X1,zero),zero),
inference(spm,[status(thm)],[c_0_17,c_0_86]) ).
cnf(c_0_92,hypothesis,
( less_equal(divide(X1,divide(a,idQa)),zero)
| ~ quotient(X2,idQa,X1) ),
inference(spm,[status(thm)],[c_0_87,c_0_17]) ).
cnf(c_0_93,hypothesis,
quotient(idQ_idQa,idQa,idQ_idQa),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_94,hypothesis,
( less_equal(divide(idQa,zero),divide(X1,a))
| ~ quotient(identity,a,X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_56]) ).
cnf(c_0_95,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_91]),c_0_22])]) ).
cnf(c_0_96,hypothesis,
less_equal(divide(idQ_idQa,divide(a,idQa)),zero),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_97,hypothesis,
( less_equal(divide(X1,X2),zero)
| ~ quotient(idQa,X3,X2)
| ~ quotient(idQa_Q__idQ_idQa,X3,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_52]) ).
cnf(c_0_98,plain,
( X1 = divide(X2,X3)
| ~ quotient(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_17]) ).
cnf(c_0_99,hypothesis,
( less_equal(idQa,divide(X1,a))
| ~ quotient(identity,a,X1) ),
inference(rw,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_100,hypothesis,
divide(idQ_idQa,divide(a,idQa)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_96]),c_0_25])]) ).
cnf(c_0_101,plain,
( less_equal(divide(divide(X1,X2),zero),divide(X3,X2))
| ~ quotient(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_90,c_0_17]) ).
cnf(c_0_102,hypothesis,
( less_equal(divide(X1,divide(idQa,X2)),zero)
| ~ quotient(idQa_Q__idQ_idQa,X2,X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_17]) ).
cnf(c_0_103,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_98,c_0_22]) ).
cnf(c_0_104,hypothesis,
( divide(X1,a) = idQa
| ~ quotient(identity,a,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_99]),c_0_77])]) ).
cnf(c_0_105,hypothesis,
quotient(idQ_idQa,divide(a,idQa),zero),
inference(spm,[status(thm)],[c_0_17,c_0_100]) ).
cnf(c_0_106,plain,
( divide(X1,X2) = X1
| ~ less_equal(X1,divide(X1,X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_107,plain,
( less_equal(divide(X1,X2),divide(X3,X2))
| ~ quotient(X1,X2,X3) ),
inference(rw,[status(thm)],[c_0_101,c_0_95]) ).
cnf(c_0_108,hypothesis,
( X1 = idQa
| ~ quotient(identity,a,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_56]) ).
cnf(c_0_109,hypothesis,
( divide(X1,divide(idQa,X2)) = zero
| ~ quotient(idQa_Q__idQ_idQa,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_102]),c_0_25])]) ).
cnf(c_0_110,hypothesis,
( divide(idQa,X1) = zero
| ~ quotient(identity,a,X1) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_111,hypothesis,
divide(a,idQa) = idQ_idQa,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_105]),c_0_49])]) ).
cnf(c_0_112,plain,
divide(divide(X1,X2),X2) = divide(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_17])]) ).
cnf(c_0_113,hypothesis,
divide(identity,a) = idQa,
inference(spm,[status(thm)],[c_0_108,c_0_17]) ).
cnf(c_0_114,hypothesis,
( X1 = zero
| ~ quotient(identity,a,X2)
| ~ quotient(idQa_Q__idQ_idQa,X2,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_95]) ).
cnf(c_0_115,hypothesis,
quotient(idQ_idQa,a,zero),
inference(spm,[status(thm)],[c_0_22,c_0_111]) ).
cnf(c_0_116,hypothesis,
divide(idQa,a) = idQa,
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_117,hypothesis,
( divide(idQa_Q__idQ_idQa,X1) = zero
| ~ quotient(identity,a,X1) ),
inference(spm,[status(thm)],[c_0_114,c_0_17]) ).
cnf(c_0_118,hypothesis,
( less_equal(X1,divide(X2,a))
| ~ quotient(X3,a,X1)
| ~ quotient(X3,idQ_idQa,X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_115]),c_0_95]) ).
cnf(c_0_119,hypothesis,
quotient(idQa,a,idQa),
inference(spm,[status(thm)],[c_0_17,c_0_116]) ).
cnf(c_0_120,plain,
( divide(X1,X2) = X1
| ~ quotient(X1,divide(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_37,c_0_20]) ).
cnf(c_0_121,hypothesis,
( quotient(idQa_Q__idQ_idQa,X1,zero)
| ~ quotient(identity,a,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_117]) ).
cnf(c_0_122,hypothesis,
( less_equal(idQa,divide(X1,a))
| ~ quotient(idQa,idQ_idQa,X1) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_123,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
inference(fof_simplification,[status(thm)],[prove_idQa_equals_idQa_Q__idQ_idQa]) ).
cnf(c_0_124,hypothesis,
( divide(idQa_Q__idQ_idQa,X1) = idQa_Q__idQ_idQa
| ~ quotient(identity,a,divide(idQa_Q__idQ_idQa,X1)) ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_125,hypothesis,
( divide(X1,a) = idQa
| ~ quotient(idQa,idQ_idQa,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_122]),c_0_77])]) ).
cnf(c_0_126,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
c_0_123 ).
cnf(c_0_127,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_56]),c_0_44])]),c_0_126]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : HEN010-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 08:53:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.9GWXSIaTt5/E---3.1_22129.p
% 9.52/1.71 # Version: 3.1.0
% 9.52/1.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 9.52/1.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.52/1.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.52/1.71 # Starting new_bool_3 with 300s (1) cores
% 9.52/1.71 # Starting new_bool_1 with 300s (1) cores
% 9.52/1.71 # Starting sh5l with 300s (1) cores
% 9.52/1.71 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22232 completed with status 0
% 9.52/1.71 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 9.52/1.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 9.52/1.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.52/1.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.52/1.71 # No SInE strategy applied
% 9.52/1.71 # Search class: FHUSS-FFSS22-SFFFFFNN
% 9.52/1.71 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 9.52/1.71 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 9.52/1.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 9.52/1.71 # Starting new_bool_3 with 136s (1) cores
% 9.52/1.71 # Starting new_bool_1 with 136s (1) cores
% 9.52/1.71 # Starting sh5l with 136s (1) cores
% 9.52/1.71 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22238 completed with status 0
% 9.52/1.71 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 9.52/1.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 9.52/1.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.52/1.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.52/1.71 # No SInE strategy applied
% 9.52/1.71 # Search class: FHUSS-FFSS22-SFFFFFNN
% 9.52/1.71 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 9.52/1.71 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 9.52/1.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 9.52/1.71 # Preprocessing time : 0.002 s
% 9.52/1.71 # Presaturation interreduction done
% 9.52/1.71
% 9.52/1.71 # Proof found!
% 9.52/1.71 # SZS status Unsatisfiable
% 9.52/1.71 # SZS output start CNFRefutation
% See solution above
% 9.52/1.71 # Parsed axioms : 13
% 9.52/1.71 # Removed by relevancy pruning/SinE : 0
% 9.52/1.71 # Initial clauses : 13
% 9.52/1.71 # Removed in clause preprocessing : 0
% 9.52/1.71 # Initial clauses in saturation : 13
% 9.52/1.71 # Processed clauses : 19944
% 9.52/1.71 # ...of these trivial : 20
% 9.52/1.71 # ...subsumed : 16985
% 9.52/1.71 # ...remaining for further processing : 2939
% 9.52/1.71 # Other redundant clauses eliminated : 0
% 9.52/1.71 # Clauses deleted for lack of memory : 0
% 9.52/1.71 # Backward-subsumed : 504
% 9.52/1.71 # Backward-rewritten : 563
% 9.52/1.71 # Generated clauses : 95096
% 9.52/1.71 # ...of the previous two non-redundant : 68247
% 9.52/1.71 # ...aggressively subsumed : 0
% 9.52/1.71 # Contextual simplify-reflections : 6
% 9.52/1.71 # Paramodulations : 95096
% 9.52/1.71 # Factorizations : 0
% 9.52/1.71 # NegExts : 0
% 9.52/1.71 # Equation resolutions : 0
% 9.52/1.71 # Disequality decompositions : 0
% 9.52/1.71 # Total rewrite steps : 49783
% 9.52/1.71 # ...of those cached : 49277
% 9.52/1.71 # Propositional unsat checks : 0
% 9.52/1.71 # Propositional check models : 0
% 9.52/1.71 # Propositional check unsatisfiable : 0
% 9.52/1.71 # Propositional clauses : 0
% 9.52/1.71 # Propositional clauses after purity: 0
% 9.52/1.71 # Propositional unsat core size : 0
% 9.52/1.71 # Propositional preprocessing time : 0.000
% 9.52/1.71 # Propositional encoding time : 0.000
% 9.52/1.71 # Propositional solver time : 0.000
% 9.52/1.71 # Success case prop preproc time : 0.000
% 9.52/1.71 # Success case prop encoding time : 0.000
% 9.52/1.71 # Success case prop solver time : 0.000
% 9.52/1.71 # Current number of processed clauses : 1859
% 9.52/1.71 # Positive orientable unit clauses : 64
% 9.52/1.71 # Positive unorientable unit clauses: 0
% 9.52/1.71 # Negative unit clauses : 12
% 9.52/1.71 # Non-unit-clauses : 1783
% 9.52/1.71 # Current number of unprocessed clauses: 44863
% 9.52/1.71 # ...number of literals in the above : 176512
% 9.52/1.71 # Current number of archived formulas : 0
% 9.52/1.71 # Current number of archived clauses : 1080
% 9.52/1.71 # Clause-clause subsumption calls (NU) : 1665255
% 9.52/1.71 # Rec. Clause-clause subsumption calls : 1208116
% 9.52/1.71 # Non-unit clause-clause subsumptions : 16470
% 9.52/1.71 # Unit Clause-clause subsumption calls : 6561
% 9.52/1.71 # Rewrite failures with RHS unbound : 0
% 9.52/1.71 # BW rewrite match attempts : 345
% 9.52/1.71 # BW rewrite match successes : 49
% 9.52/1.71 # Condensation attempts : 0
% 9.52/1.71 # Condensation successes : 0
% 9.52/1.71 # Termbank termtop insertions : 1191043
% 9.52/1.71 # Search garbage collected termcells : 30
% 9.52/1.71
% 9.52/1.71 # -------------------------------------------------
% 9.52/1.71 # User time : 1.163 s
% 9.52/1.71 # System time : 0.027 s
% 9.52/1.71 # Total time : 1.190 s
% 9.52/1.71 # Maximum resident set size: 1660 pages
% 9.52/1.71
% 9.52/1.71 # -------------------------------------------------
% 9.52/1.71 # User time : 5.934 s
% 9.52/1.71 # System time : 0.059 s
% 9.52/1.71 # Total time : 5.994 s
% 9.52/1.71 # Maximum resident set size: 1696 pages
% 9.52/1.71 % E---3.1 exiting
%------------------------------------------------------------------------------