TSTP Solution File: GRP436-1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : GRP436-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% 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 : Mon Jun 24 06:54:54 EDT 2024
% Result : Unsatisfiable 2.50s 0.81s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 2
% Syntax : Number of clauses : 69 ( 69 unt; 0 nHn; 14 RR)
% Number of literals : 69 ( 68 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 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 : 176 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X1))))) = X4,
file('/export/starexec/sandbox/tmp/tmp.X1UCTB4ssf/E---3.1_10202.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/tmp/tmp.X1UCTB4ssf/E---3.1_10202.p',prove_these_axioms_1) ).
cnf(c_0_2,axiom,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X1))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(X3,X4))),inverse(X5))),multiply(X5,multiply(X3,X1))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(X3,inverse(X4))),multiply(X4,multiply(X5,X1))))) = multiply(X6,multiply(multiply(inverse(X6),inverse(multiply(X3,X5))),inverse(X2))),
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(X3,X1))),multiply(inverse(X4),inverse(multiply(X5,X6))))))),inverse(multiply(X6,multiply(X4,X3)))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_6,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(X2,multiply(inverse(X3),inverse(multiply(X4,multiply(X5,multiply(X2,inverse(X3))))))))),inverse(X5))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_7,plain,
multiply(X1,inverse(multiply(inverse(multiply(X2,multiply(X3,X4))),multiply(X5,multiply(multiply(inverse(X5),inverse(X6)),X1))))) = inverse(multiply(X7,multiply(X8,multiply(multiply(inverse(X8),inverse(multiply(X4,X7))),multiply(inverse(X3),inverse(multiply(X6,X2))))))),
inference(spm,[status(thm)],[c_0_2,c_0_5]) ).
cnf(c_0_8,plain,
multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(multiply(X3,multiply(X1,multiply(X4,inverse(X2)))))),X3))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_9,plain,
multiply(multiply(a1,inverse(multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(a1,multiply(multiply(inverse(a1),inverse(X4)),a1))))),inverse(multiply(X1,multiply(X2,X3)))) = X4,
inference(rw,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(multiply(X3,X4))),X3))),inverse(X2))) = X4,
inference(spm,[status(thm)],[c_0_6,c_0_2]) ).
cnf(c_0_11,plain,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(X4,X1))))) = multiply(inverse(X5),inverse(multiply(X2,multiply(X3,multiply(X4,inverse(X5)))))),
inference(spm,[status(thm)],[c_0_2,c_0_8]) ).
cnf(c_0_12,plain,
multiply(multiply(a1,inverse(multiply(inverse(X1),multiply(a1,multiply(multiply(inverse(a1),inverse(X2)),a1))))),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(X4,X1))))) = multiply(X5,inverse(multiply(X2,multiply(X3,multiply(X4,X5))))),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_14,plain,
multiply(X1,inverse(multiply(inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X5)))),multiply(X6,multiply(multiply(inverse(X6),inverse(X4)),X1))))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_15,plain,
multiply(multiply(X1,inverse(multiply(inverse(X2),multiply(a1,multiply(multiply(inverse(a1),inverse(X3)),X1))))),inverse(X2)) = X3,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(X2)),inverse(X3))) = multiply(X4,multiply(multiply(inverse(X4),inverse(X2)),inverse(X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_2]) ).
cnf(c_0_17,plain,
multiply(inverse(X1),inverse(multiply(multiply(a1,multiply(multiply(inverse(a1),inverse(X2)),inverse(X3))),multiply(X3,X2)))) = inverse(X1),
inference(spm,[status(thm)],[c_0_2,c_0_15]) ).
cnf(c_0_18,plain,
multiply(multiply(inverse(X1),inverse(multiply(inverse(X2),multiply(a1,X3)))),inverse(X2)) = multiply(inverse(X1),multiply(a1,multiply(multiply(inverse(a1),inverse(X3)),inverse(a1)))),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_19,plain,
multiply(X1,multiply(inverse(X1),inverse(X2))) = multiply(X3,multiply(inverse(X3),inverse(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_20,plain,
multiply(inverse(X1),multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(multiply(inverse(a1),inverse(X2)),inverse(X1)))),inverse(a1)))) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_21,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_17]) ).
cnf(c_0_22,plain,
multiply(inverse(multiply(inverse(a1),inverse(X1))),multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(X2,inverse(X2)))),inverse(a1)))) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
multiply(inverse(multiply(X1,inverse(X1))),multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(X2,inverse(X2)))),inverse(a1)))) = inverse(a1),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_24,plain,
multiply(multiply(a1,inverse(a1)),inverse(multiply(X1,inverse(X1)))) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_21]) ).
cnf(c_0_25,plain,
multiply(X1,multiply(inverse(X1),multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(multiply(inverse(a1),inverse(X2)),inverse(a1)))),inverse(a1))))) = multiply(a1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_18]),c_0_18]) ).
cnf(c_0_26,plain,
multiply(X1,inverse(multiply(multiply(X2,X3),multiply(X4,multiply(inverse(X4),X1))))) = multiply(a1,multiply(multiply(inverse(a1),inverse(X3)),inverse(X2))),
inference(spm,[status(thm)],[c_0_2,c_0_17]) ).
cnf(c_0_27,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,inverse(X2)))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_28,plain,
multiply(X1,multiply(inverse(X1),multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(multiply(X2,inverse(X2)),inverse(a1)))),inverse(a1))))) = multiply(a1,inverse(a1)),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_29,plain,
multiply(X1,inverse(multiply(inverse(multiply(multiply(X2,multiply(X3,inverse(X4))),multiply(X4,multiply(X5,X6)))),multiply(X7,multiply(multiply(inverse(X7),inverse(multiply(X8,multiply(multiply(inverse(X8),inverse(multiply(X3,X5))),inverse(X2))))),X1))))) = X6,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_30,plain,
multiply(a1,multiply(multiply(inverse(a1),inverse(inverse(X1))),inverse(X1))) = multiply(a1,multiply(multiply(a1,inverse(a1)),inverse(a1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_27]),c_0_26]),c_0_21]) ).
cnf(c_0_31,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(X3)),X4))),inverse(X2))) = multiply(multiply(inverse(X4),inverse(multiply(multiply(inverse(X5),inverse(multiply(X6,X3))),X6))),inverse(X5)),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_32,plain,
multiply(inverse(X1),inverse(multiply(multiply(a1,multiply(multiply(X2,inverse(X2)),inverse(a1))),multiply(a1,inverse(a1))))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_15]) ).
cnf(c_0_33,plain,
multiply(multiply(inverse(a1),inverse(inverse(X1))),inverse(X1)) = multiply(multiply(a1,inverse(a1)),inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_29]) ).
cnf(c_0_34,plain,
multiply(X1,multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(multiply(inverse(a1),inverse(X2)),X1))),inverse(a1)))) = X2,
inference(rw,[status(thm)],[c_0_10,c_0_31]) ).
cnf(c_0_35,plain,
multiply(inverse(X1),inverse(multiply(multiply(X2,multiply(multiply(inverse(X2),inverse(inverse(a1))),inverse(a1))),multiply(a1,inverse(a1))))) = inverse(X1),
inference(spm,[status(thm)],[c_0_32,c_0_16]) ).
cnf(c_0_36,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(inverse(X2))),inverse(X2))) = multiply(a1,multiply(multiply(a1,inverse(a1)),inverse(a1))),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_37,plain,
multiply(multiply(multiply(inverse(multiply(inverse(X1),inverse(multiply(X2,X3)))),inverse(multiply(multiply(inverse(X4),inverse(multiply(X5,X6))),X5))),inverse(X4)),inverse(multiply(X3,multiply(X1,X6)))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_10]) ).
cnf(c_0_38,plain,
multiply(X1,multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(inverse(a1),X1))),inverse(a1)))) = multiply(multiply(a1,multiply(multiply(a1,inverse(a1)),inverse(a1))),multiply(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,plain,
multiply(inverse(X1),inverse(multiply(multiply(X2,inverse(multiply(X3,multiply(X1,multiply(X4,X2))))),X3))) = X4,
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_40,plain,
multiply(multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(multiply(inverse(a1),inverse(X1)),multiply(inverse(X2),inverse(multiply(X3,X4)))))),inverse(a1))),inverse(multiply(X4,multiply(X2,X1)))) = X3,
inference(rw,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_41,plain,
multiply(multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(inverse(a1),inverse(a1)))),inverse(a1))),multiply(a1,multiply(inverse(a1),inverse(a1)))) = multiply(multiply(a1,multiply(multiply(a1,inverse(a1)),inverse(a1))),multiply(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_38]),c_0_32]) ).
cnf(c_0_42,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(X2,multiply(X3,inverse(multiply(X4,multiply(X5,multiply(X2,X3)))))))),inverse(X5))) = X4,
inference(spm,[status(thm)],[c_0_10,c_0_39]) ).
cnf(c_0_43,plain,
multiply(X1,inverse(multiply(multiply(a1,multiply(multiply(a1,inverse(a1)),inverse(a1))),multiply(a1,inverse(a1))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_44,plain,
multiply(multiply(a1,multiply(multiply(a1,inverse(a1)),inverse(a1))),multiply(a1,inverse(a1))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_43]),c_0_27]) ).
cnf(c_0_45,plain,
multiply(X1,multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(inverse(a1),X1))),inverse(a1)))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[c_0_38,c_0_44]) ).
cnf(c_0_46,plain,
multiply(inverse(multiply(a1,inverse(a1))),multiply(a1,multiply(multiply(a1,inverse(a1)),inverse(a1)))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_43]),c_0_44]),c_0_21]) ).
cnf(c_0_47,plain,
multiply(X1,inverse(multiply(a1,inverse(a1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_44]),c_0_21]),c_0_42]) ).
cnf(c_0_48,plain,
multiply(inverse(a1),inverse(inverse(multiply(a1,inverse(a1))))) = multiply(multiply(a1,inverse(a1)),inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_43]),c_0_44]) ).
cnf(c_0_49,plain,
multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(multiply(a1,inverse(a1)),inverse(a1)))),inverse(a1))) = inverse(multiply(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_46]),c_0_47]),c_0_26]) ).
cnf(c_0_50,plain,
multiply(X1,inverse(multiply(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_47,c_0_21]) ).
cnf(c_0_51,plain,
multiply(X1,inverse(multiply(inverse(X2),multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,inverse(X4)))),X1))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_21]) ).
cnf(c_0_52,plain,
inverse(inverse(multiply(a1,inverse(a1)))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_48]),c_0_49]),c_0_50]) ).
cnf(c_0_53,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(multiply(X3,inverse(X3)),X1))),X4))) = X4,
inference(spm,[status(thm)],[c_0_14,c_0_51]) ).
cnf(c_0_54,plain,
multiply(multiply(a1,inverse(a1)),inverse(a1)) = multiply(inverse(a1),multiply(a1,inverse(a1))),
inference(rw,[status(thm)],[c_0_48,c_0_52]) ).
cnf(c_0_55,plain,
multiply(inverse(multiply(X1,inverse(X1))),multiply(X2,multiply(inverse(X2),X3))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_50]),c_0_50]) ).
cnf(c_0_56,plain,
multiply(multiply(X1,inverse(X1)),multiply(X2,inverse(X2))) = multiply(a1,multiply(multiply(a1,inverse(a1)),inverse(a1))),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_57,plain,
multiply(multiply(X1,inverse(X1)),inverse(a1)) = multiply(inverse(a1),multiply(X1,inverse(X1))),
inference(spm,[status(thm)],[c_0_54,c_0_21]) ).
cnf(c_0_58,plain,
multiply(a1,multiply(inverse(a1),multiply(a1,inverse(a1)))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_46]),c_0_56]),c_0_57]),c_0_55]),c_0_57]) ).
cnf(c_0_59,plain,
multiply(inverse(a1),multiply(a1,inverse(a1))) = inverse(a1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_58]),c_0_29]) ).
cnf(c_0_60,plain,
inverse(multiply(a1,inverse(a1))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_57]),c_0_18]),c_0_21]),c_0_57]),c_0_59]),c_0_59]) ).
cnf(c_0_61,plain,
multiply(X1,multiply(a1,inverse(a1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_60]),c_0_56]),c_0_57]),c_0_59]),c_0_60]) ).
cnf(c_0_62,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_61,c_0_21]) ).
cnf(c_0_63,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_64,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(inverse(X2))),inverse(X2))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_54]),c_0_61]) ).
cnf(c_0_65,plain,
multiply(multiply(X1,inverse(X1)),inverse(inverse(X2))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_62]),c_0_50]),c_0_62]) ).
cnf(c_0_66,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_63 ).
cnf(c_0_67,plain,
multiply(inverse(X1),X1) = multiply(a1,inverse(a1)),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_67])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP436-1 : TPTP v8.2.0. Released v2.6.0.
% 0.03/0.12 % Command : run_E %s %d SAT
% 0.11/0.32 % Computer : n023.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 : Thu Jun 20 10:18:08 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.X1UCTB4ssf/E---3.1_10202.p
% 2.50/0.81 # Version: 3.2.0
% 2.50/0.81 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.50/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.50/0.81 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.50/0.81 # Starting new_bool_3 with 300s (1) cores
% 2.50/0.81 # Starting new_bool_1 with 300s (1) cores
% 2.50/0.81 # Starting sh5l with 300s (1) cores
% 2.50/0.81 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10279 completed with status 0
% 2.50/0.81 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.50/0.81 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.50/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.50/0.81 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.50/0.81 # No SInE strategy applied
% 2.50/0.81 # Search class: FUUPF-FFSF21-DFFFFFNN
% 2.50/0.81 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.50/0.81 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.50/0.81 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.50/0.81 # Starting new_bool_3 with 136s (1) cores
% 2.50/0.81 # Starting new_bool_1 with 136s (1) cores
% 2.50/0.81 # Starting sh5l with 136s (1) cores
% 2.50/0.81 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10283 completed with status 0
% 2.50/0.81 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.50/0.81 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.50/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.50/0.81 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.50/0.81 # No SInE strategy applied
% 2.50/0.81 # Search class: FUUPF-FFSF21-DFFFFFNN
% 2.50/0.81 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.50/0.81 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.50/0.81 # Preprocessing time : 0.001 s
% 2.50/0.81 # Presaturation interreduction done
% 2.50/0.81
% 2.50/0.81 # Proof found!
% 2.50/0.81 # SZS status Unsatisfiable
% 2.50/0.81 # SZS output start CNFRefutation
% See solution above
% 2.50/0.81 # Parsed axioms : 2
% 2.50/0.81 # Removed by relevancy pruning/SinE : 0
% 2.50/0.81 # Initial clauses : 2
% 2.50/0.81 # Removed in clause preprocessing : 0
% 2.50/0.81 # Initial clauses in saturation : 2
% 2.50/0.81 # Processed clauses : 385
% 2.50/0.81 # ...of these trivial : 45
% 2.50/0.81 # ...subsumed : 218
% 2.50/0.81 # ...remaining for further processing : 122
% 2.50/0.81 # Other redundant clauses eliminated : 0
% 2.50/0.81 # Clauses deleted for lack of memory : 0
% 2.50/0.81 # Backward-subsumed : 3
% 2.50/0.81 # Backward-rewritten : 49
% 2.50/0.81 # Generated clauses : 19236
% 2.50/0.81 # ...of the previous two non-redundant : 18181
% 2.50/0.81 # ...aggressively subsumed : 0
% 2.50/0.81 # Contextual simplify-reflections : 0
% 2.50/0.81 # Paramodulations : 19236
% 2.50/0.81 # Factorizations : 0
% 2.50/0.81 # NegExts : 0
% 2.50/0.81 # Equation resolutions : 0
% 2.50/0.81 # Disequality decompositions : 0
% 2.50/0.81 # Total rewrite steps : 4302
% 2.50/0.81 # ...of those cached : 2968
% 2.50/0.81 # Propositional unsat checks : 0
% 2.50/0.81 # Propositional check models : 0
% 2.50/0.81 # Propositional check unsatisfiable : 0
% 2.50/0.81 # Propositional clauses : 0
% 2.50/0.81 # Propositional clauses after purity: 0
% 2.50/0.81 # Propositional unsat core size : 0
% 2.50/0.81 # Propositional preprocessing time : 0.000
% 2.50/0.81 # Propositional encoding time : 0.000
% 2.50/0.81 # Propositional solver time : 0.000
% 2.50/0.81 # Success case prop preproc time : 0.000
% 2.50/0.81 # Success case prop encoding time : 0.000
% 2.50/0.81 # Success case prop solver time : 0.000
% 2.50/0.81 # Current number of processed clauses : 68
% 2.50/0.81 # Positive orientable unit clauses : 49
% 2.50/0.81 # Positive unorientable unit clauses: 19
% 2.50/0.81 # Negative unit clauses : 0
% 2.50/0.81 # Non-unit-clauses : 0
% 2.50/0.81 # Current number of unprocessed clauses: 17498
% 2.50/0.81 # ...number of literals in the above : 17498
% 2.50/0.81 # Current number of archived formulas : 0
% 2.50/0.81 # Current number of archived clauses : 54
% 2.50/0.81 # Clause-clause subsumption calls (NU) : 0
% 2.50/0.81 # Rec. Clause-clause subsumption calls : 0
% 2.50/0.81 # Non-unit clause-clause subsumptions : 0
% 2.50/0.81 # Unit Clause-clause subsumption calls : 233
% 2.50/0.81 # Rewrite failures with RHS unbound : 0
% 2.50/0.81 # BW rewrite match attempts : 1406
% 2.50/0.81 # BW rewrite match successes : 191
% 2.50/0.81 # Condensation attempts : 0
% 2.50/0.81 # Condensation successes : 0
% 2.50/0.81 # Termbank termtop insertions : 589673
% 2.50/0.81 # Search garbage collected termcells : 2
% 2.50/0.81
% 2.50/0.81 # -------------------------------------------------
% 2.50/0.81 # User time : 0.305 s
% 2.50/0.81 # System time : 0.023 s
% 2.50/0.81 # Total time : 0.328 s
% 2.50/0.81 # Maximum resident set size: 1544 pages
% 2.50/0.81
% 2.50/0.81 # -------------------------------------------------
% 2.50/0.81 # User time : 1.589 s
% 2.50/0.81 # System time : 0.049 s
% 2.50/0.81 # Total time : 1.638 s
% 2.50/0.81 # Maximum resident set size: 1688 pages
% 2.50/0.81 % E---3.1 exiting
% 2.50/0.81 % E exiting
%------------------------------------------------------------------------------