TSTP Solution File: GRP410-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP410-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:40:12 EDT 2023
% Result : Unsatisfiable 2.88s 0.75s
% Output : CNFRefutation 2.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 2
% Syntax : Number of clauses : 58 ( 58 unt; 0 nHn; 22 RR)
% Number of literals : 58 ( 57 equ; 11 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 15 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 142 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))),inverse(multiply(inverse(X3),X3))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.QuEucgGXvH/E---3.1_23471.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/tmp/tmp.QuEucgGXvH/E---3.1_23471.p',prove_these_axioms_2) ).
cnf(c_0_2,axiom,
multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))),inverse(multiply(inverse(X3),X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(inverse(multiply(inverse(X3),X3))))),inverse(multiply(inverse(inverse(multiply(inverse(X3),X3))),inverse(multiply(inverse(X3),X3))))) = multiply(inverse(multiply(X4,inverse(multiply(X2,X3)))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(multiply(X1,inverse(multiply(multiply(X2,inverse(multiply(inverse(X3),X3))),X3)))),multiply(X1,inverse(X3))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))) = multiply(inverse(multiply(X4,inverse(multiply(X2,X3)))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_6,plain,
multiply(inverse(multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))),inverse(multiply(multiply(X4,inverse(multiply(inverse(multiply(inverse(X3),X3)),multiply(inverse(X3),X3)))),multiply(inverse(X3),X3))))),X2) = X4,
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(X3))) = multiply(inverse(multiply(X4,inverse(X2))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,multiply(X3,inverse(X4)))))),multiply(X1,inverse(multiply(X3,inverse(X4))))),inverse(multiply(inverse(multiply(X5,inverse(X4))),multiply(X5,inverse(X4))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_9,plain,
multiply(multiply(inverse(X1),multiply(multiply(inverse(multiply(X2,inverse(multiply(X1,X3)))),multiply(X2,inverse(X3))),inverse(X3))),inverse(multiply(inverse(X3),X3))) = inverse(X3),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_10,plain,
multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,multiply(X3,inverse(X4)))))),multiply(X1,inverse(multiply(X3,inverse(X4))))),inverse(multiply(inverse(X5),X5))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X2)))),multiply(X1,inverse(X2))) = multiply(inverse(X3),multiply(multiply(inverse(multiply(X4,inverse(multiply(X3,X2)))),multiply(X4,inverse(X2))),inverse(X2))),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_12,plain,
multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))),inverse(multiply(inverse(X4),X4))) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_13,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_14,plain,
multiply(inverse(multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))),inverse(multiply(multiply(X4,inverse(multiply(inverse(b2),b2))),multiply(inverse(X5),X5))))),X2) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_12]),c_0_13]) ).
cnf(c_0_15,plain,
multiply(inverse(multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))),inverse(X4))),X2) = multiply(inverse(multiply(X5,inverse(X4))),multiply(X5,inverse(multiply(inverse(X6),X6)))),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,plain,
multiply(inverse(multiply(X1,inverse(multiply(multiply(inverse(X2),X2),X3)))),multiply(X1,inverse(X3))) = inverse(inverse(multiply(inverse(X3),X3))),
inference(spm,[status(thm)],[c_0_4,c_0_13]) ).
cnf(c_0_17,plain,
multiply(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(inverse(multiply(inverse(X3),X3))))),inverse(multiply(inverse(X4),X4))) = multiply(inverse(multiply(X5,inverse(multiply(X2,X6)))),multiply(X5,inverse(X6))),
inference(spm,[status(thm)],[c_0_12,c_0_12]) ).
cnf(c_0_18,plain,
multiply(inverse(multiply(b2,inverse(multiply(multiply(X1,inverse(multiply(inverse(b2),b2))),multiply(inverse(X2),X2))))),multiply(b2,inverse(multiply(inverse(b2),b2)))) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
multiply(inverse(inverse(multiply(inverse(X1),X1))),inverse(multiply(inverse(X2),X2))) = multiply(inverse(X3),X3),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_20,plain,
multiply(inverse(multiply(b2,inverse(multiply(X1,b2)))),multiply(b2,inverse(b2))) = multiply(inverse(multiply(X2,inverse(multiply(X1,X3)))),multiply(X2,inverse(X3))),
inference(rw,[status(thm)],[c_0_3,c_0_17]) ).
cnf(c_0_21,plain,
multiply(multiply(inverse(inverse(X1)),multiply(multiply(inverse(X2),multiply(multiply(inverse(multiply(X3,inverse(multiply(X2,X1)))),multiply(X3,inverse(X1))),inverse(X1))),inverse(X1))),inverse(multiply(inverse(X1),X1))) = inverse(X1),
inference(spm,[status(thm)],[c_0_2,c_0_9]) ).
cnf(c_0_22,plain,
multiply(inverse(multiply(b2,inverse(multiply(multiply(inverse(b2),b2),multiply(inverse(X1),X1))))),multiply(b2,inverse(multiply(inverse(b2),b2)))) = inverse(inverse(multiply(inverse(b2),b2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_23,plain,
multiply(inverse(multiply(inverse(inverse(X1)),inverse(multiply(X2,X1)))),multiply(inverse(b2),b2)) = multiply(inverse(multiply(b2,inverse(multiply(X2,b2)))),multiply(b2,inverse(b2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_19]) ).
cnf(c_0_24,plain,
multiply(multiply(inverse(inverse(multiply(inverse(b2),b2))),multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(b2),b2)))),inverse(multiply(inverse(b2),b2))) = inverse(multiply(inverse(b2),b2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_25,plain,
multiply(inverse(multiply(b2,inverse(multiply(multiply(inverse(inverse(multiply(inverse(b2),b2))),multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(b2),b2)))),b2)))),multiply(b2,inverse(b2))) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_13]),c_0_13]) ).
cnf(c_0_26,plain,
multiply(inverse(multiply(b2,inverse(multiply(inverse(multiply(b2,inverse(multiply(multiply(inverse(inverse(multiply(inverse(b2),b2))),multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(b2),b2)))),b2)))),b2)))),multiply(b2,inverse(b2))) = multiply(inverse(multiply(inverse(inverse(multiply(b2,inverse(b2)))),inverse(multiply(inverse(b2),b2)))),multiply(inverse(b2),b2)),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_27,plain,
multiply(inverse(multiply(inverse(inverse(X1)),inverse(X2))),multiply(inverse(X3),X3)) = multiply(inverse(multiply(X4,inverse(X2))),multiply(X4,inverse(X1))),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_28,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X2)))),multiply(X1,inverse(X3))) = multiply(inverse(X4),multiply(multiply(inverse(multiply(X5,inverse(multiply(X4,X6)))),multiply(X5,inverse(X6))),inverse(X3))),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_29,plain,
multiply(inverse(multiply(b2,inverse(multiply(inverse(multiply(b2,inverse(multiply(multiply(inverse(inverse(multiply(inverse(b2),b2))),multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(b2),b2)))),b2)))),b2)))),multiply(b2,inverse(b2))) = multiply(inverse(multiply(b2,inverse(multiply(inverse(b2),b2)))),multiply(b2,inverse(multiply(b2,inverse(b2))))),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
multiply(multiply(inverse(multiply(b2,inverse(multiply(inverse(b2),b2)))),multiply(b2,inverse(X1))),inverse(multiply(inverse(X2),X2))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_12]),c_0_28]) ).
cnf(c_0_31,plain,
multiply(multiply(inverse(inverse(X1)),multiply(multiply(inverse(inverse(X1)),multiply(multiply(inverse(multiply(X2,inverse(multiply(inverse(X3),X3)))),multiply(X2,inverse(X1))),inverse(X1))),inverse(X1))),inverse(multiply(inverse(X1),X1))) = inverse(X1),
inference(spm,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_32,plain,
multiply(multiply(inverse(inverse(multiply(inverse(X1),X1))),multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(X1),X1)))),inverse(multiply(inverse(b2),b2))) = inverse(multiply(inverse(X1),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_12]),c_0_13]) ).
cnf(c_0_33,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_34,plain,
inverse(multiply(b2,inverse(multiply(multiply(inverse(inverse(multiply(inverse(b2),b2))),multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(b2),b2)))),b2)))) = inverse(multiply(b2,inverse(b2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_29]),c_0_30]) ).
cnf(c_0_35,plain,
multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(b2),b2))) = inverse(multiply(inverse(b2),b2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_13]),c_0_13]) ).
cnf(c_0_36,negated_conjecture,
multiply(multiply(inverse(X1),X1),a2) != a2,
inference(spm,[status(thm)],[c_0_33,c_0_13]) ).
cnf(c_0_37,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(multiply(inverse(X3),X3)))) = multiply(inverse(multiply(b2,inverse(X2))),multiply(b2,inverse(multiply(inverse(b2),b2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_15]) ).
cnf(c_0_38,plain,
inverse(multiply(b2,inverse(multiply(multiply(inverse(b2),b2),b2)))) = inverse(multiply(b2,inverse(b2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_13]) ).
cnf(c_0_39,negated_conjecture,
multiply(multiply(inverse(multiply(X1,inverse(multiply(inverse(b2),b2)))),multiply(X1,inverse(multiply(inverse(X2),X2)))),a2) != a2,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
inverse(inverse(multiply(inverse(b2),b2))) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_38]),c_0_13]) ).
cnf(c_0_41,negated_conjecture,
multiply(multiply(inverse(multiply(inverse(X1),X1)),multiply(inverse(b2),b2)),a2) != a2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_19]),c_0_19]) ).
cnf(c_0_42,plain,
inverse(multiply(inverse(b2),b2)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_40]),c_0_19]),c_0_35]) ).
cnf(c_0_43,negated_conjecture,
multiply(multiply(inverse(multiply(inverse(X1),X1)),multiply(inverse(X2),X2)),a2) != a2,
inference(spm,[status(thm)],[c_0_41,c_0_13]) ).
cnf(c_0_44,plain,
multiply(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X2)))),multiply(X1,inverse(X3))),inverse(multiply(inverse(X4),X4))) = inverse(X3),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_45,plain,
multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(X1),X1))) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_38]),c_0_13]) ).
cnf(c_0_46,plain,
multiply(multiply(inverse(b2),b2),multiply(inverse(b2),b2)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_42]),c_0_42]) ).
cnf(c_0_47,negated_conjecture,
multiply(multiply(multiply(inverse(b2),b2),multiply(inverse(X1),X1)),a2) != a2,
inference(spm,[status(thm)],[c_0_43,c_0_42]) ).
cnf(c_0_48,plain,
multiply(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(multiply(X3,inverse(X4))))),inverse(multiply(inverse(X5),X5))) = inverse(multiply(X3,inverse(multiply(multiply(X2,inverse(multiply(inverse(X4),X4))),X4)))),
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
cnf(c_0_49,plain,
inverse(multiply(inverse(X1),X1)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_45]),c_0_42]),c_0_46]),c_0_45]) ).
cnf(c_0_50,negated_conjecture,
multiply(multiply(multiply(inverse(X1),X1),multiply(inverse(X2),X2)),a2) != a2,
inference(spm,[status(thm)],[c_0_47,c_0_13]) ).
cnf(c_0_51,plain,
multiply(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(multiply(X3,inverse(X4))))),multiply(inverse(b2),b2)) = inverse(multiply(X3,inverse(multiply(multiply(X2,multiply(inverse(b2),b2)),X4)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_49]) ).
cnf(c_0_52,negated_conjecture,
multiply(inverse(multiply(X1,inverse(multiply(multiply(multiply(X1,inverse(X2)),multiply(inverse(b2),b2)),X2)))),a2) != a2,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
multiply(inverse(multiply(X1,inverse(multiply(multiply(multiply(X1,inverse(X2)),multiply(inverse(X3),X3)),X2)))),a2) != a2,
inference(spm,[status(thm)],[c_0_52,c_0_13]) ).
cnf(c_0_54,negated_conjecture,
multiply(inverse(multiply(X1,inverse(multiply(multiply(multiply(multiply(inverse(multiply(X2,inverse(multiply(a2,X3)))),multiply(X2,inverse(X3))),inverse(X4)),multiply(inverse(X5),X5)),X4)))),multiply(X1,multiply(inverse(b2),b2))) != a2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_15]),c_0_49]) ).
cnf(c_0_55,plain,
multiply(inverse(multiply(X1,inverse(multiply(multiply(X2,multiply(inverse(b2),b2)),multiply(inverse(X3),X3))))),multiply(X1,multiply(inverse(b2),b2))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_18]),c_0_49]),c_0_49]) ).
cnf(c_0_56,plain,
multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))),multiply(inverse(b2),b2)) = X2,
inference(rw,[status(thm)],[c_0_12,c_0_49]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_49]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : GRP410-1 : TPTP v8.1.2. Released v2.6.0.
% 0.04/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n001.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 02:46:52 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.QuEucgGXvH/E---3.1_23471.p
% 2.88/0.75 # Version: 3.1pre001
% 2.88/0.75 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.88/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.88/0.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.88/0.75 # Starting new_bool_3 with 300s (1) cores
% 2.88/0.75 # Starting new_bool_1 with 300s (1) cores
% 2.88/0.75 # Starting sh5l with 300s (1) cores
% 2.88/0.75 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 23549 completed with status 0
% 2.88/0.75 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.88/0.75 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.88/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.88/0.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.88/0.75 # No SInE strategy applied
% 2.88/0.75 # Search class: FUUPF-FFSF21-DFFFFFNN
% 2.88/0.75 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.88/0.75 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.88/0.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.88/0.75 # Starting new_bool_3 with 136s (1) cores
% 2.88/0.75 # Starting new_bool_1 with 136s (1) cores
% 2.88/0.75 # Starting sh5l with 136s (1) cores
% 2.88/0.75 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 23555 completed with status 0
% 2.88/0.75 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.88/0.75 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.88/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.88/0.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.88/0.75 # No SInE strategy applied
% 2.88/0.75 # Search class: FUUPF-FFSF21-DFFFFFNN
% 2.88/0.75 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.88/0.75 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.88/0.75 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.88/0.75 # Preprocessing time : 0.001 s
% 2.88/0.75
% 2.88/0.75 # Proof found!
% 2.88/0.75 # SZS status Unsatisfiable
% 2.88/0.75 # SZS output start CNFRefutation
% See solution above
% 2.88/0.75 # Parsed axioms : 2
% 2.88/0.75 # Removed by relevancy pruning/SinE : 0
% 2.88/0.75 # Initial clauses : 2
% 2.88/0.75 # Removed in clause preprocessing : 0
% 2.88/0.75 # Initial clauses in saturation : 2
% 2.88/0.75 # Processed clauses : 1589
% 2.88/0.75 # ...of these trivial : 267
% 2.88/0.75 # ...subsumed : 1028
% 2.88/0.75 # ...remaining for further processing : 294
% 2.88/0.75 # Other redundant clauses eliminated : 0
% 2.88/0.75 # Clauses deleted for lack of memory : 0
% 2.88/0.75 # Backward-subsumed : 14
% 2.88/0.75 # Backward-rewritten : 148
% 2.88/0.75 # Generated clauses : 16352
% 2.88/0.75 # ...of the previous two non-redundant : 14453
% 2.88/0.75 # ...aggressively subsumed : 0
% 2.88/0.75 # Contextual simplify-reflections : 0
% 2.88/0.75 # Paramodulations : 16352
% 2.88/0.75 # Factorizations : 0
% 2.88/0.75 # NegExts : 0
% 2.88/0.75 # Equation resolutions : 0
% 2.88/0.75 # Total rewrite steps : 17379
% 2.88/0.75 # Propositional unsat checks : 0
% 2.88/0.75 # Propositional check models : 0
% 2.88/0.75 # Propositional check unsatisfiable : 0
% 2.88/0.75 # Propositional clauses : 0
% 2.88/0.75 # Propositional clauses after purity: 0
% 2.88/0.75 # Propositional unsat core size : 0
% 2.88/0.75 # Propositional preprocessing time : 0.000
% 2.88/0.75 # Propositional encoding time : 0.000
% 2.88/0.75 # Propositional solver time : 0.000
% 2.88/0.75 # Success case prop preproc time : 0.000
% 2.88/0.75 # Success case prop encoding time : 0.000
% 2.88/0.75 # Success case prop solver time : 0.000
% 2.88/0.75 # Current number of processed clauses : 132
% 2.88/0.75 # Positive orientable unit clauses : 76
% 2.88/0.75 # Positive unorientable unit clauses: 16
% 2.88/0.75 # Negative unit clauses : 40
% 2.88/0.75 # Non-unit-clauses : 0
% 2.88/0.75 # Current number of unprocessed clauses: 11359
% 2.88/0.75 # ...number of literals in the above : 11359
% 2.88/0.75 # Current number of archived formulas : 0
% 2.88/0.75 # Current number of archived clauses : 162
% 2.88/0.75 # Clause-clause subsumption calls (NU) : 0
% 2.88/0.75 # Rec. Clause-clause subsumption calls : 0
% 2.88/0.75 # Non-unit clause-clause subsumptions : 0
% 2.88/0.75 # Unit Clause-clause subsumption calls : 892
% 2.88/0.75 # Rewrite failures with RHS unbound : 0
% 2.88/0.75 # BW rewrite match attempts : 2703
% 2.88/0.75 # BW rewrite match successes : 363
% 2.88/0.75 # Condensation attempts : 0
% 2.88/0.75 # Condensation successes : 0
% 2.88/0.75 # Termbank termtop insertions : 631802
% 2.88/0.75
% 2.88/0.75 # -------------------------------------------------
% 2.88/0.75 # User time : 0.317 s
% 2.88/0.75 # System time : 0.018 s
% 2.88/0.75 # Total time : 0.336 s
% 2.88/0.75 # Maximum resident set size: 1504 pages
% 2.88/0.75
% 2.88/0.75 # -------------------------------------------------
% 2.88/0.75 # User time : 1.639 s
% 2.88/0.75 # System time : 0.030 s
% 2.88/0.75 # Total time : 1.668 s
% 2.88/0.75 # Maximum resident set size: 1672 pages
% 2.88/0.75 % E---3.1 exiting
% 2.88/0.75 % E---3.1 exiting
%------------------------------------------------------------------------------