TSTP Solution File: GRP180-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP180-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:46:31 EDT 2023
% Result : Unsatisfiable 10.25s 1.69s
% Output : CNFRefutation 10.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of clauses : 82 ( 82 unt; 0 nHn; 5 RR)
% Number of literals : 82 ( 81 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 : 151 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.LtFYGlgHUO/E---3.1_4428.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.LtFYGlgHUO/E---3.1_4428.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.LtFYGlgHUO/E---3.1_4428.p',left_identity) ).
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.LtFYGlgHUO/E---3.1_4428.p',monotony_lub1) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.LtFYGlgHUO/E---3.1_4428.p',symmetry_of_lub) ).
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.LtFYGlgHUO/E---3.1_4428.p',monotony_lub2) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.LtFYGlgHUO/E---3.1_4428.p',glb_absorbtion) ).
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.LtFYGlgHUO/E---3.1_4428.p',monotony_glb1) ).
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.LtFYGlgHUO/E---3.1_4428.p',associativity_of_glb) ).
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.LtFYGlgHUO/E---3.1_4428.p',monotony_glb2) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.LtFYGlgHUO/E---3.1_4428.p',symmetry_of_glb) ).
cnf(idempotence_of_gld,axiom,
greatest_lower_bound(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.LtFYGlgHUO/E---3.1_4428.p',idempotence_of_gld) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.LtFYGlgHUO/E---3.1_4428.p',lub_absorbtion) ).
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.LtFYGlgHUO/E---3.1_4428.p',associativity_of_lub) ).
cnf(prove_p11,negated_conjecture,
multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) != least_upper_bound(a,b),
file('/export/starexec/sandbox/tmp/tmp.LtFYGlgHUO/E---3.1_4428.p',prove_p11) ).
cnf(c_0_15,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_16,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_17,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_18,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_20,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_18]) ).
cnf(c_0_21,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_23,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_24,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_25,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).
cnf(c_0_26,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_27,plain,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_23]) ).
cnf(c_0_28,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_24,c_0_17]),c_0_23]) ).
cnf(c_0_29,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_30,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_31,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_32,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_33,plain,
multiply(least_upper_bound(X1,identity),X1) = multiply(X1,least_upper_bound(X1,identity)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_35,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_36,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_37,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_38,axiom,
greatest_lower_bound(X1,X1) = X1,
idempotence_of_gld ).
cnf(c_0_39,plain,
greatest_lower_bound(X1,greatest_lower_bound(least_upper_bound(X2,X1),X3)) = greatest_lower_bound(X1,X3),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
multiply(least_upper_bound(identity,X1),X1) = multiply(X1,least_upper_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_33,c_0_23]) ).
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_34,c_0_17]),c_0_35]) ).
cnf(c_0_42,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_36]),c_0_21]) ).
cnf(c_0_43,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_44,plain,
multiply(inverse(X1),greatest_lower_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_16]),c_0_35]) ).
cnf(c_0_45,plain,
greatest_lower_bound(X1,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_46,plain,
greatest_lower_bound(X1,multiply(least_upper_bound(X2,X1),greatest_lower_bound(identity,X3))) = greatest_lower_bound(X1,multiply(least_upper_bound(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_39,c_0_37]) ).
cnf(c_0_47,plain,
multiply(least_upper_bound(identity,X1),greatest_lower_bound(identity,X1)) = multiply(greatest_lower_bound(X1,identity),least_upper_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_40]),c_0_41]) ).
cnf(c_0_48,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_42]),c_0_25]) ).
cnf(c_0_49,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_50,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_43,c_0_35]) ).
cnf(c_0_51,plain,
greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,X1))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_16]) ).
cnf(c_0_52,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_42]) ).
cnf(c_0_53,plain,
greatest_lower_bound(X1,multiply(greatest_lower_bound(X1,identity),least_upper_bound(identity,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_40]),c_0_37]),c_0_26]),c_0_21]) ).
cnf(c_0_54,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_55,plain,
multiply(greatest_lower_bound(inverse(multiply(X1,X2)),X3),X1) = greatest_lower_bound(inverse(X2),multiply(X3,X1)),
inference(spm,[status(thm)],[c_0_34,c_0_48]) ).
cnf(c_0_56,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_49,c_0_42]) ).
cnf(c_0_57,plain,
least_upper_bound(identity,inverse(greatest_lower_bound(identity,X1))) = inverse(greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_23]) ).
cnf(c_0_58,plain,
greatest_lower_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(X1),greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_16]),c_0_35]) ).
cnf(c_0_59,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_52,c_0_25]) ).
cnf(c_0_60,plain,
greatest_lower_bound(X1,multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,X1))) = X1,
inference(spm,[status(thm)],[c_0_53,c_0_35]) ).
cnf(c_0_61,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_54,c_0_43]) ).
cnf(c_0_62,plain,
multiply(greatest_lower_bound(multiply(X1,inverse(X2)),X3),X2) = greatest_lower_bound(X1,multiply(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_25]) ).
cnf(c_0_63,plain,
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_57,c_0_58]),c_0_59]),c_0_59]) ).
cnf(c_0_64,plain,
greatest_lower_bound(X1,multiply(greatest_lower_bound(identity,X1),least_upper_bound(X1,identity))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_27]),c_0_17]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_65,plain,
multiply(inverse(X1),multiply(greatest_lower_bound(identity,X1),X2)) = multiply(greatest_lower_bound(identity,inverse(X1)),X2),
inference(spm,[status(thm)],[c_0_15,c_0_44]) ).
cnf(c_0_66,plain,
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_61,c_0_27]) ).
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_34,c_0_16]),c_0_35]) ).
cnf(c_0_68,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_69,plain,
multiply(X1,inverse(greatest_lower_bound(X2,multiply(X3,X1)))) = inverse(greatest_lower_bound(multiply(X2,inverse(X1)),X3)),
inference(spm,[status(thm)],[c_0_42,c_0_62]) ).
cnf(c_0_70,plain,
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_17]),c_0_43]),c_0_65]) ).
cnf(c_0_71,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_68]) ).
cnf(c_0_72,plain,
multiply(X1,multiply(inverse(greatest_lower_bound(X1,X2)),X2)) = inverse(greatest_lower_bound(inverse(X1),inverse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_58]),c_0_59]),c_0_17]) ).
cnf(c_0_73,plain,
inverse(greatest_lower_bound(identity,inverse(X1))) = least_upper_bound(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_70]),c_0_21]) ).
cnf(c_0_74,plain,
multiply(least_upper_bound(X1,identity),inverse(X1)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23]) ).
cnf(c_0_75,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_71]) ).
cnf(c_0_76,negated_conjecture,
multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) != least_upper_bound(a,b),
prove_p11 ).
cnf(c_0_77,plain,
multiply(X1,least_upper_bound(X2,inverse(multiply(X3,X1)))) = least_upper_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_22,c_0_42]) ).
cnf(c_0_78,plain,
least_upper_bound(identity,inverse(X1)) = inverse(greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_17]),c_0_75]),c_0_25]) ).
cnf(c_0_79,negated_conjecture,
inverse(greatest_lower_bound(inverse(a),inverse(b))) != least_upper_bound(a,b),
inference(rw,[status(thm)],[c_0_76,c_0_72]) ).
cnf(c_0_80,plain,
inverse(greatest_lower_bound(inverse(X1),X2)) = least_upper_bound(X1,inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_69]),c_0_17]),c_0_21]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP180-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n016.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 03:34:37 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.LtFYGlgHUO/E---3.1_4428.p
% 10.25/1.69 # Version: 3.1pre001
% 10.25/1.69 # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.25/1.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.25/1.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.25/1.69 # Starting new_bool_3 with 300s (1) cores
% 10.25/1.69 # Starting new_bool_1 with 300s (1) cores
% 10.25/1.69 # Starting sh5l with 300s (1) cores
% 10.25/1.69 # new_bool_1 with pid 4508 completed with status 0
% 10.25/1.69 # Result found by new_bool_1
% 10.25/1.69 # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.25/1.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.25/1.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.25/1.69 # Starting new_bool_3 with 300s (1) cores
% 10.25/1.69 # Starting new_bool_1 with 300s (1) cores
% 10.25/1.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.25/1.69 # Search class: FUUPM-FFSF21-MFFFFFNN
% 10.25/1.69 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 10.25/1.69 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 10.25/1.69 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 4513 completed with status 0
% 10.25/1.69 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 10.25/1.69 # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.25/1.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.25/1.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.25/1.69 # Starting new_bool_3 with 300s (1) cores
% 10.25/1.69 # Starting new_bool_1 with 300s (1) cores
% 10.25/1.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.25/1.69 # Search class: FUUPM-FFSF21-MFFFFFNN
% 10.25/1.69 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 10.25/1.69 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 10.25/1.69 # Preprocessing time : 0.001 s
% 10.25/1.69 # Presaturation interreduction done
% 10.25/1.69
% 10.25/1.69 # Proof found!
% 10.25/1.69 # SZS status Unsatisfiable
% 10.25/1.69 # SZS output start CNFRefutation
% See solution above
% 10.25/1.69 # Parsed axioms : 16
% 10.25/1.69 # Removed by relevancy pruning/SinE : 0
% 10.25/1.69 # Initial clauses : 16
% 10.25/1.69 # Removed in clause preprocessing : 0
% 10.25/1.69 # Initial clauses in saturation : 16
% 10.25/1.69 # Processed clauses : 4288
% 10.25/1.69 # ...of these trivial : 1791
% 10.25/1.69 # ...subsumed : 1919
% 10.25/1.69 # ...remaining for further processing : 578
% 10.25/1.69 # Other redundant clauses eliminated : 0
% 10.25/1.69 # Clauses deleted for lack of memory : 0
% 10.25/1.69 # Backward-subsumed : 0
% 10.25/1.69 # Backward-rewritten : 134
% 10.25/1.69 # Generated clauses : 120540
% 10.25/1.69 # ...of the previous two non-redundant : 79931
% 10.25/1.69 # ...aggressively subsumed : 0
% 10.25/1.69 # Contextual simplify-reflections : 0
% 10.25/1.69 # Paramodulations : 120540
% 10.25/1.69 # Factorizations : 0
% 10.25/1.69 # NegExts : 0
% 10.25/1.69 # Equation resolutions : 0
% 10.25/1.69 # Total rewrite steps : 180719
% 10.25/1.69 # Propositional unsat checks : 0
% 10.25/1.69 # Propositional check models : 0
% 10.25/1.69 # Propositional check unsatisfiable : 0
% 10.25/1.69 # Propositional clauses : 0
% 10.25/1.69 # Propositional clauses after purity: 0
% 10.25/1.69 # Propositional unsat core size : 0
% 10.25/1.69 # Propositional preprocessing time : 0.000
% 10.25/1.69 # Propositional encoding time : 0.000
% 10.25/1.69 # Propositional solver time : 0.000
% 10.25/1.69 # Success case prop preproc time : 0.000
% 10.25/1.69 # Success case prop encoding time : 0.000
% 10.25/1.69 # Success case prop solver time : 0.000
% 10.25/1.69 # Current number of processed clauses : 428
% 10.25/1.69 # Positive orientable unit clauses : 402
% 10.25/1.69 # Positive unorientable unit clauses: 26
% 10.25/1.69 # Negative unit clauses : 0
% 10.25/1.69 # Non-unit-clauses : 0
% 10.25/1.69 # Current number of unprocessed clauses: 75495
% 10.25/1.69 # ...number of literals in the above : 75495
% 10.25/1.69 # Current number of archived formulas : 0
% 10.25/1.69 # Current number of archived clauses : 150
% 10.25/1.69 # Clause-clause subsumption calls (NU) : 0
% 10.25/1.69 # Rec. Clause-clause subsumption calls : 0
% 10.25/1.69 # Non-unit clause-clause subsumptions : 0
% 10.25/1.69 # Unit Clause-clause subsumption calls : 175
% 10.25/1.69 # Rewrite failures with RHS unbound : 0
% 10.25/1.69 # BW rewrite match attempts : 1840
% 10.25/1.69 # BW rewrite match successes : 492
% 10.25/1.69 # Condensation attempts : 0
% 10.25/1.69 # Condensation successes : 0
% 10.25/1.69 # Termbank termtop insertions : 1521128
% 10.25/1.69
% 10.25/1.69 # -------------------------------------------------
% 10.25/1.69 # User time : 1.171 s
% 10.25/1.69 # System time : 0.064 s
% 10.25/1.69 # Total time : 1.235 s
% 10.25/1.69 # Maximum resident set size: 1612 pages
% 10.25/1.69
% 10.25/1.69 # -------------------------------------------------
% 10.25/1.69 # User time : 1.173 s
% 10.25/1.69 # System time : 0.064 s
% 10.25/1.69 # Total time : 1.238 s
% 10.25/1.69 # Maximum resident set size: 1676 pages
% 10.25/1.69 % E---3.1 exiting
%------------------------------------------------------------------------------