TSTP Solution File: BOO031-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : BOO031-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Sat May 4 07:27:08 EDT 2024
% Result : Unsatisfiable 3.82s 1.00s
% Output : CNFRefutation 3.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of clauses : 89 ( 89 unt; 0 nHn; 8 RR)
% Number of literals : 89 ( 88 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 179 ( 43 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(property3,axiom,
multiply(add(X1,inverse(X1)),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',property3) ).
cnf(additive_inverse,axiom,
add(X1,inverse(X1)) = n1,
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',additive_inverse) ).
cnf(multiplicative_inverse,axiom,
multiply(X1,inverse(X1)) = n0,
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',multiplicative_inverse) ).
cnf(l2,axiom,
multiply(X1,add(X2,add(X1,X3))) = X1,
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',l2) ).
cnf(property3_dual,axiom,
add(multiply(X1,inverse(X1)),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',property3_dual) ).
cnf(associativity_of_multiply,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',associativity_of_multiply) ).
cnf(l1,axiom,
add(X1,multiply(X2,multiply(X1,X3))) = X1,
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',l1) ).
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',associativity_of_add) ).
cnf(l3,axiom,
add(add(multiply(X1,X2),multiply(X2,X3)),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',l3) ).
cnf(l4,axiom,
multiply(multiply(add(X1,X2),add(X2,X3)),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',l4) ).
cnf(distributivity,axiom,
add(multiply(X1,X2),add(multiply(X2,X3),multiply(X3,X1))) = multiply(add(X1,X2),multiply(add(X2,X3),add(X3,X1))),
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',distributivity) ).
cnf(prove_multiply_add_property,negated_conjecture,
multiply(a,add(b,c)) != add(multiply(b,a),multiply(c,a)),
file('/export/starexec/sandbox/tmp/tmp.r2465Nf9eE/E---3.1_30106.p',prove_multiply_add_property) ).
cnf(c_0_12,axiom,
multiply(add(X1,inverse(X1)),X2) = X2,
property3 ).
cnf(c_0_13,axiom,
add(X1,inverse(X1)) = n1,
additive_inverse ).
cnf(c_0_14,plain,
multiply(n1,X1) = X1,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
multiply(X1,inverse(X1)) = n0,
multiplicative_inverse ).
cnf(c_0_16,plain,
inverse(n1) = n0,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
multiply(X1,add(X2,add(X1,X3))) = X1,
l2 ).
cnf(c_0_18,plain,
add(n1,n0) = n1,
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_19,axiom,
add(multiply(X1,inverse(X1)),X2) = X2,
property3_dual ).
cnf(c_0_20,plain,
add(X1,n1) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]) ).
cnf(c_0_21,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity_of_multiply ).
cnf(c_0_22,plain,
add(n0,X1) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,axiom,
add(X1,multiply(X2,multiply(X1,X3))) = X1,
l1 ).
cnf(c_0_24,plain,
multiply(X1,n1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_20]) ).
cnf(c_0_25,plain,
multiply(X1,multiply(inverse(X1),X2)) = multiply(n0,X2),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_26,plain,
multiply(n0,add(X1,X2)) = n0,
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_27,plain,
add(X1,multiply(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
multiply(n0,inverse(inverse(X1))) = multiply(X1,n0),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_29,plain,
multiply(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_30,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_31,plain,
add(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_32,axiom,
add(add(multiply(X1,X2),multiply(X2,X3)),X2) = X2,
l3 ).
cnf(c_0_33,axiom,
multiply(multiply(add(X1,X2),add(X2,X3)),X2) = X2,
l4 ).
cnf(c_0_34,plain,
multiply(X1,n0) = n0,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
multiply(X1,add(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_36,plain,
add(X1,add(X1,X2)) = add(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
add(multiply(X1,X2),add(multiply(X2,X3),X2)) = X2,
inference(rw,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_38,plain,
multiply(add(X1,X2),multiply(add(X2,X3),X2)) = X2,
inference(rw,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_39,plain,
add(X1,n0) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_34]),c_0_34]) ).
cnf(c_0_40,plain,
multiply(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_23]) ).
cnf(c_0_41,plain,
multiply(X1,add(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_42,plain,
add(X1,multiply(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_43,plain,
add(multiply(X1,X2),X2) = X2,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
add(X1,add(X2,X1)) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_35]),c_0_30]) ).
cnf(c_0_45,plain,
multiply(add(X1,X2),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_46,plain,
multiply(X1,multiply(X2,X1)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_21]) ).
cnf(c_0_47,axiom,
add(multiply(X1,X2),add(multiply(X2,X3),multiply(X3,X1))) = multiply(add(X1,X2),multiply(add(X2,X3),add(X3,X1))),
distributivity ).
cnf(c_0_48,plain,
add(X1,X2) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_41]),c_0_44]) ).
cnf(c_0_49,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_27]),c_0_46]) ).
cnf(c_0_50,plain,
add(X1,add(n1,X2)) = n1,
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_51,plain,
add(X1,add(multiply(X2,X1),X3)) = add(X1,X3),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_52,plain,
add(multiply(X1,X2),multiply(inverse(X2),X1)) = multiply(add(X1,X2),add(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_47,c_0_15]),c_0_39]),c_0_13]),c_0_24]),c_0_48]),c_0_49]) ).
cnf(c_0_53,plain,
multiply(X1,add(X2,add(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_54,plain,
add(X1,add(inverse(X1),X2)) = add(n1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_13]) ).
cnf(c_0_55,plain,
add(n1,X1) = n1,
inference(spm,[status(thm)],[c_0_22,c_0_50]) ).
cnf(c_0_56,plain,
multiply(X1,multiply(add(X1,X2),X3)) = multiply(X1,X3),
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
cnf(c_0_57,plain,
multiply(add(X1,X2),add(multiply(X3,X1),X2)) = add(multiply(X3,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_51]),c_0_49]) ).
cnf(c_0_58,plain,
add(multiply(X1,X2),multiply(inverse(X1),X2)) = multiply(add(X2,X1),add(inverse(X1),X2)),
inference(spm,[status(thm)],[c_0_52,c_0_49]) ).
cnf(c_0_59,plain,
multiply(X1,multiply(X2,add(X3,X1))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_42]),c_0_21]) ).
cnf(c_0_60,plain,
add(X1,add(X2,X3)) = add(X2,add(X3,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_48]) ).
cnf(c_0_61,plain,
add(X1,add(inverse(X1),X2)) = n1,
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_62,plain,
multiply(X1,multiply(X2,add(X1,X3))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_46]),c_0_56]) ).
cnf(c_0_63,plain,
multiply(add(X1,X2),add(inverse(X2),X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_27]),c_0_59]),c_0_35]) ).
cnf(c_0_64,plain,
multiply(X1,multiply(X1,X2)) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_40]) ).
cnf(c_0_65,plain,
multiply(X1,inverse(inverse(X1))) = add(X1,inverse(inverse(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_52,c_0_15]),c_0_39]),c_0_13]),c_0_24]),c_0_49]),c_0_48]) ).
cnf(c_0_66,plain,
add(X1,multiply(inverse(X1),add(X2,X1))) = add(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_58,c_0_41]),c_0_30]),c_0_31]),c_0_60]),c_0_61]),c_0_24]) ).
cnf(c_0_67,plain,
multiply(inverse(X1),add(X2,X1)) = multiply(inverse(X1),X2),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,plain,
add(X1,inverse(inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_35]) ).
cnf(c_0_69,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X3,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_49]) ).
cnf(c_0_70,plain,
multiply(add(X1,X2),add(X1,add(X2,X3))) = add(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_71,plain,
add(X1,multiply(inverse(X1),X2)) = add(X2,X1),
inference(rw,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_68]),c_0_49]),c_0_65]),c_0_68]) ).
cnf(c_0_73,plain,
add(X1,multiply(add(X1,X2),X3)) = multiply(add(X3,X1),add(X1,X2)),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_35]),c_0_30]),c_0_36]),c_0_69]),c_0_70]),c_0_48]),c_0_27]),c_0_48]) ).
cnf(c_0_74,plain,
add(multiply(X1,X2),multiply(X1,multiply(X2,X3))) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_42,c_0_21]) ).
cnf(c_0_75,negated_conjecture,
multiply(a,add(b,c)) != add(multiply(b,a),multiply(c,a)),
inference(fof_simplification,[status(thm)],[prove_multiply_add_property]) ).
cnf(c_0_76,plain,
add(inverse(X1),multiply(X1,X2)) = add(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_77,plain,
multiply(inverse(X1),multiply(add(X2,X1),X3)) = multiply(inverse(X1),multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_67]),c_0_21]) ).
cnf(c_0_78,plain,
add(X1,multiply(add(X2,X1),X3)) = multiply(add(X3,X1),add(X2,X1)),
inference(spm,[status(thm)],[c_0_73,c_0_71]) ).
cnf(c_0_79,plain,
add(multiply(X1,X2),multiply(X2,X3)) = multiply(X2,add(multiply(X2,X3),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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_64]),c_0_21]),c_0_42]),c_0_60]),c_0_74]),c_0_49]),c_0_41]),c_0_49]) ).
cnf(c_0_80,negated_conjecture,
multiply(a,add(b,c)) != add(multiply(b,a),multiply(c,a)),
c_0_75 ).
cnf(c_0_81,plain,
multiply(add(X1,X2),add(X3,X2)) = add(multiply(X3,X1),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_76,c_0_77]),c_0_72]),c_0_71]),c_0_72]),c_0_48]),c_0_78]) ).
cnf(c_0_82,plain,
multiply(X1,add(multiply(X1,X2),X3)) = multiply(X1,add(X2,multiply(X3,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_27]),c_0_79]),c_0_49]) ).
cnf(c_0_83,negated_conjecture,
add(multiply(a,b),multiply(a,c)) != multiply(a,add(b,c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_49]),c_0_49]) ).
cnf(c_0_84,plain,
add(multiply(X1,X2),multiply(X1,X3)) = multiply(X1,add(multiply(X1,X3),X2)),
inference(spm,[status(thm)],[c_0_79,c_0_49]) ).
cnf(c_0_85,plain,
multiply(X1,add(X2,multiply(X3,X1))) = multiply(X1,add(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_81]),c_0_82]) ).
cnf(c_0_86,negated_conjecture,
multiply(a,add(b,multiply(a,c))) != multiply(a,add(b,c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84]),c_0_48]) ).
cnf(c_0_87,plain,
multiply(X1,add(X2,multiply(X1,X3))) = multiply(X1,add(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_42]),c_0_84]),c_0_82]),c_0_49]),c_0_85]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : BOO031-1 : TPTP v8.1.2. Released v2.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 12:16:52 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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.r2465Nf9eE/E---3.1_30106.p
% 3.82/1.00 # Version: 3.1.0
% 3.82/1.00 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.82/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.82/1.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.82/1.00 # Starting new_bool_3 with 300s (1) cores
% 3.82/1.00 # Starting new_bool_1 with 300s (1) cores
% 3.82/1.00 # Starting sh5l with 300s (1) cores
% 3.82/1.00 # sh5l with pid 30199 completed with status 0
% 3.82/1.00 # Result found by sh5l
% 3.82/1.00 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.82/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.82/1.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.82/1.00 # Starting new_bool_3 with 300s (1) cores
% 3.82/1.00 # Starting new_bool_1 with 300s (1) cores
% 3.82/1.00 # Starting sh5l with 300s (1) cores
% 3.82/1.00 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.82/1.00 # Search class: FUUPM-FFSF21-MFFFFFNN
% 3.82/1.00 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 3.82/1.00 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 3.82/1.00 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 30207 completed with status 0
% 3.82/1.00 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 3.82/1.00 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.82/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.82/1.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.82/1.00 # Starting new_bool_3 with 300s (1) cores
% 3.82/1.00 # Starting new_bool_1 with 300s (1) cores
% 3.82/1.00 # Starting sh5l with 300s (1) cores
% 3.82/1.00 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.82/1.00 # Search class: FUUPM-FFSF21-MFFFFFNN
% 3.82/1.00 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 3.82/1.00 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 3.82/1.00 # Preprocessing time : 0.002 s
% 3.82/1.00 # Presaturation interreduction done
% 3.82/1.00
% 3.82/1.00 # Proof found!
% 3.82/1.00 # SZS status Unsatisfiable
% 3.82/1.00 # SZS output start CNFRefutation
% See solution above
% 3.82/1.00 # Parsed axioms : 12
% 3.82/1.00 # Removed by relevancy pruning/SinE : 0
% 3.82/1.00 # Initial clauses : 12
% 3.82/1.00 # Removed in clause preprocessing : 0
% 3.82/1.00 # Initial clauses in saturation : 12
% 3.82/1.00 # Processed clauses : 2439
% 3.82/1.00 # ...of these trivial : 900
% 3.82/1.00 # ...subsumed : 1216
% 3.82/1.00 # ...remaining for further processing : 323
% 3.82/1.00 # Other redundant clauses eliminated : 0
% 3.82/1.00 # Clauses deleted for lack of memory : 0
% 3.82/1.00 # Backward-subsumed : 0
% 3.82/1.00 # Backward-rewritten : 107
% 3.82/1.00 # Generated clauses : 56593
% 3.82/1.00 # ...of the previous two non-redundant : 33244
% 3.82/1.00 # ...aggressively subsumed : 0
% 3.82/1.00 # Contextual simplify-reflections : 0
% 3.82/1.00 # Paramodulations : 56593
% 3.82/1.00 # Factorizations : 0
% 3.82/1.00 # NegExts : 0
% 3.82/1.00 # Equation resolutions : 0
% 3.82/1.00 # Disequality decompositions : 0
% 3.82/1.00 # Total rewrite steps : 102053
% 3.82/1.00 # ...of those cached : 80094
% 3.82/1.00 # Propositional unsat checks : 0
% 3.82/1.00 # Propositional check models : 0
% 3.82/1.00 # Propositional check unsatisfiable : 0
% 3.82/1.00 # Propositional clauses : 0
% 3.82/1.00 # Propositional clauses after purity: 0
% 3.82/1.00 # Propositional unsat core size : 0
% 3.82/1.00 # Propositional preprocessing time : 0.000
% 3.82/1.00 # Propositional encoding time : 0.000
% 3.82/1.00 # Propositional solver time : 0.000
% 3.82/1.00 # Success case prop preproc time : 0.000
% 3.82/1.00 # Success case prop encoding time : 0.000
% 3.82/1.00 # Success case prop solver time : 0.000
% 3.82/1.00 # Current number of processed clauses : 204
% 3.82/1.00 # Positive orientable unit clauses : 194
% 3.82/1.00 # Positive unorientable unit clauses: 10
% 3.82/1.00 # Negative unit clauses : 0
% 3.82/1.00 # Non-unit-clauses : 0
% 3.82/1.00 # Current number of unprocessed clauses: 30406
% 3.82/1.00 # ...number of literals in the above : 30406
% 3.82/1.00 # Current number of archived formulas : 0
% 3.82/1.00 # Current number of archived clauses : 119
% 3.82/1.00 # Clause-clause subsumption calls (NU) : 0
% 3.82/1.00 # Rec. Clause-clause subsumption calls : 0
% 3.82/1.00 # Non-unit clause-clause subsumptions : 0
% 3.82/1.00 # Unit Clause-clause subsumption calls : 190
% 3.82/1.00 # Rewrite failures with RHS unbound : 0
% 3.82/1.00 # BW rewrite match attempts : 1701
% 3.82/1.00 # BW rewrite match successes : 813
% 3.82/1.00 # Condensation attempts : 0
% 3.82/1.00 # Condensation successes : 0
% 3.82/1.00 # Termbank termtop insertions : 619689
% 3.82/1.00 # Search garbage collected termcells : 2
% 3.82/1.00
% 3.82/1.00 # -------------------------------------------------
% 3.82/1.00 # User time : 0.453 s
% 3.82/1.00 # System time : 0.022 s
% 3.82/1.00 # Total time : 0.475 s
% 3.82/1.00 # Maximum resident set size: 1640 pages
% 3.82/1.00
% 3.82/1.00 # -------------------------------------------------
% 3.82/1.00 # User time : 0.455 s
% 3.82/1.00 # System time : 0.024 s
% 3.82/1.00 # Total time : 0.479 s
% 3.82/1.00 # Maximum resident set size: 1688 pages
% 3.82/1.00 % E---3.1 exiting
%------------------------------------------------------------------------------