TSTP Solution File: GRP133-2.003 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP133-2.003 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 07:57:36 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 14
% Syntax : Number of clauses : 107 ( 29 unt; 28 nHn; 107 RR)
% Number of literals : 235 ( 0 equ; 117 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 91 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(no_redundancy,axiom,
( ~ product(X1,e_1,X2)
| ~ next(X1,X3)
| ~ greater(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',no_redundancy) ).
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',product_total_function1) ).
cnf(e_3_greater_e_2,axiom,
greater(e_3,e_2),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',e_3_greater_e_2) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',e_3_is_not_e_1) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',product_right_cancellation) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',element_1) ).
cnf(e_1_then_e_2,axiom,
next(e_1,e_2),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',e_1_then_e_2) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',e_2_is_not_e_1) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',e_3_is_not_e_2) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',element_3) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',product_left_cancellation) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',element_2) ).
cnf(qg3,negated_conjecture,
( product(X3,X4,X1)
| ~ product(X1,X2,X3)
| ~ product(X2,X1,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',qg3) ).
cnf(product_total_function2,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p',product_total_function2) ).
cnf(c_0_14,plain,
( ~ product(X1,e_1,X2)
| ~ next(X1,X3)
| ~ greater(X2,X3) ),
inference(fof_simplification,[status(thm)],[no_redundancy]) ).
cnf(c_0_15,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_16,plain,
( ~ product(X1,e_1,X2)
| ~ next(X1,X3)
| ~ greater(X2,X3) ),
c_0_14 ).
cnf(c_0_17,axiom,
greater(e_3,e_2),
e_3_greater_e_2 ).
cnf(c_0_18,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_19,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_20,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
c_0_15 ).
cnf(c_0_21,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_22,plain,
( ~ product(X1,e_1,e_3)
| ~ next(X1,e_2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,axiom,
next(e_1,e_2),
e_1_then_e_2 ).
cnf(c_0_24,plain,
~ equalish(e_2,e_1),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_1]) ).
cnf(c_0_25,plain,
~ equalish(e_3,e_1),
c_0_18 ).
cnf(c_0_26,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
c_0_19 ).
cnf(c_0_27,plain,
( product(X1,e_1,e_3)
| product(X1,e_1,e_2)
| product(X1,e_1,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
~ product(e_1,e_1,e_3),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
~ equalish(e_3,e_2),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_2]) ).
cnf(c_0_30,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_31,plain,
~ equalish(e_2,e_1),
c_0_24 ).
cnf(c_0_32,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_3,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_21]),c_0_28]) ).
cnf(c_0_34,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_35,plain,
~ equalish(e_3,e_2),
c_0_29 ).
cnf(c_0_36,plain,
( product(X1,e_3,e_3)
| product(X1,e_3,e_2)
| product(X1,e_3,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_37,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_38,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_2,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_39,plain,
( product(e_1,e_1,e_2)
| ~ product(e_1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
c_0_34 ).
cnf(c_0_41,plain,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_3,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_26]) ).
cnf(c_0_42,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_36,c_0_21]) ).
cnf(c_0_43,plain,
( product(X1,e_2,e_3)
| product(X1,e_2,e_2)
| product(X1,e_2,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_37]) ).
cnf(c_0_44,plain,
( ~ product(e_1,e_2,e_2)
| ~ product(e_1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( product(X3,X4,X1)
| ~ product(X1,X2,X3)
| ~ product(X2,X1,X4) ),
inference(fof_simplification,[status(thm)],[qg3]) ).
cnf(c_0_46,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_2,X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_40]) ).
cnf(c_0_47,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| ~ product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_43,c_0_21]) ).
cnf(c_0_49,plain,
( product(e_1,e_3,e_3)
| ~ product(e_1,e_2,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_42]),c_0_41]) ).
cnf(c_0_50,negated_conjecture,
( product(X3,X4,X1)
| ~ product(X1,X2,X3)
| ~ product(X2,X1,X4) ),
c_0_45 ).
cnf(c_0_51,plain,
( product(e_3,e_3,e_1)
| product(e_3,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_52,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_3,X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_40]) ).
cnf(c_0_53,plain,
( product(e_1,e_1,e_2)
| ~ product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_46,c_0_33]) ).
cnf(c_0_54,plain,
( product(e_1,e_2,e_3)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_2)
| product(X1,e_1,e_3)
| ~ product(e_3,e_3,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[product_total_function2]) ).
cnf(c_0_57,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_3,X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_40]) ).
cnf(c_0_58,plain,
( product(e_3,e_1,e_1)
| product(e_3,e_1,e_2)
| product(e_3,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_59,plain,
( ~ product(e_3,e_1,e_2)
| ~ product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
( product(e_1,e_1,e_2)
| ~ product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_61,plain,
( product(e_1,e_3,e_2)
| product(e_1,e_2,e_3)
| ~ product(e_3,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_52,c_0_54]) ).
cnf(c_0_62,negated_conjecture,
( product(e_3,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_51]),c_0_28]) ).
cnf(c_0_63,plain,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
c_0_56 ).
cnf(c_0_64,plain,
( product(e_3,e_1,e_3)
| ~ product(e_2,e_1,e_1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_65,plain,
( ~ product(e_1,e_3,e_2)
| ~ product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_32,c_0_60]) ).
cnf(c_0_66,negated_conjecture,
( product(e_3,e_3,e_2)
| product(e_1,e_2,e_3)
| product(e_1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,plain,
( ~ product(X1,X2,e_1)
| ~ product(X1,X2,e_3) ),
inference(spm,[status(thm)],[c_0_25,c_0_63]) ).
cnf(c_0_68,plain,
( ~ product(X1,X2,e_2)
| ~ product(X1,X2,e_3) ),
inference(spm,[status(thm)],[c_0_35,c_0_63]) ).
cnf(c_0_69,plain,
( ~ product(e_3,e_3,e_3)
| ~ product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_32,c_0_64]) ).
cnf(c_0_70,negated_conjecture,
( product(e_3,e_3,e_2)
| ~ product(e_1,e_2,e_1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_71,negated_conjecture,
( product(e_3,e_3,e_2)
| ~ product(e_1,e_2,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_66]),c_0_68]) ).
cnf(c_0_72,negated_conjecture,
( product(e_3,e_3,e_2)
| ~ product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_69,c_0_62]) ).
cnf(c_0_73,negated_conjecture,
( product(e_1,e_2,e_3)
| product(e_3,e_3,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_48]),c_0_71]) ).
cnf(c_0_74,negated_conjecture,
( ~ product(e_2,e_3,e_2)
| ~ product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_57,c_0_72]) ).
cnf(c_0_75,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_27,c_0_37]) ).
cnf(c_0_76,plain,
( product(e_1,e_1,e_2)
| ~ product(e_3,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_52,c_0_33]) ).
cnf(c_0_77,negated_conjecture,
( product(e_3,e_3,e_2)
| product(X1,e_3,e_2)
| ~ product(e_2,e_1,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_73]) ).
cnf(c_0_78,negated_conjecture,
( product(e_2,e_1,e_3)
| ~ product(e_2,e_3,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_32]) ).
cnf(c_0_79,plain,
( ~ product(e_2,e_1,e_2)
| ~ product(e_3,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_46,c_0_76]) ).
cnf(c_0_80,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_81,negated_conjecture,
~ product(e_2,e_3,e_2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_57]) ).
cnf(c_0_82,plain,
( product(e_3,e_1,e_3)
| ~ product(e_2,e_1,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_58]),c_0_57]) ).
cnf(c_0_83,plain,
( product(e_2,e_1,e_3)
| product(e_2,e_1,e_2)
| ~ product(e_2,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_32,c_0_75]) ).
cnf(c_0_84,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_1) ),
inference(sr,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,plain,
( ~ product(e_3,e_3,e_3)
| ~ product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_32,c_0_82]) ).
cnf(c_0_86,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_87,negated_conjecture,
( product(e_3,e_3,e_2)
| ~ product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_85,c_0_62]) ).
cnf(c_0_88,negated_conjecture,
( product(e_3,e_3,e_2)
| ~ product(e_2,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_57,c_0_62]) ).
cnf(c_0_89,negated_conjecture,
product(e_3,e_3,e_2),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_86]),c_0_87]),c_0_88]) ).
cnf(c_0_90,negated_conjecture,
( product(X1,e_2,e_3)
| ~ product(e_3,e_3,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_89]) ).
cnf(c_0_91,plain,
( ~ product(e_2,e_1,e_2)
| ~ product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_46,c_0_60]) ).
cnf(c_0_92,plain,
( product(e_2,e_1,e_2)
| ~ product(e_2,e_2,e_3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_86]),c_0_41]) ).
cnf(c_0_93,negated_conjecture,
product(e_2,e_2,e_3),
inference(spm,[status(thm)],[c_0_90,c_0_89]) ).
cnf(c_0_94,negated_conjecture,
( product(X1,e_3,e_1)
| ~ product(e_2,e_1,e_1)
| ~ product(e_1,e_3,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_64]) ).
cnf(c_0_95,negated_conjecture,
( product(X1,e_3,e_1)
| ~ product(e_2,e_1,e_2)
| ~ product(e_1,e_3,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_82]) ).
cnf(c_0_96,plain,
( product(e_1,e_2,e_3)
| product(e_1,e_2,e_2)
| ~ product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_91,c_0_48]) ).
cnf(c_0_97,plain,
product(e_2,e_1,e_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]) ).
cnf(c_0_98,negated_conjecture,
( product(e_2,e_1,e_3)
| product(X1,e_3,e_1)
| ~ product(e_1,e_3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_75]),c_0_95]) ).
cnf(c_0_99,plain,
( product(e_1,e_2,e_2)
| product(e_1,e_2,e_3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]) ).
cnf(c_0_100,plain,
product(e_3,e_1,e_3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_97])]) ).
cnf(c_0_101,negated_conjecture,
( product(e_3,e_3,e_1)
| product(e_2,e_1,e_3)
| ~ product(e_1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_98,c_0_49]) ).
cnf(c_0_102,plain,
product(e_1,e_2,e_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_99]),c_0_93])]) ).
cnf(c_0_103,plain,
~ product(e_2,e_1,e_3),
inference(spm,[status(thm)],[c_0_57,c_0_100]) ).
cnf(c_0_104,plain,
( ~ product(X1,X2,e_1)
| ~ product(X1,X2,e_2) ),
inference(spm,[status(thm)],[c_0_31,c_0_63]) ).
cnf(c_0_105,negated_conjecture,
product(e_3,e_3,e_1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_102])]),c_0_103]) ).
cnf(c_0_106,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_89])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP133-2.003 : TPTP v8.1.2. Released v1.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 16:00:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.NOcii8Xrgb/E---3.1_5321.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # sh5l with pid 5401 completed with status 0
% 0.21/0.51 # Result found by sh5l
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 181s (1) cores
% 0.21/0.51 # G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with pid 5409 completed with status 0
% 0.21/0.51 # Result found by G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 20
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 20
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 20
% 0.21/0.51 # Processed clauses : 260
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 55
% 0.21/0.51 # ...remaining for further processing : 205
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 59
% 0.21/0.51 # Backward-rewritten : 45
% 0.21/0.51 # Generated clauses : 377
% 0.21/0.51 # ...of the previous two non-redundant : 351
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 19
% 0.21/0.51 # Paramodulations : 372
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 50
% 0.21/0.51 # ...of those cached : 44
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 76
% 0.21/0.51 # Positive orientable unit clauses : 14
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 17
% 0.21/0.51 # Non-unit-clauses : 45
% 0.21/0.51 # Current number of unprocessed clauses: 94
% 0.21/0.51 # ...number of literals in the above : 330
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 129
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 2663
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 2393
% 0.21/0.51 # Non-unit clause-clause subsumptions : 85
% 0.21/0.51 # Unit Clause-clause subsumption calls : 237
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 23
% 0.21/0.51 # BW rewrite match successes : 6
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 4792
% 0.21/0.51 # Search garbage collected termcells : 44
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.014 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.017 s
% 0.21/0.51 # Maximum resident set size: 1596 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.017 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.020 s
% 0.21/0.51 # Maximum resident set size: 1700 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------