TSTP Solution File: GRP124-2.004 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP124-2.004 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : Mon May 20 20:53:33 EDT 2024
% Result : Unsatisfiable 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of clauses : 96 ( 36 unt; 33 nHn; 94 RR)
% Number of literals : 226 ( 0 equ; 102 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 86 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| product(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_total_function1) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_3) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_4) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_2) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_2) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_3) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_idempotence) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_2) ).
cnf(qg2_1,negated_conjecture,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X1,X2)
| ~ product(X6,X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg2_1) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_1) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_1) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_1) ).
cnf(c_0_15,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| product(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_16,plain,
~ equalish(e_4,e_3),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_3]) ).
cnf(c_0_17,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_18,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_19,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| product(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
c_0_15 ).
cnf(c_0_20,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_21,plain,
~ equalish(e_4,e_3),
c_0_16 ).
cnf(c_0_22,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
c_0_17 ).
cnf(c_0_23,plain,
~ equalish(e_4,e_2),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_2]) ).
cnf(c_0_24,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
c_0_18 ).
cnf(c_0_25,plain,
~ equalish(e_3,e_2),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_2]) ).
cnf(c_0_26,plain,
( product(X1,e_4,e_4)
| product(X1,e_4,e_3)
| product(X1,e_4,e_2)
| product(X1,e_4,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_28,plain,
( ~ product(e_3,X1,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_30,plain,
~ equalish(e_4,e_2),
c_0_23 ).
cnf(c_0_31,plain,
( ~ product(X1,e_3,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_32,plain,
~ equalish(e_3,e_2),
c_0_25 ).
cnf(c_0_33,plain,
( product(e_3,e_4,e_1)
| product(e_3,e_4,e_2)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
~ product(e_3,e_4,e_4),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_36,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_37,plain,
( product(X1,e_3,e_4)
| 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_19,c_0_27]) ).
cnf(c_0_38,plain,
~ product(e_4,e_3,e_4),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_39,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_3,X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_40,negated_conjecture,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X1,X2)
| ~ product(X6,X4,X5) ),
inference(fof_simplification,[status(thm)],[qg2_1]) ).
cnf(c_0_41,plain,
( product(e_3,e_4,e_3)
| product(e_3,e_4,e_2)
| product(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,plain,
( product(e_2,e_4,e_1)
| product(e_2,e_4,e_2)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_26,c_0_35]) ).
cnf(c_0_43,plain,
~ product(e_2,e_4,e_4),
inference(spm,[status(thm)],[c_0_36,c_0_29]) ).
cnf(c_0_44,plain,
( product(e_4,e_3,e_1)
| product(e_4,e_3,e_2)
| product(e_4,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_20]),c_0_38]) ).
cnf(c_0_45,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_3)
| product(e_2,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_46,plain,
~ product(e_2,e_3,e_3),
inference(spm,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_47,negated_conjecture,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X1,X2)
| ~ product(X6,X4,X5) ),
c_0_40 ).
cnf(c_0_48,plain,
( product(e_3,e_4,e_2)
| product(e_3,e_4,e_3)
| ~ product(e_2,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_39,c_0_41]) ).
cnf(c_0_49,plain,
( product(e_2,e_4,e_3)
| product(e_2,e_4,e_2)
| product(e_2,e_4,e_1) ),
inference(sr,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
~ equalish(e_4,e_1),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_1]) ).
cnf(c_0_51,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_52,plain,
( product(e_4,e_3,e_3)
| product(e_4,e_3,e_2)
| ~ product(e_2,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_36,c_0_44]) ).
cnf(c_0_53,plain,
( product(e_2,e_3,e_4)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_1) ),
inference(sr,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_54,negated_conjecture,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_3,X3)
| ~ product(e_2,X2,X4)
| ~ product(e_3,X3,X4) ),
inference(spm,[status(thm)],[c_0_32,c_0_47]) ).
cnf(c_0_55,plain,
( product(e_2,e_4,e_2)
| product(e_2,e_4,e_3)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,plain,
~ equalish(e_4,e_1),
c_0_50 ).
cnf(c_0_57,plain,
~ equalish(e_3,e_1),
c_0_51 ).
cnf(c_0_58,negated_conjecture,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_4,X3)
| ~ product(e_2,X2,X4)
| ~ product(e_4,X3,X4) ),
inference(spm,[status(thm)],[c_0_30,c_0_47]) ).
cnf(c_0_59,plain,
( product(e_2,e_3,e_2)
| product(e_2,e_3,e_4)
| product(e_4,e_3,e_2)
| product(e_4,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( ~ product(e_2,e_3,X1)
| ~ product(e_2,e_2,X2)
| ~ product(e_3,X1,X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_29]) ).
cnf(c_0_61,plain,
( product(e_3,e_4,e_2)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_55]),c_0_29])]) ).
cnf(c_0_62,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_63,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_24]) ).
cnf(c_0_64,plain,
~ equalish(e_2,e_1),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_1]) ).
cnf(c_0_65,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_3,X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_24]) ).
cnf(c_0_66,negated_conjecture,
( ~ product(e_2,e_4,X1)
| ~ product(e_2,e_2,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_29]) ).
cnf(c_0_67,plain,
( product(e_4,e_3,e_2)
| product(e_2,e_3,e_4)
| product(e_2,e_3,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_59]),c_0_29])]) ).
cnf(c_0_68,plain,
( product(e_2,e_4,e_2)
| product(e_2,e_4,e_3)
| ~ product(e_2,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_31,c_0_49]) ).
cnf(c_0_69,negated_conjecture,
( product(e_2,e_4,e_2)
| product(e_2,e_4,e_3)
| ~ product(e_2,e_3,e_4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_29])]) ).
cnf(c_0_70,plain,
( product(e_1,e_4,e_1)
| product(e_1,e_4,e_2)
| product(e_1,e_4,e_3)
| product(e_1,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_26,c_0_62]) ).
cnf(c_0_71,plain,
~ product(e_1,e_4,e_1),
inference(spm,[status(thm)],[c_0_63,c_0_29]) ).
cnf(c_0_72,plain,
~ equalish(e_2,e_1),
c_0_64 ).
cnf(c_0_73,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_37,c_0_62]) ).
cnf(c_0_74,plain,
~ product(e_1,e_3,e_1),
inference(spm,[status(thm)],[c_0_65,c_0_29]) ).
cnf(c_0_75,negated_conjecture,
( product(e_2,e_3,e_2)
| product(e_2,e_3,e_4)
| ~ product(e_2,e_4,e_3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_29])]) ).
cnf(c_0_76,plain,
( product(e_2,e_3,e_2)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_53]),c_0_69]) ).
cnf(c_0_77,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_22]) ).
cnf(c_0_78,plain,
( product(e_1,e_4,e_4)
| product(e_1,e_4,e_3)
| product(e_1,e_4,e_2) ),
inference(sr,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_79,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_2,X1,X2) ),
inference(spm,[status(thm)],[c_0_72,c_0_22]) ).
cnf(c_0_80,plain,
( product(e_1,e_3,e_4)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_81,plain,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_82,negated_conjecture,
( product(e_2,e_4,e_2)
| product(e_2,e_3,e_4)
| product(e_2,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_83,plain,
( product(e_1,e_4,e_2)
| product(e_1,e_4,e_3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_29])]) ).
cnf(c_0_84,plain,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_3)
| ~ product(e_2,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_85,negated_conjecture,
( product(e_2,e_3,e_2)
| product(e_2,e_3,e_4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_29])]) ).
cnf(c_0_86,plain,
( product(e_1,e_4,e_2)
| ~ product(e_2,e_4,e_3) ),
inference(spm,[status(thm)],[c_0_79,c_0_83]) ).
cnf(c_0_87,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_3,X1,X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_22]) ).
cnf(c_0_88,negated_conjecture,
( product(e_2,e_3,e_2)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_89,plain,
( ~ product(e_1,e_3,e_2)
| ~ product(e_2,e_4,e_3) ),
inference(spm,[status(thm)],[c_0_31,c_0_86]) ).
cnf(c_0_90,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_2,e_3,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_29])]) ).
cnf(c_0_91,negated_conjecture,
( product(e_2,e_3,e_2)
| ~ product(e_2,e_4,e_3) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_92,negated_conjecture,
( product(e_2,e_4,e_2)
| product(e_2,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_91,c_0_76]) ).
cnf(c_0_93,plain,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_3,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_94,negated_conjecture,
product(e_2,e_3,e_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_92]),c_0_29])]) ).
cnf(c_0_95,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP124-2.004 : TPTP v8.2.0. Released v1.2.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 05:43:07 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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/benchmark/theBenchmark.p
% 0.17/0.46 # Version: 3.1.0
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # sh5l with pid 12090 completed with status 0
% 0.17/0.46 # Result found by sh5l
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.46 # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 181s (1) cores
% 0.17/0.46 # G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with pid 12097 completed with status 0
% 0.17/0.46 # Result found by G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.46 # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 181s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Unsatisfiable
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 33
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 33
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 33
% 0.17/0.46 # Processed clauses : 300
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 62
% 0.17/0.46 # ...remaining for further processing : 238
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 19
% 0.17/0.46 # Backward-rewritten : 9
% 0.17/0.46 # Generated clauses : 381
% 0.17/0.46 # ...of the previous two non-redundant : 334
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 2
% 0.17/0.46 # Paramodulations : 375
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Disequality decompositions : 0
% 0.17/0.46 # Total rewrite steps : 23
% 0.17/0.46 # ...of those cached : 19
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 171
% 0.17/0.46 # Positive orientable unit clauses : 15
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 33
% 0.17/0.46 # Non-unit-clauses : 123
% 0.17/0.46 # Current number of unprocessed clauses: 90
% 0.17/0.46 # ...number of literals in the above : 368
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 67
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 4561
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 2709
% 0.17/0.46 # Non-unit clause-clause subsumptions : 59
% 0.17/0.46 # Unit Clause-clause subsumption calls : 104
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 5
% 0.17/0.46 # BW rewrite match successes : 1
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 5075
% 0.17/0.46 # Search garbage collected termcells : 65
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.014 s
% 0.17/0.46 # System time : 0.004 s
% 0.17/0.46 # Total time : 0.018 s
% 0.17/0.46 # Maximum resident set size: 1760 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.016 s
% 0.17/0.46 # System time : 0.005 s
% 0.17/0.46 # Total time : 0.021 s
% 0.17/0.46 # Maximum resident set size: 1756 pages
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------