TSTP Solution File: BOO026-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : BOO026-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:18:34 EDT 2023
% Result : Unsatisfiable 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 11
% Syntax : Number of clauses : 89 ( 89 unt; 0 nHn; 19 RR)
% Number of literals : 89 ( 88 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 114 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(add_multiply_property,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X2,X1),add(X3,X1)),
file('/export/starexec/sandbox2/tmp/tmp.p1bIINRQmv/E---3.1_23473.p',add_multiply_property) ).
cnf(multiply_add_property,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X2,X1),multiply(X3,X1)),
file('/export/starexec/sandbox2/tmp/tmp.p1bIINRQmv/E---3.1_23473.p',multiply_add_property) ).
cnf(pixley1_dual,axiom,
multiply(add(X1,inverse(X1)),multiply(add(X1,X2),add(inverse(X1),X2))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.p1bIINRQmv/E---3.1_23473.p',pixley1_dual) ).
cnf(additive_inverse,axiom,
add(X1,inverse(X1)) = n1,
file('/export/starexec/sandbox2/tmp/tmp.p1bIINRQmv/E---3.1_23473.p',additive_inverse) ).
cnf(multiplicative_inverse,axiom,
multiply(X1,inverse(X1)) = n0,
file('/export/starexec/sandbox2/tmp/tmp.p1bIINRQmv/E---3.1_23473.p',multiplicative_inverse) ).
cnf(pixley1,axiom,
add(multiply(X1,inverse(X1)),add(multiply(X1,X2),multiply(inverse(X1),X2))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.p1bIINRQmv/E---3.1_23473.p',pixley1) ).
cnf(pixley2,axiom,
add(multiply(X1,inverse(X2)),add(multiply(X1,X2),multiply(inverse(X2),X2))) = X1,
file('/export/starexec/sandbox2/tmp/tmp.p1bIINRQmv/E---3.1_23473.p',pixley2) ).
cnf(pixley2_dual,axiom,
multiply(add(X1,inverse(X2)),multiply(add(X1,X2),add(inverse(X2),X2))) = X1,
file('/export/starexec/sandbox2/tmp/tmp.p1bIINRQmv/E---3.1_23473.p',pixley2_dual) ).
cnf(pixley3,axiom,
add(multiply(X1,inverse(X2)),add(multiply(X1,X1),multiply(inverse(X2),X1))) = X1,
file('/export/starexec/sandbox2/tmp/tmp.p1bIINRQmv/E---3.1_23473.p',pixley3) ).
cnf(pixley3_dual,axiom,
multiply(add(X1,inverse(X2)),multiply(add(X1,X1),add(inverse(X2),X1))) = X1,
file('/export/starexec/sandbox2/tmp/tmp.p1bIINRQmv/E---3.1_23473.p',pixley3_dual) ).
cnf(prove_multiply_add,negated_conjecture,
multiply(add(a,b),b) != b,
file('/export/starexec/sandbox2/tmp/tmp.p1bIINRQmv/E---3.1_23473.p',prove_multiply_add) ).
cnf(c_0_11,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X2,X1),add(X3,X1)),
add_multiply_property ).
cnf(c_0_12,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X2,X1),multiply(X3,X1)),
multiply_add_property ).
cnf(c_0_13,axiom,
multiply(add(X1,inverse(X1)),multiply(add(X1,X2),add(inverse(X1),X2))) = X2,
pixley1_dual ).
cnf(c_0_14,axiom,
add(X1,inverse(X1)) = n1,
additive_inverse ).
cnf(c_0_15,axiom,
multiply(X1,inverse(X1)) = n0,
multiplicative_inverse ).
cnf(c_0_16,plain,
multiply(multiply(X1,add(X2,X3)),add(X4,multiply(X3,X1))) = add(multiply(X3,X1),multiply(multiply(X2,X1),X4)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
multiply(n1,add(X1,n0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_11]),c_0_15]) ).
cnf(c_0_18,axiom,
add(multiply(X1,inverse(X1)),add(multiply(X1,X2),multiply(inverse(X1),X2))) = X2,
pixley1 ).
cnf(c_0_19,plain,
add(multiply(n0,n1),multiply(multiply(X1,n1),X2)) = multiply(X1,add(X2,multiply(n0,n1))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
add(n0,multiply(X1,n1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_15]),c_0_12]),c_0_14]) ).
cnf(c_0_21,plain,
multiply(X1,add(n1,multiply(n0,n1))) = multiply(n1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_20]) ).
cnf(c_0_22,plain,
multiply(n1,add(X1,multiply(n0,n1))) = multiply(n1,add(n0,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_21]),c_0_12]) ).
cnf(c_0_23,plain,
multiply(n1,add(n0,n1)) = multiply(n1,n1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
multiply(inverse(X1),add(X2,X1)) = add(multiply(X2,inverse(X1)),n0),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_25,plain,
add(multiply(X1,add(n0,n1)),multiply(n1,n1)) = add(n1,multiply(n0,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_23]),c_0_11]) ).
cnf(c_0_26,plain,
add(add(multiply(X1,inverse(X2)),n0),multiply(X3,add(X1,X2))) = multiply(add(X1,X2),add(inverse(X2),X3)),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_27,plain,
multiply(n1,add(n1,n1)) = add(n1,multiply(n0,n1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_12]) ).
cnf(c_0_28,plain,
multiply(X1,add(X2,multiply(X1,n1))) = add(multiply(X1,n1),multiply(n0,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_29,plain,
add(X1,multiply(X2,add(X1,n0))) = multiply(add(X1,n0),add(n1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_30,plain,
multiply(add(n1,multiply(n0,n1)),add(X1,X2)) = add(multiply(n1,X1),multiply(n1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_21]) ).
cnf(c_0_31,plain,
add(add(n0,n0),add(n1,multiply(n0,n1))) = add(n1,n0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_15]),c_0_11]),c_0_15]) ).
cnf(c_0_32,plain,
multiply(n1,n0) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_21]),c_0_12]),c_0_17]) ).
cnf(c_0_33,plain,
add(X1,multiply(n0,add(X1,n0))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_29]),c_0_20]) ).
cnf(c_0_34,plain,
add(multiply(n1,n1),n0) = n1,
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_30,c_0_31]),c_0_30]),c_0_32]),c_0_17]),c_0_21]),c_0_20]) ).
cnf(c_0_35,plain,
add(multiply(X1,add(X2,n0)),X2) = multiply(add(X2,n0),add(X1,n1)),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_36,plain,
multiply(n1,n1) = n1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_12]),c_0_17]) ).
cnf(c_0_37,plain,
add(X1,X1) = multiply(add(X1,n0),add(n1,n1)),
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_38,plain,
add(X1,multiply(multiply(add(X1,n0),n1),add(X1,n0))) = add(X1,n0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_12]),c_0_17]) ).
cnf(c_0_39,plain,
add(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_34,c_0_36]) ).
cnf(c_0_40,plain,
multiply(inverse(X1),multiply(add(X1,n0),add(n1,n1))) = add(n0,n0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_37]),c_0_15]) ).
cnf(c_0_41,plain,
add(n1,n1) = n1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_36]),c_0_36]) ).
cnf(c_0_42,plain,
add(n0,n0) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_39]),c_0_27]),c_0_21]),c_0_15]) ).
cnf(c_0_43,axiom,
add(multiply(X1,inverse(X2)),add(multiply(X1,X2),multiply(inverse(X2),X2))) = X1,
pixley2 ).
cnf(c_0_44,plain,
multiply(inverse(n1),n1) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_41]),c_0_15]),c_0_42]) ).
cnf(c_0_45,plain,
add(multiply(X1,inverse(X2)),multiply(X2,add(X1,inverse(X2)))) = X1,
inference(rw,[status(thm)],[c_0_43,c_0_12]) ).
cnf(c_0_46,plain,
inverse(n1) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_44]),c_0_42]) ).
cnf(c_0_47,axiom,
multiply(add(X1,inverse(X2)),multiply(add(X1,X2),add(inverse(X2),X2))) = X1,
pixley2_dual ).
cnf(c_0_48,plain,
add(multiply(X1,n0),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_17]) ).
cnf(c_0_49,plain,
multiply(inverse(n0),n0) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_42]),c_0_15]),c_0_42]) ).
cnf(c_0_50,plain,
multiply(add(X1,inverse(X2)),add(X2,multiply(X1,inverse(X2)))) = X1,
inference(rw,[status(thm)],[c_0_47,c_0_11]) ).
cnf(c_0_51,plain,
inverse(n0) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_14]) ).
cnf(c_0_52,plain,
multiply(n0,add(X1,n1)) = add(multiply(X1,n0),n0),
inference(spm,[status(thm)],[c_0_12,c_0_32]) ).
cnf(c_0_53,plain,
multiply(add(X1,n1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_20]) ).
cnf(c_0_54,plain,
multiply(n0,n1) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_41]),c_0_32]),c_0_42]) ).
cnf(c_0_55,axiom,
add(multiply(X1,inverse(X2)),add(multiply(X1,X1),multiply(inverse(X2),X1))) = X1,
pixley3 ).
cnf(c_0_56,plain,
add(X1,n1) = add(n1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_53]),c_0_53]) ).
cnf(c_0_57,plain,
multiply(X1,n1) = multiply(n1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_54]),c_0_39]) ).
cnf(c_0_58,plain,
multiply(add(X1,inverse(X2)),n1) = add(inverse(X2),multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_59,plain,
add(multiply(X1,inverse(X2)),multiply(X1,add(X1,inverse(X2)))) = X1,
inference(rw,[status(thm)],[c_0_55,c_0_12]) ).
cnf(c_0_60,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_56]),c_0_17]),c_0_41]),c_0_57]),c_0_17]) ).
cnf(c_0_61,plain,
add(n0,add(inverse(X1),multiply(X2,X1))) = add(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_20,c_0_58]) ).
cnf(c_0_62,axiom,
multiply(add(X1,inverse(X2)),multiply(add(X1,X1),add(inverse(X2),X1))) = X1,
pixley3_dual ).
cnf(c_0_63,plain,
multiply(inverse(X1),inverse(X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_60]) ).
cnf(c_0_64,plain,
add(n0,X1) = add(X1,n0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_46]),c_0_20]) ).
cnf(c_0_65,plain,
multiply(inverse(X1),add(X1,X2)) = add(n0,multiply(X2,inverse(X1))),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_66,plain,
multiply(add(X1,inverse(X2)),add(X1,multiply(X1,inverse(X2)))) = X1,
inference(rw,[status(thm)],[c_0_62,c_0_11]) ).
cnf(c_0_67,plain,
multiply(n1,inverse(X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_63]),c_0_60]),c_0_14]),c_0_57]) ).
cnf(c_0_68,plain,
add(n0,inverse(X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_63]),c_0_60]),c_0_15]),c_0_64]) ).
cnf(c_0_69,plain,
multiply(X1,n0) = multiply(n0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_48]),c_0_48]) ).
cnf(c_0_70,plain,
multiply(add(X1,n0),add(n1,inverse(X1))) = add(X1,add(n0,multiply(n0,inverse(X1)))),
inference(spm,[status(thm)],[c_0_29,c_0_65]) ).
cnf(c_0_71,plain,
add(n1,inverse(X1)) = n1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_11]),c_0_36]),c_0_56]) ).
cnf(c_0_72,plain,
multiply(n0,inverse(X1)) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_68]),c_0_12]),c_0_60]),c_0_69]) ).
cnf(c_0_73,plain,
add(X1,n0) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71]),c_0_57]),c_0_17]),c_0_72]),c_0_60]) ).
cnf(c_0_74,plain,
add(n0,X1) = X1,
inference(rw,[status(thm)],[c_0_64,c_0_73]) ).
cnf(c_0_75,plain,
multiply(X1,add(X2,X1)) = add(X1,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_60]) ).
cnf(c_0_76,plain,
add(inverse(X1),multiply(X2,X1)) = add(X2,inverse(X1)),
inference(rw,[status(thm)],[c_0_61,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
multiply(add(a,b),b) != b,
prove_multiply_add ).
cnf(c_0_78,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_60]),c_0_60]) ).
cnf(c_0_79,plain,
add(X1,multiply(X1,X2)) = add(X1,multiply(n0,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_74]),c_0_75]) ).
cnf(c_0_80,plain,
add(X1,inverse(inverse(X1))) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_15]),c_0_64]),c_0_68]) ).
cnf(c_0_81,plain,
add(multiply(X1,inverse(inverse(X1))),n0) = multiply(inverse(inverse(X1)),n1),
inference(spm,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_82,plain,
multiply(n1,X1) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_73]) ).
cnf(c_0_83,negated_conjecture,
multiply(b,add(a,b)) != b,
inference(rw,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_84,plain,
add(X1,multiply(X1,inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_72]),c_0_73]) ).
cnf(c_0_85,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_80]),c_0_15]),c_0_81]),c_0_57]),c_0_82]) ).
cnf(c_0_86,negated_conjecture,
add(b,multiply(b,a)) != b,
inference(rw,[status(thm)],[c_0_83,c_0_75]) ).
cnf(c_0_87,plain,
add(X1,multiply(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO026-1 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n003.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.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 20:40:18 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.51 Running first-order model finding
% 0.20/0.51 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/tmp/tmp.p1bIINRQmv/E---3.1_23473.p
% 0.20/0.59 # Version: 3.1pre001
% 0.20/0.59 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.59 # Starting sh5l with 300s (1) cores
% 0.20/0.59 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23590 completed with status 0
% 0.20/0.59 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.59 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.59 # No SInE strategy applied
% 0.20/0.59 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.59 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.59 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.59 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.20/0.59 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.20/0.59 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.20/0.59 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23596 completed with status 0
% 0.20/0.59 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.59 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.59 # No SInE strategy applied
% 0.20/0.59 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.59 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.59 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.59 # Preprocessing time : 0.001 s
% 0.20/0.59 # Presaturation interreduction done
% 0.20/0.59
% 0.20/0.59 # Proof found!
% 0.20/0.59 # SZS status Unsatisfiable
% 0.20/0.59 # SZS output start CNFRefutation
% See solution above
% 0.20/0.59 # Parsed axioms : 11
% 0.20/0.59 # Removed by relevancy pruning/SinE : 0
% 0.20/0.59 # Initial clauses : 11
% 0.20/0.59 # Removed in clause preprocessing : 0
% 0.20/0.59 # Initial clauses in saturation : 11
% 0.20/0.59 # Processed clauses : 335
% 0.20/0.59 # ...of these trivial : 102
% 0.20/0.59 # ...subsumed : 32
% 0.20/0.59 # ...remaining for further processing : 201
% 0.20/0.59 # Other redundant clauses eliminated : 0
% 0.20/0.59 # Clauses deleted for lack of memory : 0
% 0.20/0.59 # Backward-subsumed : 3
% 0.20/0.59 # Backward-rewritten : 156
% 0.20/0.59 # Generated clauses : 4128
% 0.20/0.59 # ...of the previous two non-redundant : 3309
% 0.20/0.59 # ...aggressively subsumed : 0
% 0.20/0.59 # Contextual simplify-reflections : 0
% 0.20/0.59 # Paramodulations : 4128
% 0.20/0.59 # Factorizations : 0
% 0.20/0.59 # NegExts : 0
% 0.20/0.59 # Equation resolutions : 0
% 0.20/0.59 # Total rewrite steps : 4288
% 0.20/0.59 # Propositional unsat checks : 0
% 0.20/0.59 # Propositional check models : 0
% 0.20/0.59 # Propositional check unsatisfiable : 0
% 0.20/0.59 # Propositional clauses : 0
% 0.20/0.59 # Propositional clauses after purity: 0
% 0.20/0.59 # Propositional unsat core size : 0
% 0.20/0.59 # Propositional preprocessing time : 0.000
% 0.20/0.59 # Propositional encoding time : 0.000
% 0.20/0.59 # Propositional solver time : 0.000
% 0.20/0.59 # Success case prop preproc time : 0.000
% 0.20/0.59 # Success case prop encoding time : 0.000
% 0.20/0.59 # Success case prop solver time : 0.000
% 0.20/0.59 # Current number of processed clauses : 31
% 0.20/0.59 # Positive orientable unit clauses : 29
% 0.20/0.59 # Positive unorientable unit clauses: 2
% 0.20/0.59 # Negative unit clauses : 0
% 0.20/0.59 # Non-unit-clauses : 0
% 0.20/0.59 # Current number of unprocessed clauses: 2880
% 0.20/0.59 # ...number of literals in the above : 2880
% 0.20/0.59 # Current number of archived formulas : 0
% 0.20/0.59 # Current number of archived clauses : 170
% 0.20/0.59 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.59 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.59 # Non-unit clause-clause subsumptions : 0
% 0.20/0.59 # Unit Clause-clause subsumption calls : 113
% 0.20/0.59 # Rewrite failures with RHS unbound : 0
% 0.20/0.59 # BW rewrite match attempts : 745
% 0.20/0.59 # BW rewrite match successes : 395
% 0.20/0.59 # Condensation attempts : 0
% 0.20/0.59 # Condensation successes : 0
% 0.20/0.59 # Termbank termtop insertions : 61939
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.061 s
% 0.20/0.59 # System time : 0.004 s
% 0.20/0.59 # Total time : 0.065 s
% 0.20/0.59 # Maximum resident set size: 1520 pages
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.310 s
% 0.20/0.59 # System time : 0.020 s
% 0.20/0.59 # Total time : 0.330 s
% 0.20/0.59 # Maximum resident set size: 1676 pages
% 0.20/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------