TSTP Solution File: GRP133-2.003 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP133-2.003 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:38:57 EDT 2023
% Result : Unsatisfiable 0.36s 0.53s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 14
% Syntax : Number of clauses : 98 ( 26 unt; 27 nHn; 98 RR)
% Number of literals : 212 ( 0 equ; 101 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 : 70 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(no_redundancy,axiom,
( ~ product(X1,e_1,X2)
| ~ next(X1,X3)
| ~ greater(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.p',no_redundancy) ).
cnf(e_3_greater_e_2,axiom,
greater(e_3,e_2),
file('/export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.p',e_3_greater_e_2) ).
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.g8sRAtZV4P/E---3.1_31671.p',product_total_function1) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.p',element_1) ).
cnf(e_1_then_e_2,axiom,
next(e_1,e_2),
file('/export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.p',e_1_then_e_2) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.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.g8sRAtZV4P/E---3.1_31671.p',product_right_cancellation) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.p',element_3) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.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.g8sRAtZV4P/E---3.1_31671.p',e_3_is_not_e_2) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.p',element_2) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.p',product_left_cancellation) ).
cnf(qg3,negated_conjecture,
( product(X3,X4,X1)
| ~ product(X1,X2,X3)
| ~ product(X2,X1,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.p',qg3) ).
cnf(product_total_function2,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.p',product_total_function2) ).
cnf(c_0_14,axiom,
( ~ product(X1,e_1,X2)
| ~ next(X1,X3)
| ~ greater(X2,X3) ),
no_redundancy ).
cnf(c_0_15,axiom,
greater(e_3,e_2),
e_3_greater_e_2 ).
cnf(c_0_16,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
product_total_function1 ).
cnf(c_0_17,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_18,plain,
( ~ product(X1,e_1,e_3)
| ~ next(X1,e_2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
next(e_1,e_2),
e_1_then_e_2 ).
cnf(c_0_20,axiom,
~ equalish(e_3,e_1),
e_3_is_not_e_1 ).
cnf(c_0_21,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
product_right_cancellation ).
cnf(c_0_22,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_16,c_0_17]) ).
cnf(c_0_23,plain,
~ product(e_1,e_1,e_3),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_25,axiom,
~ equalish(e_2,e_1),
e_2_is_not_e_1 ).
cnf(c_0_26,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_3,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,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_22,c_0_17]),c_0_23]) ).
cnf(c_0_28,axiom,
~ equalish(e_3,e_2),
e_3_is_not_e_2 ).
cnf(c_0_29,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_16,c_0_24]) ).
cnf(c_0_30,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_31,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_2,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_32,plain,
( product(e_1,e_1,e_2)
| ~ product(e_1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
product_left_cancellation ).
cnf(c_0_34,plain,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_3,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_35,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_29,c_0_17]) ).
cnf(c_0_36,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_16,c_0_30]) ).
cnf(c_0_37,plain,
( ~ product(e_1,e_2,e_2)
| ~ product(e_1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_2,X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_33]) ).
cnf(c_0_39,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_34,c_0_35]) ).
cnf(c_0_40,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_36,c_0_17]) ).
cnf(c_0_41,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_37,c_0_35]),c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( product(X3,X4,X1)
| ~ product(X1,X2,X3)
| ~ product(X2,X1,X4) ),
qg3 ).
cnf(c_0_43,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_29,c_0_24]) ).
cnf(c_0_44,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_3,X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_45,plain,
( product(e_1,e_1,e_2)
| ~ product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_46,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_39,c_0_40]),c_0_41]) ).
cnf(c_0_47,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_42,c_0_43]) ).
cnf(c_0_48,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_3,X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_49,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_22,c_0_24]) ).
cnf(c_0_50,plain,
( ~ product(e_3,e_1,e_2)
| ~ product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
( product(e_1,e_1,e_2)
| ~ product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_52,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_44,c_0_46]) ).
cnf(c_0_53,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_47,c_0_43]),c_0_23]) ).
cnf(c_0_54,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
product_total_function2 ).
cnf(c_0_55,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_48,c_0_49]),c_0_50]) ).
cnf(c_0_56,plain,
( ~ product(e_1,e_3,e_2)
| ~ product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_26,c_0_51]) ).
cnf(c_0_57,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_52,c_0_53]) ).
cnf(c_0_58,plain,
( ~ product(X1,X2,e_1)
| ~ product(X1,X2,e_3) ),
inference(spm,[status(thm)],[c_0_20,c_0_54]) ).
cnf(c_0_59,plain,
( ~ product(X1,X2,e_2)
| ~ product(X1,X2,e_3) ),
inference(spm,[status(thm)],[c_0_28,c_0_54]) ).
cnf(c_0_60,plain,
( ~ product(e_3,e_3,e_3)
| ~ product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_26,c_0_55]) ).
cnf(c_0_61,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_56,c_0_57]),c_0_58]) ).
cnf(c_0_62,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_34,c_0_57]),c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( product(e_3,e_3,e_2)
| ~ product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_60,c_0_53]) ).
cnf(c_0_64,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_61,c_0_40]),c_0_62]) ).
cnf(c_0_65,negated_conjecture,
( ~ product(e_2,e_3,e_2)
| ~ product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_48,c_0_63]) ).
cnf(c_0_66,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_22,c_0_30]) ).
cnf(c_0_67,plain,
( product(e_1,e_1,e_2)
| ~ product(e_3,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_44,c_0_27]) ).
cnf(c_0_68,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_42,c_0_64]) ).
cnf(c_0_69,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_65,c_0_66]),c_0_26]) ).
cnf(c_0_70,plain,
( ~ product(e_2,e_1,e_2)
| ~ product(e_3,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_38,c_0_67]) ).
cnf(c_0_71,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_29,c_0_30]) ).
cnf(c_0_72,negated_conjecture,
~ product(e_2,e_3,e_2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_48]) ).
cnf(c_0_73,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_70,c_0_49]),c_0_48]) ).
cnf(c_0_74,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_26,c_0_66]) ).
cnf(c_0_75,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_1) ),
inference(sr,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_76,plain,
( ~ product(e_3,e_3,e_3)
| ~ product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_26,c_0_73]) ).
cnf(c_0_77,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_74,c_0_75]) ).
cnf(c_0_78,negated_conjecture,
( product(e_3,e_3,e_2)
| ~ product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_76,c_0_53]) ).
cnf(c_0_79,negated_conjecture,
( product(e_3,e_3,e_2)
| ~ product(e_2,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_48,c_0_53]) ).
cnf(c_0_80,negated_conjecture,
product(e_3,e_3,e_2),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_77]),c_0_78]),c_0_79]) ).
cnf(c_0_81,negated_conjecture,
( product(X1,e_2,e_3)
| ~ product(e_3,e_3,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_80]) ).
cnf(c_0_82,plain,
( ~ product(e_2,e_1,e_2)
| ~ product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_38,c_0_51]) ).
cnf(c_0_83,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_31,c_0_77]),c_0_34]) ).
cnf(c_0_84,negated_conjecture,
product(e_2,e_2,e_3),
inference(spm,[status(thm)],[c_0_81,c_0_80]) ).
cnf(c_0_85,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_42,c_0_55]) ).
cnf(c_0_86,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_42,c_0_73]) ).
cnf(c_0_87,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_82,c_0_40]) ).
cnf(c_0_88,plain,
product(e_2,e_1,e_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]) ).
cnf(c_0_89,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_85,c_0_66]),c_0_86]) ).
cnf(c_0_90,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_87,c_0_88])]) ).
cnf(c_0_91,plain,
product(e_3,e_1,e_3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_88])]) ).
cnf(c_0_92,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_89,c_0_41]) ).
cnf(c_0_93,plain,
product(e_1,e_2,e_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_90]),c_0_84])]) ).
cnf(c_0_94,plain,
~ product(e_2,e_1,e_3),
inference(spm,[status(thm)],[c_0_48,c_0_91]) ).
cnf(c_0_95,plain,
( ~ product(X1,X2,e_1)
| ~ product(X1,X2,e_2) ),
inference(spm,[status(thm)],[c_0_25,c_0_54]) ).
cnf(c_0_96,negated_conjecture,
product(e_3,e_3,e_1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]),c_0_94]) ).
cnf(c_0_97,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_80])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP133-2.003 : TPTP v8.1.2. Released v1.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n027.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:39:01 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.g8sRAtZV4P/E---3.1_31671.p
% 0.36/0.53 # Version: 3.1pre001
% 0.36/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.53 # Starting sh5l with 300s (1) cores
% 0.36/0.53 # sh5l with pid 31794 completed with status 0
% 0.36/0.53 # Result found by sh5l
% 0.36/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.53 # Starting sh5l with 300s (1) cores
% 0.36/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.36/0.53 # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.36/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.53 # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 181s (1) cores
% 0.36/0.53 # G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with pid 31799 completed with status 0
% 0.36/0.53 # Result found by G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI
% 0.36/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.53 # Starting sh5l with 300s (1) cores
% 0.36/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.36/0.53 # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.36/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.53 # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 181s (1) cores
% 0.36/0.53 # Preprocessing time : 0.001 s
% 0.36/0.53 # Presaturation interreduction done
% 0.36/0.53
% 0.36/0.53 # Proof found!
% 0.36/0.53 # SZS status Unsatisfiable
% 0.36/0.53 # SZS output start CNFRefutation
% See solution above
% 0.36/0.53 # Parsed axioms : 20
% 0.36/0.53 # Removed by relevancy pruning/SinE : 0
% 0.36/0.53 # Initial clauses : 20
% 0.36/0.53 # Removed in clause preprocessing : 0
% 0.36/0.53 # Initial clauses in saturation : 20
% 0.36/0.53 # Processed clauses : 260
% 0.36/0.53 # ...of these trivial : 0
% 0.36/0.53 # ...subsumed : 55
% 0.36/0.53 # ...remaining for further processing : 205
% 0.36/0.53 # Other redundant clauses eliminated : 0
% 0.36/0.53 # Clauses deleted for lack of memory : 0
% 0.36/0.53 # Backward-subsumed : 59
% 0.36/0.53 # Backward-rewritten : 45
% 0.36/0.53 # Generated clauses : 377
% 0.36/0.53 # ...of the previous two non-redundant : 351
% 0.36/0.53 # ...aggressively subsumed : 0
% 0.36/0.53 # Contextual simplify-reflections : 19
% 0.36/0.53 # Paramodulations : 372
% 0.36/0.53 # Factorizations : 0
% 0.36/0.53 # NegExts : 0
% 0.36/0.53 # Equation resolutions : 0
% 0.36/0.53 # Total rewrite steps : 50
% 0.36/0.53 # Propositional unsat checks : 0
% 0.36/0.53 # Propositional check models : 0
% 0.36/0.53 # Propositional check unsatisfiable : 0
% 0.36/0.53 # Propositional clauses : 0
% 0.36/0.53 # Propositional clauses after purity: 0
% 0.36/0.53 # Propositional unsat core size : 0
% 0.36/0.53 # Propositional preprocessing time : 0.000
% 0.36/0.53 # Propositional encoding time : 0.000
% 0.36/0.53 # Propositional solver time : 0.000
% 0.36/0.53 # Success case prop preproc time : 0.000
% 0.36/0.53 # Success case prop encoding time : 0.000
% 0.36/0.53 # Success case prop solver time : 0.000
% 0.36/0.53 # Current number of processed clauses : 76
% 0.36/0.53 # Positive orientable unit clauses : 14
% 0.36/0.53 # Positive unorientable unit clauses: 0
% 0.36/0.53 # Negative unit clauses : 17
% 0.36/0.53 # Non-unit-clauses : 45
% 0.36/0.53 # Current number of unprocessed clauses: 94
% 0.36/0.53 # ...number of literals in the above : 330
% 0.36/0.53 # Current number of archived formulas : 0
% 0.36/0.53 # Current number of archived clauses : 129
% 0.36/0.53 # Clause-clause subsumption calls (NU) : 2663
% 0.36/0.53 # Rec. Clause-clause subsumption calls : 2393
% 0.36/0.53 # Non-unit clause-clause subsumptions : 85
% 0.36/0.53 # Unit Clause-clause subsumption calls : 237
% 0.36/0.53 # Rewrite failures with RHS unbound : 0
% 0.36/0.53 # BW rewrite match attempts : 23
% 0.36/0.53 # BW rewrite match successes : 6
% 0.36/0.53 # Condensation attempts : 0
% 0.36/0.53 # Condensation successes : 0
% 0.36/0.53 # Termbank termtop insertions : 4711
% 0.36/0.53
% 0.36/0.53 # -------------------------------------------------
% 0.36/0.53 # User time : 0.015 s
% 0.36/0.53 # System time : 0.002 s
% 0.36/0.53 # Total time : 0.017 s
% 0.36/0.53 # Maximum resident set size: 1644 pages
% 0.36/0.53
% 0.36/0.53 # -------------------------------------------------
% 0.36/0.53 # User time : 0.015 s
% 0.36/0.53 # System time : 0.005 s
% 0.36/0.53 # Total time : 0.020 s
% 0.36/0.53 # Maximum resident set size: 1684 pages
% 0.36/0.53 % E---3.1 exiting
% 0.36/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------