TSTP Solution File: GRP302-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP302-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:37 EDT 2023
% Result : Unsatisfiable 0.17s 0.57s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 14
% Syntax : Number of clauses : 79 ( 36 unt; 32 nHn; 62 RR)
% Number of literals : 175 ( 174 equ; 72 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',left_identity) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c6
| inverse(sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',prove_this_14) ).
cnf(prove_this_1,negated_conjecture,
multiply(sk_c8,sk_c7) = sk_c6,
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',prove_this_1) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',prove_this_20) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c8,sk_c7) != sk_c6
| inverse(X1) != sk_c8
| multiply(X1,sk_c7) != sk_c8
| multiply(X2,sk_c8) != sk_c6
| inverse(X2) != sk_c8
| inverse(sk_c8) != sk_c7
| inverse(X3) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| inverse(X4) != X5
| inverse(X5) != sk_c8
| multiply(X4,sk_c8) != X5 ),
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',prove_this_26) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c3,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',prove_this_4) ).
cnf(prove_this_3,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',prove_this_3) ).
cnf(prove_this_7,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c4 ),
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',prove_this_7) ).
cnf(prove_this_5,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c5) = sk_c4 ),
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',prove_this_6) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c8
| multiply(sk_c3,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',prove_this_10) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c8
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.UTi2o5g21y/E---3.1_3123.p',prove_this_9) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c6
| inverse(sk_c8) = sk_c7 ),
prove_this_14 ).
cnf(c_0_19,negated_conjecture,
multiply(sk_c8,sk_c7) = sk_c6,
prove_this_1 ).
cnf(c_0_20,negated_conjecture,
( multiply(inverse(sk_c2),sk_c6) = sk_c8
| inverse(sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c8) = sk_c7 ),
prove_this_20 ).
cnf(c_0_22,negated_conjecture,
multiply(inverse(sk_c8),sk_c6) = sk_c7,
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c8,sk_c6) = sk_c8
| inverse(sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
multiply(inverse(inverse(sk_c8)),sk_c7) = sk_c6,
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( inverse(sk_c8) = sk_c7
| sk_c6 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
sk_c6 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15])]) ).
cnf(c_0_27,negated_conjecture,
multiply(inverse(sk_c8),identity) = sk_c7,
inference(rw,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c8,sk_c7) != sk_c6
| inverse(X1) != sk_c8
| multiply(X1,sk_c7) != sk_c8
| multiply(X2,sk_c8) != sk_c6
| inverse(X2) != sk_c8
| inverse(sk_c8) != sk_c7
| inverse(X3) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| inverse(X4) != X5
| inverse(X5) != sk_c8
| multiply(X4,sk_c8) != X5 ),
prove_this_26 ).
cnf(c_0_29,negated_conjecture,
multiply(inverse(sk_c8),X1) = multiply(sk_c7,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_27]),c_0_16]) ).
cnf(c_0_30,negated_conjecture,
( inverse(multiply(X1,sk_c8)) != sk_c8
| multiply(X1,sk_c8) != inverse(X1)
| multiply(X2,sk_c7) != sk_c8
| multiply(X3,sk_c8) != sk_c6
| multiply(X4,sk_c7) != sk_c8
| inverse(sk_c8) != sk_c7
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8 ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_19])])]) ).
cnf(c_0_31,negated_conjecture,
multiply(inverse(inverse(sk_c8)),sk_c7) = identity,
inference(rw,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_32,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c3,sk_c7) = sk_c8 ),
prove_this_4 ).
cnf(c_0_34,negated_conjecture,
multiply(sk_c7,sk_c8) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( inverse(multiply(X1,sk_c8)) != sk_c8
| multiply(X1,sk_c8) != inverse(X1)
| multiply(X2,sk_c7) != sk_c8
| multiply(X3,sk_c8) != identity
| multiply(X4,sk_c7) != sk_c8
| inverse(sk_c8) != sk_c7
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8 ),
inference(rw,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_36,negated_conjecture,
inverse(sk_c8) = sk_c7,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_31]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( multiply(inverse(sk_c3),sk_c8) = sk_c7
| inverse(sk_c1) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c3) = sk_c8 ),
prove_this_3 ).
cnf(c_0_39,negated_conjecture,
multiply(inverse(sk_c7),identity) = sk_c8,
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( inverse(multiply(X1,sk_c8)) != sk_c8
| multiply(X1,sk_c8) != inverse(X1)
| multiply(X2,sk_c7) != sk_c8
| multiply(X3,sk_c8) != identity
| multiply(X4,sk_c7) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_41,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c4 ),
prove_this_7 ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c5) = sk_c4 ),
prove_this_5 ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c4) = sk_c8 ),
prove_this_6 ).
cnf(c_0_44,negated_conjecture,
multiply(sk_c7,multiply(sk_c8,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c8,sk_c8) = sk_c7
| inverse(sk_c1) = sk_c8 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
multiply(inverse(inverse(sk_c7)),sk_c8) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(X1,sk_c7) != sk_c8
| multiply(X2,sk_c8) != identity
| multiply(X3,sk_c7) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c7,sk_c7) = sk_c8
| inverse(sk_c1) = sk_c8 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
inverse(sk_c7) = sk_c8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_46]),c_0_32]) ).
cnf(c_0_50,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_51,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(X1,sk_c8) != identity
| multiply(X2,sk_c7) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_52,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_32,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(X1,sk_c7) != sk_c8
| inverse(X1) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_34]),c_0_49])]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c8
| multiply(sk_c3,sk_c7) = sk_c8 ),
prove_this_10 ).
cnf(c_0_55,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_52]),c_0_52]) ).
cnf(c_0_56,negated_conjecture,
inverse(sk_c1) = sk_c8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_48]),c_0_49])]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c8
| inverse(sk_c3) = sk_c8 ),
prove_this_9 ).
cnf(c_0_58,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3))) = X3,
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_59,negated_conjecture,
multiply(sk_c8,sk_c7) = identity,
inference(rw,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_60,negated_conjecture,
( multiply(inverse(sk_c3),sk_c8) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_54]) ).
cnf(c_0_61,negated_conjecture,
sk_c1 = sk_c7,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_36]) ).
cnf(c_0_62,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c7
| inverse(sk_c3) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_57]) ).
cnf(c_0_63,negated_conjecture,
multiply(inverse(multiply(X1,sk_c8)),X1) = sk_c7,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_52]) ).
cnf(c_0_64,negated_conjecture,
( multiply(inverse(sk_c3),sk_c8) = sk_c7
| multiply(sk_c7,sk_c7) = sk_c8 ),
inference(rw,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( multiply(inverse(sk_c1),multiply(sk_c8,X1)) = multiply(sk_c7,X1)
| inverse(sk_c3) = sk_c8 ),
inference(spm,[status(thm)],[c_0_14,c_0_62]) ).
cnf(c_0_66,negated_conjecture,
multiply(inverse(multiply(X1,sk_c7)),X1) = sk_c8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_34]),c_0_52]) ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c8,inverse(sk_c3)) = sk_c7
| multiply(sk_c7,sk_c7) = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_49]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c7,sk_c7) = inverse(sk_c1)
| inverse(sk_c3) = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_59]),c_0_52]) ).
cnf(c_0_69,negated_conjecture,
multiply(sk_c7,inverse(multiply(sk_c7,sk_c7))) = sk_c8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_66]),c_0_36]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c7,sk_c7) = inverse(sk_c3)
| multiply(sk_c7,sk_c7) = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_67]),c_0_36]) ).
cnf(c_0_71,negated_conjecture,
( multiply(sk_c7,sk_c7) = sk_c8
| inverse(sk_c3) = sk_c8 ),
inference(rw,[status(thm)],[c_0_68,c_0_56]) ).
cnf(c_0_72,negated_conjecture,
inverse(multiply(sk_c7,sk_c7)) = multiply(sk_c8,sk_c8),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_69]),c_0_49]) ).
cnf(c_0_73,negated_conjecture,
multiply(sk_c7,sk_c7) = sk_c8,
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_70]),c_0_71]) ).
cnf(c_0_74,negated_conjecture,
multiply(sk_c8,sk_c8) = sk_c7,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_36]) ).
cnf(c_0_75,negated_conjecture,
( multiply(X1,sk_c7) != sk_c8
| multiply(X2,sk_c8) != identity
| multiply(X3,sk_c7) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_74]),c_0_49]),c_0_36])]) ).
cnf(c_0_76,negated_conjecture,
( multiply(X1,sk_c8) != identity
| multiply(X2,sk_c7) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_73]),c_0_49])]) ).
cnf(c_0_77,negated_conjecture,
( multiply(X1,sk_c7) != sk_c8
| inverse(X1) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_34]),c_0_49])]) ).
cnf(c_0_78,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_73]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : GRP302-1 : TPTP v8.1.2. Released v2.5.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:21:16 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.UTi2o5g21y/E---3.1_3123.p
% 0.17/0.57 # Version: 3.1pre001
% 0.17/0.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.57 # Starting sh5l with 300s (1) cores
% 0.17/0.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3209 completed with status 0
% 0.17/0.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.57 # No SInE strategy applied
% 0.17/0.57 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.57 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.57 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.57 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.57 # Starting sh5l with 136s (1) cores
% 0.17/0.57 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3215 completed with status 0
% 0.17/0.57 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.57 # No SInE strategy applied
% 0.17/0.57 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.57 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.57 # Preprocessing time : 0.001 s
% 0.17/0.57 # Presaturation interreduction done
% 0.17/0.57
% 0.17/0.57 # Proof found!
% 0.17/0.57 # SZS status Unsatisfiable
% 0.17/0.57 # SZS output start CNFRefutation
% See solution above
% 0.17/0.57 # Parsed axioms : 29
% 0.17/0.57 # Removed by relevancy pruning/SinE : 0
% 0.17/0.57 # Initial clauses : 29
% 0.17/0.57 # Removed in clause preprocessing : 0
% 0.17/0.57 # Initial clauses in saturation : 29
% 0.17/0.57 # Processed clauses : 1947
% 0.17/0.57 # ...of these trivial : 32
% 0.17/0.57 # ...subsumed : 1369
% 0.17/0.57 # ...remaining for further processing : 546
% 0.17/0.57 # Other redundant clauses eliminated : 5
% 0.17/0.57 # Clauses deleted for lack of memory : 0
% 0.17/0.57 # Backward-subsumed : 116
% 0.17/0.57 # Backward-rewritten : 362
% 0.17/0.57 # Generated clauses : 8541
% 0.17/0.57 # ...of the previous two non-redundant : 7716
% 0.17/0.57 # ...aggressively subsumed : 0
% 0.17/0.57 # Contextual simplify-reflections : 15
% 0.17/0.57 # Paramodulations : 8534
% 0.17/0.57 # Factorizations : 2
% 0.17/0.57 # NegExts : 0
% 0.17/0.57 # Equation resolutions : 5
% 0.17/0.57 # Total rewrite steps : 5657
% 0.17/0.57 # Propositional unsat checks : 0
% 0.17/0.57 # Propositional check models : 0
% 0.17/0.57 # Propositional check unsatisfiable : 0
% 0.17/0.57 # Propositional clauses : 0
% 0.17/0.57 # Propositional clauses after purity: 0
% 0.17/0.57 # Propositional unsat core size : 0
% 0.17/0.57 # Propositional preprocessing time : 0.000
% 0.17/0.57 # Propositional encoding time : 0.000
% 0.17/0.57 # Propositional solver time : 0.000
% 0.17/0.57 # Success case prop preproc time : 0.000
% 0.17/0.57 # Success case prop encoding time : 0.000
% 0.17/0.57 # Success case prop solver time : 0.000
% 0.17/0.57 # Current number of processed clauses : 38
% 0.17/0.57 # Positive orientable unit clauses : 33
% 0.17/0.57 # Positive unorientable unit clauses: 0
% 0.17/0.57 # Negative unit clauses : 0
% 0.17/0.57 # Non-unit-clauses : 5
% 0.17/0.57 # Current number of unprocessed clauses: 2454
% 0.17/0.57 # ...number of literals in the above : 6841
% 0.17/0.57 # Current number of archived formulas : 0
% 0.17/0.57 # Current number of archived clauses : 507
% 0.17/0.57 # Clause-clause subsumption calls (NU) : 7565
% 0.17/0.57 # Rec. Clause-clause subsumption calls : 4105
% 0.17/0.57 # Non-unit clause-clause subsumptions : 1469
% 0.17/0.57 # Unit Clause-clause subsumption calls : 504
% 0.17/0.57 # Rewrite failures with RHS unbound : 0
% 0.17/0.57 # BW rewrite match attempts : 60
% 0.17/0.57 # BW rewrite match successes : 28
% 0.17/0.57 # Condensation attempts : 0
% 0.17/0.57 # Condensation successes : 0
% 0.17/0.57 # Termbank termtop insertions : 82417
% 0.17/0.57
% 0.17/0.57 # -------------------------------------------------
% 0.17/0.57 # User time : 0.118 s
% 0.17/0.57 # System time : 0.005 s
% 0.17/0.57 # Total time : 0.123 s
% 0.17/0.57 # Maximum resident set size: 1592 pages
% 0.17/0.57
% 0.17/0.57 # -------------------------------------------------
% 0.17/0.57 # User time : 0.590 s
% 0.17/0.57 # System time : 0.012 s
% 0.17/0.57 # Total time : 0.602 s
% 0.17/0.57 # Maximum resident set size: 1684 pages
% 0.17/0.57 % E---3.1 exiting
% 0.17/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------