TSTP Solution File: GRP426-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP426-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:41:11 EDT 2023
% Result : Unsatisfiable 0.68s 0.55s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 2
% Syntax : Number of clauses : 63 ( 63 unt; 0 nHn; 3 RR)
% Number of literals : 63 ( 62 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 154 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X3),X3))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.yigKZtsTLm/E---3.1_32536.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/tmp/tmp.yigKZtsTLm/E---3.1_32536.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X3),X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(inverse(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(inverse(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(inverse(X2),X3)))),multiply(X1,inverse(X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),X3)))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(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_6,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(multiply(X3,inverse(X4))))) = multiply(inverse(multiply(X5,inverse(X2))),multiply(X5,inverse(multiply(X3,inverse(X4))))),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
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_6,c_0_2]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(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(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),multiply(X3,inverse(multiply(inverse(X4),X4))))))),multiply(X1,inverse(multiply(X3,inverse(multiply(inverse(X4),X4))))))),inverse(multiply(inverse(X5),X5))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_2]) ).
cnf(c_0_10,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X4),X4))) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(inverse(X1),multiply(inverse(multiply(inverse(multiply(X2,inverse(multiply(inverse(X1),X3)))),multiply(X2,inverse(X3)))),inverse(X3)))),inverse(multiply(inverse(X3),X3))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_12,plain,
multiply(inverse(X1),inverse(multiply(inverse(X2),X2))) = multiply(inverse(X1),inverse(multiply(inverse(X3),X3))),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_13,plain,
multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(a3),a3))) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).
cnf(c_0_14,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_15,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(X2),X2)),X3)))),multiply(X1,inverse(X3))) = inverse(multiply(inverse(X3),X3)),
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_16,plain,
multiply(inverse(X1),X1) = inverse(multiply(inverse(a3),a3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_10]),c_0_14]) ).
cnf(c_0_17,plain,
multiply(inverse(X1),X1) = inverse(multiply(inverse(X2),X2)),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_18,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3)))),multiply(inverse(a3),a3)) = X2,
inference(rw,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_19,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(inverse(multiply(inverse(X3),X3)))))),inverse(multiply(inverse(a3),a3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),X3)))),multiply(X4,inverse(X3))),
inference(rw,[status(thm)],[c_0_3,c_0_12]) ).
cnf(c_0_20,plain,
multiply(inverse(multiply(inverse(multiply(X1,multiply(inverse(a3),a3))),multiply(X1,inverse(X2)))),multiply(inverse(a3),a3)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_17]) ).
cnf(c_0_21,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(X2),inverse(multiply(inverse(multiply(X3,inverse(X4))),multiply(X3,inverse(X4)))))),multiply(X5,inverse(X4)))))),multiply(X1,inverse(multiply(X5,inverse(X4))))) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_22,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,multiply(inverse(a3),a3)))),multiply(inverse(a3),a3)) = multiply(inverse(multiply(X3,inverse(multiply(inverse(X2),X4)))),multiply(X3,inverse(X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_16]),c_0_17]),c_0_17]) ).
cnf(c_0_23,plain,
multiply(inverse(multiply(multiply(inverse(a3),a3),multiply(multiply(inverse(a3),a3),inverse(X1)))),multiply(inverse(a3),a3)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_17]),c_0_17]) ).
cnf(c_0_24,plain,
multiply(inverse(multiply(a3,inverse(multiply(inverse(multiply(inverse(X1),multiply(inverse(a3),a3))),a3)))),multiply(a3,inverse(a3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_14]),c_0_17]),c_0_22]) ).
cnf(c_0_25,plain,
multiply(inverse(multiply(multiply(inverse(X1),X1),multiply(multiply(inverse(X1),X1),inverse(X2)))),multiply(inverse(X1),X1)) = X2,
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_26,plain,
multiply(inverse(multiply(a3,inverse(multiply(inverse(X1),a3)))),multiply(a3,inverse(a3))) = multiply(multiply(inverse(a3),a3),multiply(multiply(inverse(a3),a3),inverse(X1))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
multiply(multiply(inverse(a3),a3),multiply(multiply(inverse(a3),a3),inverse(multiply(inverse(X1),multiply(inverse(a3),a3))))) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_28,plain,
multiply(multiply(inverse(X1),X1),multiply(inverse(a3),a3)) = multiply(inverse(a3),a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_16]),c_0_16]) ).
cnf(c_0_29,plain,
multiply(multiply(inverse(X1),X1),multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(X2),multiply(inverse(X1),X1))))) = X2,
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_30,plain,
multiply(inverse(multiply(X1,inverse(multiply(multiply(inverse(X2),X2),X3)))),multiply(X1,inverse(X3))) = multiply(inverse(a3),a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_17]),c_0_17]) ).
cnf(c_0_31,plain,
multiply(multiply(inverse(X1),X1),multiply(inverse(X2),X2)) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_28,c_0_14]) ).
cnf(c_0_32,plain,
multiply(inverse(inverse(X1)),inverse(multiply(multiply(inverse(X2),X2),X1))) = multiply(inverse(a3),a3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17]),c_0_31]),c_0_31]) ).
cnf(c_0_33,plain,
multiply(inverse(multiply(inverse(multiply(X1,multiply(inverse(X2),X2))),multiply(X1,inverse(X3)))),multiply(inverse(X2),X2)) = X3,
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_34,plain,
multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(X1),multiply(inverse(multiply(inverse(multiply(X2,inverse(multiply(inverse(X1),X3)))),multiply(X2,inverse(X3)))),inverse(X3)))),inverse(multiply(inverse(X4),multiply(inverse(X3),X3))))),X3)),inverse(multiply(inverse(multiply(inverse(X3),X3)),multiply(inverse(X3),X3)))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_11]) ).
cnf(c_0_35,plain,
inverse(multiply(multiply(inverse(X1),X1),X2)) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_32]),c_0_17]),c_0_33]) ).
cnf(c_0_36,plain,
multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(X1),multiply(inverse(multiply(inverse(multiply(X2,inverse(multiply(inverse(X1),X3)))),multiply(X2,inverse(X3)))),inverse(X3)))),inverse(multiply(inverse(X4),multiply(inverse(X3),X3))))),X3)),inverse(multiply(inverse(a3),a3))) = X4,
inference(rw,[status(thm)],[c_0_34,c_0_12]) ).
cnf(c_0_37,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_35]),c_0_29]) ).
cnf(c_0_38,plain,
multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(X1),multiply(inverse(multiply(inverse(multiply(X2,inverse(multiply(inverse(X1),X3)))),multiply(X2,inverse(X3)))),inverse(X3)))),inverse(multiply(inverse(X4),multiply(inverse(X3),X3))))),X3)),multiply(inverse(a3),a3)) = X4,
inference(rw,[status(thm)],[c_0_36,c_0_16]) ).
cnf(c_0_39,plain,
inverse(multiply(inverse(X1),multiply(inverse(X2),X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_37]),c_0_37]) ).
cnf(c_0_40,plain,
multiply(inverse(inverse(X1)),multiply(inverse(X2),X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_35]),c_0_35]) ).
cnf(c_0_41,plain,
multiply(X1,multiply(inverse(a3),a3)) = X1,
inference(rw,[status(thm)],[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_38,c_0_39]),c_0_10]),c_0_17]),c_0_17]),c_0_31]),c_0_39]),c_0_37]) ).
cnf(c_0_42,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_39]),c_0_40]) ).
cnf(c_0_43,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_41]),c_0_17]),c_0_41]) ).
cnf(c_0_44,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(spm,[status(thm)],[c_0_37,c_0_43]) ).
cnf(c_0_46,plain,
multiply(X1,inverse(X1)) = multiply(inverse(a3),a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_43]),c_0_17]) ).
cnf(c_0_47,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(X2,multiply(inverse(a3),a3))),multiply(X2,inverse(X3)))))),multiply(X1,inverse(multiply(inverse(X4),inverse(X3))))) = X4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_14]),c_0_17]) ).
cnf(c_0_48,plain,
multiply(X1,inverse(multiply(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
multiply(inverse(X1),X1) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_17]),c_0_37]),c_0_46]) ).
cnf(c_0_50,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
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_5,c_0_45]),c_0_17]),c_0_41]),c_0_43]),c_0_43]),c_0_45]) ).
cnf(c_0_51,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
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_47,c_0_48]),c_0_41]),c_0_48]),c_0_49]),c_0_48]),c_0_43]) ).
cnf(c_0_52,plain,
multiply(multiply(X1,inverse(X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_50,c_0_43]) ).
cnf(c_0_53,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_51,c_0_50]) ).
cnf(c_0_54,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_51,c_0_43]) ).
cnf(c_0_55,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
multiply(multiply(X1,inverse(X2)),multiply(X2,multiply(inverse(X1),X3))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_41]),c_0_56]),c_0_56]),c_0_57]) ).
cnf(c_0_59,plain,
multiply(multiply(X1,inverse(X2)),multiply(X2,X3)) = multiply(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_54]),c_0_43]) ).
cnf(c_0_60,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_61,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_51]),c_0_43]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP426-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 02:51:16 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.yigKZtsTLm/E---3.1_32536.p
% 0.68/0.55 # Version: 3.1pre001
% 0.68/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.68/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.68/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.68/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.68/0.55 # Starting sh5l with 300s (1) cores
% 0.68/0.55 # new_bool_1 with pid 32617 completed with status 8
% 0.68/0.55 # new_bool_3 with pid 32616 completed with status 8
% 0.68/0.55 # sh5l with pid 32618 completed with status 0
% 0.68/0.55 # Result found by sh5l
% 0.68/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.68/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.68/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.68/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.68/0.55 # Starting sh5l with 300s (1) cores
% 0.68/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.68/0.55 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.68/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.68/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.68/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32626 completed with status 0
% 0.68/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.68/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.68/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.68/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.68/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.68/0.55 # Starting sh5l with 300s (1) cores
% 0.68/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.68/0.55 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.68/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.68/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.68/0.55 # Preprocessing time : 0.001 s
% 0.68/0.55 # Presaturation interreduction done
% 0.68/0.55
% 0.68/0.55 # Proof found!
% 0.68/0.55 # SZS status Unsatisfiable
% 0.68/0.55 # SZS output start CNFRefutation
% See solution above
% 0.68/0.55 # Parsed axioms : 2
% 0.68/0.55 # Removed by relevancy pruning/SinE : 0
% 0.68/0.55 # Initial clauses : 2
% 0.68/0.55 # Removed in clause preprocessing : 0
% 0.68/0.55 # Initial clauses in saturation : 2
% 0.68/0.55 # Processed clauses : 282
% 0.68/0.55 # ...of these trivial : 40
% 0.68/0.55 # ...subsumed : 148
% 0.68/0.55 # ...remaining for further processing : 94
% 0.68/0.55 # Other redundant clauses eliminated : 0
% 0.68/0.55 # Clauses deleted for lack of memory : 0
% 0.68/0.55 # Backward-subsumed : 4
% 0.68/0.55 # Backward-rewritten : 76
% 0.68/0.55 # Generated clauses : 3758
% 0.68/0.55 # ...of the previous two non-redundant : 3224
% 0.68/0.55 # ...aggressively subsumed : 0
% 0.68/0.55 # Contextual simplify-reflections : 0
% 0.68/0.55 # Paramodulations : 3758
% 0.68/0.55 # Factorizations : 0
% 0.68/0.55 # NegExts : 0
% 0.68/0.55 # Equation resolutions : 0
% 0.68/0.55 # Total rewrite steps : 3126
% 0.68/0.55 # Propositional unsat checks : 0
% 0.68/0.55 # Propositional check models : 0
% 0.68/0.55 # Propositional check unsatisfiable : 0
% 0.68/0.55 # Propositional clauses : 0
% 0.68/0.55 # Propositional clauses after purity: 0
% 0.68/0.55 # Propositional unsat core size : 0
% 0.68/0.55 # Propositional preprocessing time : 0.000
% 0.68/0.55 # Propositional encoding time : 0.000
% 0.68/0.55 # Propositional solver time : 0.000
% 0.68/0.55 # Success case prop preproc time : 0.000
% 0.68/0.55 # Success case prop encoding time : 0.000
% 0.68/0.55 # Success case prop solver time : 0.000
% 0.68/0.55 # Current number of processed clauses : 12
% 0.68/0.55 # Positive orientable unit clauses : 11
% 0.68/0.55 # Positive unorientable unit clauses: 1
% 0.68/0.55 # Negative unit clauses : 0
% 0.68/0.55 # Non-unit-clauses : 0
% 0.68/0.55 # Current number of unprocessed clauses: 2442
% 0.68/0.55 # ...number of literals in the above : 2442
% 0.68/0.55 # Current number of archived formulas : 0
% 0.68/0.55 # Current number of archived clauses : 82
% 0.68/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.68/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.68/0.55 # Non-unit clause-clause subsumptions : 0
% 0.68/0.55 # Unit Clause-clause subsumption calls : 69
% 0.68/0.55 # Rewrite failures with RHS unbound : 0
% 0.68/0.55 # BW rewrite match attempts : 451
% 0.68/0.55 # BW rewrite match successes : 128
% 0.68/0.55 # Condensation attempts : 0
% 0.68/0.55 # Condensation successes : 0
% 0.68/0.55 # Termbank termtop insertions : 114521
% 0.68/0.55
% 0.68/0.55 # -------------------------------------------------
% 0.68/0.55 # User time : 0.064 s
% 0.68/0.55 # System time : 0.003 s
% 0.68/0.55 # Total time : 0.067 s
% 0.68/0.55 # Maximum resident set size: 1416 pages
% 0.68/0.55
% 0.68/0.55 # -------------------------------------------------
% 0.68/0.55 # User time : 0.093 s
% 0.68/0.55 # System time : 0.017 s
% 0.68/0.55 # Total time : 0.111 s
% 0.68/0.55 # Maximum resident set size: 1672 pages
% 0.68/0.55 % E---3.1 exiting
% 0.68/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------