TSTP Solution File: GRP186-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP186-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:39:13 EDT 2023
% Result : Unsatisfiable 15.59s 2.38s
% Output : CNFRefutation 15.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 78 ( 78 unt; 0 nHn; 6 RR)
% Number of literals : 78 ( 77 equ; 3 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; 3 con; 0-2 aty)
% Number of variables : 145 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p23_3,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',p23_3) ).
cnf(p23_1,hypothesis,
inverse(identity) = identity,
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',p23_1) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',left_identity) ).
cnf(p23_2,hypothesis,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',p23_2) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',monotony_glb1) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',symmetry_of_glb) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',left_inverse) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',glb_absorbtion) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',symmetry_of_lub) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',lub_absorbtion) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',monotony_glb2) ).
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',associativity) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',monotony_lub1) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',monotony_lub2) ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',associativity_of_glb) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',associativity_of_lub) ).
cnf(prove_p23,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,inverse(greatest_lower_bound(a,inverse(b)))),
file('/export/starexec/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p',prove_p23) ).
cnf(c_0_17,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
p23_3 ).
cnf(c_0_18,hypothesis,
inverse(identity) = identity,
p23_1 ).
cnf(c_0_19,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_20,hypothesis,
multiply(inverse(X1),identity) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,hypothesis,
inverse(inverse(X1)) = X1,
p23_2 ).
cnf(c_0_22,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_23,hypothesis,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_25,hypothesis,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_26,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_27,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_28,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_29,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_30,hypothesis,
multiply(inverse(X1),greatest_lower_bound(X1,identity)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_31,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_33,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_34,hypothesis,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_35,hypothesis,
multiply(inverse(X1),greatest_lower_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_36,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,X1)) = greatest_lower_bound(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]) ).
cnf(c_0_37,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_38,hypothesis,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_39,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_40,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_41,plain,
greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_19]),c_0_24]) ).
cnf(c_0_42,hypothesis,
multiply(inverse(greatest_lower_bound(X1,identity)),X1) = inverse(greatest_lower_bound(identity,inverse(X1))),
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_43,hypothesis,
greatest_lower_bound(identity,inverse(greatest_lower_bound(X1,identity))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26]) ).
cnf(c_0_44,hypothesis,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_19]) ).
cnf(c_0_45,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
associativity_of_glb ).
cnf(c_0_46,hypothesis,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_23]),c_0_28]) ).
cnf(c_0_47,plain,
least_upper_bound(X1,multiply(X2,X1)) = multiply(least_upper_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_19]),c_0_28]) ).
cnf(c_0_48,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_26]),c_0_19]) ).
cnf(c_0_49,hypothesis,
greatest_lower_bound(X1,inverse(greatest_lower_bound(identity,inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_24]),c_0_43]),c_0_19]) ).
cnf(c_0_50,hypothesis,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_44]),c_0_21]) ).
cnf(c_0_51,plain,
greatest_lower_bound(X1,greatest_lower_bound(least_upper_bound(X1,X2),X3)) = greatest_lower_bound(X1,X3),
inference(spm,[status(thm)],[c_0_45,c_0_27]) ).
cnf(c_0_52,hypothesis,
multiply(least_upper_bound(X1,identity),X1) = multiply(X1,least_upper_bound(X1,identity)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
multiply(inverse(X1),least_upper_bound(multiply(X1,X2),X3)) = least_upper_bound(X2,multiply(inverse(X1),X3)),
inference(spm,[status(thm)],[c_0_39,c_0_48]) ).
cnf(c_0_54,hypothesis,
least_upper_bound(X1,inverse(greatest_lower_bound(identity,inverse(X1)))) = inverse(greatest_lower_bound(identity,inverse(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_49]),c_0_28]) ).
cnf(c_0_55,hypothesis,
multiply(greatest_lower_bound(X1,inverse(multiply(X2,X3))),X2) = greatest_lower_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_33,c_0_50]) ).
cnf(c_0_56,hypothesis,
greatest_lower_bound(X1,multiply(least_upper_bound(X1,X2),greatest_lower_bound(X3,identity))) = greatest_lower_bound(X1,multiply(least_upper_bound(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_51,c_0_25]) ).
cnf(c_0_57,hypothesis,
multiply(least_upper_bound(X1,identity),greatest_lower_bound(X1,identity)) = multiply(greatest_lower_bound(X1,identity),least_upper_bound(X1,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_52]),c_0_41]) ).
cnf(c_0_58,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
associativity_of_lub ).
cnf(c_0_59,plain,
multiply(least_upper_bound(inverse(X1),X2),X1) = least_upper_bound(identity,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_40,c_0_26]) ).
cnf(c_0_60,hypothesis,
least_upper_bound(X1,inverse(greatest_lower_bound(X2,inverse(X1)))) = inverse(greatest_lower_bound(X2,inverse(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_53,c_0_54]),c_0_17]),c_0_55]),c_0_19]),c_0_17]),c_0_55]),c_0_19]) ).
cnf(c_0_61,hypothesis,
greatest_lower_bound(X1,multiply(greatest_lower_bound(X1,identity),least_upper_bound(X1,identity))) = 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_56,c_0_57]),c_0_52]),c_0_25]),c_0_24]),c_0_31]),c_0_23]) ).
cnf(c_0_62,plain,
least_upper_bound(X1,least_upper_bound(greatest_lower_bound(X1,X2),X3)) = least_upper_bound(X1,X3),
inference(spm,[status(thm)],[c_0_58,c_0_29]) ).
cnf(c_0_63,hypothesis,
least_upper_bound(identity,multiply(inverse(greatest_lower_bound(X1,X2)),X2)) = multiply(inverse(greatest_lower_bound(X1,X2)),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_21]),c_0_21]) ).
cnf(c_0_64,hypothesis,
greatest_lower_bound(X1,multiply(greatest_lower_bound(identity,X1),least_upper_bound(X1,identity))) = X1,
inference(spm,[status(thm)],[c_0_61,c_0_24]) ).
cnf(c_0_65,hypothesis,
multiply(inverse(X1),multiply(greatest_lower_bound(identity,X1),X2)) = multiply(greatest_lower_bound(identity,inverse(X1)),X2),
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_66,hypothesis,
least_upper_bound(X1,multiply(greatest_lower_bound(X1,X2),least_upper_bound(X3,identity))) = least_upper_bound(X1,multiply(greatest_lower_bound(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_62,c_0_46]) ).
cnf(c_0_67,plain,
multiply(greatest_lower_bound(X1,inverse(X2)),X2) = greatest_lower_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_26]),c_0_24]) ).
cnf(c_0_68,hypothesis,
multiply(X1,least_upper_bound(X2,multiply(inverse(X1),X3))) = least_upper_bound(multiply(X1,X2),X3),
inference(spm,[status(thm)],[c_0_39,c_0_44]) ).
cnf(c_0_69,hypothesis,
multiply(greatest_lower_bound(identity,inverse(X1)),least_upper_bound(X1,identity)) = identity,
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_63,c_0_64]),c_0_65]),c_0_66]),c_0_67]),c_0_19]),c_0_29]),c_0_65]) ).
cnf(c_0_70,hypothesis,
multiply(inverse(least_upper_bound(multiply(X1,X2),X3)),X1) = inverse(least_upper_bound(X2,multiply(inverse(X1),X3))),
inference(spm,[status(thm)],[c_0_50,c_0_68]) ).
cnf(c_0_71,hypothesis,
inverse(least_upper_bound(X1,identity)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_69]),c_0_18]),c_0_19]) ).
cnf(c_0_72,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,inverse(greatest_lower_bound(a,inverse(b)))),
prove_p23 ).
cnf(c_0_73,hypothesis,
inverse(least_upper_bound(X1,inverse(X2))) = greatest_lower_bound(X2,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_55]),c_0_19]),c_0_23]) ).
cnf(c_0_74,negated_conjecture,
multiply(a,inverse(greatest_lower_bound(a,inverse(b)))) != least_upper_bound(identity,multiply(a,b)),
inference(rw,[status(thm)],[c_0_72,c_0_28]) ).
cnf(c_0_75,hypothesis,
inverse(greatest_lower_bound(X1,inverse(X2))) = least_upper_bound(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_21,c_0_73]) ).
cnf(c_0_76,hypothesis,
multiply(X1,least_upper_bound(X2,inverse(X1))) = least_upper_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_28]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : GRP186-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n026.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 02:51:44 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.G6iIeNvewI/E---3.1_10759.p
% 15.59/2.38 # Version: 3.1pre001
% 15.59/2.38 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.59/2.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.59/2.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.59/2.38 # Starting new_bool_3 with 300s (1) cores
% 15.59/2.38 # Starting new_bool_1 with 300s (1) cores
% 15.59/2.38 # Starting sh5l with 300s (1) cores
% 15.59/2.38 # new_bool_1 with pid 10840 completed with status 0
% 15.59/2.38 # Result found by new_bool_1
% 15.59/2.38 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.59/2.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.59/2.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.59/2.38 # Starting new_bool_3 with 300s (1) cores
% 15.59/2.38 # Starting new_bool_1 with 300s (1) cores
% 15.59/2.38 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 15.59/2.38 # Search class: FUUPM-FFSF21-MFFFFFNN
% 15.59/2.38 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 15.59/2.38 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 15.59/2.38 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 10844 completed with status 0
% 15.59/2.38 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 15.59/2.38 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.59/2.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.59/2.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.59/2.38 # Starting new_bool_3 with 300s (1) cores
% 15.59/2.38 # Starting new_bool_1 with 300s (1) cores
% 15.59/2.38 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 15.59/2.38 # Search class: FUUPM-FFSF21-MFFFFFNN
% 15.59/2.38 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 15.59/2.38 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 15.59/2.38 # Preprocessing time : 0.001 s
% 15.59/2.38 # Presaturation interreduction done
% 15.59/2.38
% 15.59/2.38 # Proof found!
% 15.59/2.38 # SZS status Unsatisfiable
% 15.59/2.38 # SZS output start CNFRefutation
% See solution above
% 15.59/2.38 # Parsed axioms : 19
% 15.59/2.38 # Removed by relevancy pruning/SinE : 0
% 15.59/2.38 # Initial clauses : 19
% 15.59/2.38 # Removed in clause preprocessing : 0
% 15.59/2.38 # Initial clauses in saturation : 19
% 15.59/2.38 # Processed clauses : 6342
% 15.59/2.38 # ...of these trivial : 2408
% 15.59/2.38 # ...subsumed : 3240
% 15.59/2.38 # ...remaining for further processing : 694
% 15.59/2.38 # Other redundant clauses eliminated : 0
% 15.59/2.38 # Clauses deleted for lack of memory : 0
% 15.59/2.38 # Backward-subsumed : 0
% 15.59/2.38 # Backward-rewritten : 121
% 15.59/2.38 # Generated clauses : 175478
% 15.59/2.38 # ...of the previous two non-redundant : 122070
% 15.59/2.38 # ...aggressively subsumed : 0
% 15.59/2.38 # Contextual simplify-reflections : 0
% 15.59/2.38 # Paramodulations : 175478
% 15.59/2.38 # Factorizations : 0
% 15.59/2.38 # NegExts : 0
% 15.59/2.38 # Equation resolutions : 0
% 15.59/2.38 # Total rewrite steps : 268887
% 15.59/2.38 # Propositional unsat checks : 0
% 15.59/2.38 # Propositional check models : 0
% 15.59/2.38 # Propositional check unsatisfiable : 0
% 15.59/2.38 # Propositional clauses : 0
% 15.59/2.38 # Propositional clauses after purity: 0
% 15.59/2.38 # Propositional unsat core size : 0
% 15.59/2.38 # Propositional preprocessing time : 0.000
% 15.59/2.38 # Propositional encoding time : 0.000
% 15.59/2.38 # Propositional solver time : 0.000
% 15.59/2.38 # Success case prop preproc time : 0.000
% 15.59/2.38 # Success case prop encoding time : 0.000
% 15.59/2.38 # Success case prop solver time : 0.000
% 15.59/2.38 # Current number of processed clauses : 554
% 15.59/2.38 # Positive orientable unit clauses : 514
% 15.59/2.38 # Positive unorientable unit clauses: 40
% 15.59/2.38 # Negative unit clauses : 0
% 15.59/2.38 # Non-unit-clauses : 0
% 15.59/2.38 # Current number of unprocessed clauses: 115319
% 15.59/2.38 # ...number of literals in the above : 115319
% 15.59/2.38 # Current number of archived formulas : 0
% 15.59/2.38 # Current number of archived clauses : 140
% 15.59/2.38 # Clause-clause subsumption calls (NU) : 0
% 15.59/2.38 # Rec. Clause-clause subsumption calls : 0
% 15.59/2.38 # Non-unit clause-clause subsumptions : 0
% 15.59/2.38 # Unit Clause-clause subsumption calls : 350
% 15.59/2.38 # Rewrite failures with RHS unbound : 0
% 15.59/2.38 # BW rewrite match attempts : 2368
% 15.59/2.38 # BW rewrite match successes : 537
% 15.59/2.38 # Condensation attempts : 0
% 15.59/2.38 # Condensation successes : 0
% 15.59/2.38 # Termbank termtop insertions : 2339441
% 15.59/2.38
% 15.59/2.38 # -------------------------------------------------
% 15.59/2.38 # User time : 1.818 s
% 15.59/2.38 # System time : 0.097 s
% 15.59/2.38 # Total time : 1.915 s
% 15.59/2.38 # Maximum resident set size: 1612 pages
% 15.59/2.38
% 15.59/2.38 # -------------------------------------------------
% 15.59/2.38 # User time : 1.818 s
% 15.59/2.38 # System time : 0.099 s
% 15.59/2.38 # Total time : 1.917 s
% 15.59/2.38 # Maximum resident set size: 1680 pages
% 15.59/2.38 % E---3.1 exiting
% 15.59/2.38 % E---3.1 exiting
%------------------------------------------------------------------------------