TSTP Solution File: GRP210-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP210-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:39 EDT 2023
% Result : Unsatisfiable 0.14s 0.53s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 14
% Syntax : Number of clauses : 69 ( 17 unt; 42 nHn; 58 RR)
% Number of literals : 190 ( 189 equ; 85 neg)
% Maximal clause size : 13 ( 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 : 67 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',left_identity) ).
cnf(prove_this_34,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',prove_this_34) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',prove_this_33) ).
cnf(prove_this_26,negated_conjecture,
( inverse(sk_c3) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',prove_this_26) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c10,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',prove_this_6) ).
cnf(prove_this_25,negated_conjecture,
( inverse(sk_c3) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',prove_this_25) ).
cnf(prove_this_14,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c10,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',prove_this_14) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c7,sk_c10) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',prove_this_7) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| inverse(sk_c7) = sk_c10 ),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',prove_this_8) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c7,sk_c10) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',prove_this_15) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c7) = sk_c10 ),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',prove_this_16) ).
cnf(prove_this_41,negated_conjecture,
( multiply(X1,X2) != sk_c10
| inverse(X1) != X2
| multiply(X2,sk_c9) != sk_c10
| inverse(X3) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| inverse(X4) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X5,X6) != sk_c9
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c9
| multiply(sk_c10,X7) != sk_c9
| multiply(X8,sk_c10) != X7
| inverse(X8) != sk_c10 ),
file('/export/starexec/sandbox2/tmp/tmp.xxjrbTXlnu/E---3.1_18403.p',prove_this_41) ).
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_c3,sk_c9) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
prove_this_34 ).
cnf(c_0_19,negated_conjecture,
( multiply(inverse(sk_c4),sk_c10) = sk_c9
| multiply(sk_c3,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_33 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( multiply(inverse(sk_c3),sk_c10) = sk_c9
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( inverse(sk_c3) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
prove_this_26 ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c4,sk_c9) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c10,sk_c8) = sk_c9 ),
prove_this_6 ).
cnf(c_0_26,negated_conjecture,
( multiply(inverse(sk_c4),sk_c10) = sk_c9
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( inverse(sk_c3) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_25 ).
cnf(c_0_28,negated_conjecture,
( multiply(inverse(sk_c1),sk_c10) = sk_c2
| multiply(sk_c10,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c10,sk_c8) = sk_c9 ),
prove_this_14 ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c9
| inverse(sk_c3) = sk_c10 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c1,multiply(sk_c2,X1)) = multiply(sk_c10,X1)
| multiply(sk_c10,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| multiply(sk_c2,sk_c10) = sk_c2 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
multiply(sk_c10,sk_c10) = sk_c9,
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| multiply(sk_c1,sk_c2) = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c7,sk_c10) = sk_c8 ),
prove_this_7 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
multiply(inverse(sk_c10),sk_c9) = sk_c10,
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( multiply(inverse(sk_c7),sk_c8) = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( sk_c9 = sk_c10
| sk_c8 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_36]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( multiply(inverse(sk_c7),sk_c10) = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| inverse(sk_c7) = sk_c10 ),
prove_this_8 ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| sk_c9 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33])]) ).
cnf(c_0_43,negated_conjecture,
( multiply(inverse(sk_c1),sk_c10) = sk_c2
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c7,sk_c10) = sk_c8 ),
prove_this_15 ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c7,sk_c10) = sk_c8
| multiply(sk_c2,sk_c10) = sk_c2
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( multiply(inverse(sk_c7),sk_c8) = sk_c10
| multiply(sk_c2,sk_c10) = sk_c2
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_45]) ).
cnf(c_0_47,negated_conjecture,
( multiply(inverse(sk_c7),sk_c10) = sk_c10
| multiply(sk_c2,sk_c10) = sk_c2
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_46,c_0_39]) ).
cnf(c_0_48,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c7) = sk_c10 ),
prove_this_16 ).
cnf(c_0_49,negated_conjecture,
( multiply(X1,X2) != sk_c10
| inverse(X1) != X2
| multiply(X2,sk_c9) != sk_c10
| inverse(X3) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| inverse(X4) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X5,X6) != sk_c9
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c9
| multiply(sk_c10,X7) != sk_c9
| multiply(X8,sk_c10) != X7
| inverse(X8) != sk_c10 ),
prove_this_41 ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c2
| inverse(sk_c1) = sk_c2
| sk_c9 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_33])]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c10,multiply(X1,sk_c10)) != sk_c9
| multiply(inverse(X2),sk_c10) != sk_c9
| multiply(inverse(X3),sk_c9) != sk_c10
| multiply(X2,inverse(X2)) != sk_c9
| multiply(X3,inverse(X3)) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| inverse(X1) != sk_c10
| inverse(X4) != sk_c10
| inverse(X5) != sk_c10 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_49])])]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c2
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_43,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c10,multiply(X1,multiply(X2,sk_c10))) != sk_c9
| multiply(inverse(X3),sk_c10) != sk_c9
| multiply(inverse(X4),sk_c9) != sk_c10
| multiply(X3,inverse(X3)) != sk_c9
| multiply(X4,inverse(X4)) != sk_c10
| inverse(multiply(X1,X2)) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| multiply(X6,sk_c9) != sk_c10
| inverse(X5) != sk_c10
| inverse(X6) != sk_c10 ),
inference(spm,[status(thm)],[c_0_51,c_0_14]) ).
cnf(c_0_54,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_55,negated_conjecture,
( sk_c9 = sk_c10
| sk_c10 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_52]),c_0_15]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c10,multiply(X1,sk_c10)) != sk_c9
| multiply(inverse(X2),sk_c10) != sk_c9
| multiply(inverse(X3),sk_c9) != sk_c10
| inverse(multiply(X1,identity)) != sk_c10
| multiply(X2,inverse(X2)) != sk_c9
| multiply(X3,inverse(X3)) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| inverse(X4) != sk_c10
| inverse(X5) != sk_c10 ),
inference(spm,[status(thm)],[c_0_53,c_0_16]) ).
cnf(c_0_57,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
sk_c10 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_55]),c_0_15])]) ).
cnf(c_0_59,negated_conjecture,
( inverse(multiply(inverse(sk_c10),identity)) != sk_c10
| multiply(inverse(X1),sk_c10) != sk_c9
| multiply(inverse(X2),sk_c9) != sk_c10
| multiply(sk_c10,identity) != sk_c9
| multiply(X1,inverse(X1)) != sk_c9
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != sk_c10 ),
inference(spm,[status(thm)],[c_0_56,c_0_15]) ).
cnf(c_0_60,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
sk_c9 = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_58]),c_0_58]),c_0_16]) ).
cnf(c_0_62,negated_conjecture,
( multiply(inverse(X1),identity) != identity
| multiply(inverse(X2),identity) != identity
| multiply(X3,identity) != identity
| multiply(X4,identity) != identity
| inverse(X3) != identity
| inverse(X4) != identity ),
inference(cn,[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(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(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(rw,[status(thm)],[c_0_59,c_0_58]),c_0_15]),c_0_58]),c_0_58]),c_0_58]),c_0_58]),c_0_16]),c_0_58]),c_0_58]),c_0_58]),c_0_58]),c_0_58]),c_0_60]),c_0_61]),c_0_61]),c_0_61]),c_0_57]),c_0_61]),c_0_57]),c_0_61]),c_0_61])]) ).
cnf(c_0_63,plain,
multiply(inverse(X1),identity) = inverse(X1),
inference(spm,[status(thm)],[c_0_17,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( multiply(X1,identity) != identity
| multiply(X2,identity) != identity
| inverse(X3) != identity
| inverse(X4) != identity
| inverse(X1) != identity
| inverse(X2) != identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_63]) ).
cnf(c_0_65,negated_conjecture,
( multiply(X1,identity) != identity
| inverse(X2) != identity
| inverse(X3) != identity
| inverse(X1) != identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_15]),c_0_60]),c_0_60])]) ).
cnf(c_0_66,negated_conjecture,
( inverse(X1) != identity
| inverse(X2) != identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_15]),c_0_60]),c_0_60])]) ).
cnf(c_0_67,negated_conjecture,
inverse(X1) != identity,
inference(spm,[status(thm)],[c_0_66,c_0_60]) ).
cnf(c_0_68,plain,
$false,
inference(sr,[status(thm)],[c_0_60,c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP210-1 : TPTP v8.1.2. Released v2.5.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n006.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 02:47:10 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 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.xxjrbTXlnu/E---3.1_18403.p
% 0.14/0.53 # Version: 3.1pre001
% 0.14/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.53 # Starting sh5l with 300s (1) cores
% 0.14/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 18480 completed with status 0
% 0.14/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.53 # No SInE strategy applied
% 0.14/0.53 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.14/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.14/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.53 # Starting sh5l with 136s (1) cores
% 0.14/0.53 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 18484 completed with status 0
% 0.14/0.53 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.53 # No SInE strategy applied
% 0.14/0.53 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.14/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.14/0.53 # Preprocessing time : 0.001 s
% 0.14/0.53 # Presaturation interreduction done
% 0.14/0.53
% 0.14/0.53 # Proof found!
% 0.14/0.53 # SZS status Unsatisfiable
% 0.14/0.53 # SZS output start CNFRefutation
% See solution above
% 0.14/0.53 # Parsed axioms : 44
% 0.14/0.53 # Removed by relevancy pruning/SinE : 0
% 0.14/0.53 # Initial clauses : 44
% 0.14/0.53 # Removed in clause preprocessing : 0
% 0.14/0.53 # Initial clauses in saturation : 44
% 0.14/0.53 # Processed clauses : 1584
% 0.14/0.53 # ...of these trivial : 92
% 0.14/0.53 # ...subsumed : 715
% 0.14/0.53 # ...remaining for further processing : 777
% 0.14/0.53 # Other redundant clauses eliminated : 3
% 0.14/0.53 # Clauses deleted for lack of memory : 0
% 0.14/0.53 # Backward-subsumed : 155
% 0.14/0.53 # Backward-rewritten : 563
% 0.14/0.53 # Generated clauses : 5797
% 0.14/0.53 # ...of the previous two non-redundant : 5578
% 0.14/0.53 # ...aggressively subsumed : 0
% 0.14/0.53 # Contextual simplify-reflections : 33
% 0.14/0.53 # Paramodulations : 5794
% 0.14/0.53 # Factorizations : 1
% 0.14/0.53 # NegExts : 0
% 0.14/0.53 # Equation resolutions : 3
% 0.14/0.53 # Total rewrite steps : 3909
% 0.14/0.53 # Propositional unsat checks : 0
% 0.14/0.53 # Propositional check models : 0
% 0.14/0.53 # Propositional check unsatisfiable : 0
% 0.14/0.53 # Propositional clauses : 0
% 0.14/0.53 # Propositional clauses after purity: 0
% 0.14/0.53 # Propositional unsat core size : 0
% 0.14/0.53 # Propositional preprocessing time : 0.000
% 0.14/0.53 # Propositional encoding time : 0.000
% 0.14/0.53 # Propositional solver time : 0.000
% 0.14/0.53 # Success case prop preproc time : 0.000
% 0.14/0.53 # Success case prop encoding time : 0.000
% 0.14/0.53 # Success case prop solver time : 0.000
% 0.14/0.53 # Current number of processed clauses : 13
% 0.14/0.53 # Positive orientable unit clauses : 12
% 0.14/0.53 # Positive unorientable unit clauses: 0
% 0.14/0.53 # Negative unit clauses : 1
% 0.14/0.53 # Non-unit-clauses : 0
% 0.14/0.53 # Current number of unprocessed clauses: 2106
% 0.14/0.53 # ...number of literals in the above : 15278
% 0.14/0.53 # Current number of archived formulas : 0
% 0.14/0.53 # Current number of archived clauses : 763
% 0.14/0.53 # Clause-clause subsumption calls (NU) : 13577
% 0.14/0.53 # Rec. Clause-clause subsumption calls : 7357
% 0.14/0.53 # Non-unit clause-clause subsumptions : 866
% 0.14/0.53 # Unit Clause-clause subsumption calls : 346
% 0.14/0.53 # Rewrite failures with RHS unbound : 0
% 0.14/0.53 # BW rewrite match attempts : 37
% 0.14/0.53 # BW rewrite match successes : 35
% 0.14/0.53 # Condensation attempts : 0
% 0.14/0.53 # Condensation successes : 0
% 0.14/0.53 # Termbank termtop insertions : 96191
% 0.14/0.53
% 0.14/0.53 # -------------------------------------------------
% 0.14/0.53 # User time : 0.116 s
% 0.14/0.53 # System time : 0.007 s
% 0.14/0.53 # Total time : 0.123 s
% 0.14/0.53 # Maximum resident set size: 1616 pages
% 0.14/0.53
% 0.14/0.53 # -------------------------------------------------
% 0.14/0.53 # User time : 0.597 s
% 0.14/0.53 # System time : 0.016 s
% 0.14/0.53 # Total time : 0.612 s
% 0.14/0.53 # Maximum resident set size: 1692 pages
% 0.14/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------