TSTP Solution File: GRP250-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP250-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:46 EDT 2023
% Result : Unsatisfiable 0.16s 0.49s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 16
% Syntax : Number of clauses : 72 ( 22 unt; 38 nHn; 59 RR)
% Number of literals : 188 ( 187 equ; 83 neg)
% Maximal clause size : 12 ( 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/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',left_identity) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_15) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c4,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_1) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_21) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_2) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_16) ).
cnf(prove_this_7,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c4,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_7) ).
cnf(prove_this_37,negated_conjecture,
( multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| multiply(X2,sk_c8) != sk_c7
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(X4) != sk_c9
| multiply(X5,sk_c8) != sk_c7
| inverse(X5) != sk_c8
| inverse(X6) != sk_c7
| multiply(X6,sk_c8) != sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_37) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c6,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_6) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_22) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_4) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_3) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox2/tmp/tmp.mGdJpl8TBK/E---3.1_10473.p',prove_this_8) ).
cnf(c_0_16,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_17,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_18,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c7 ),
prove_this_15 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c4,sk_c9) = sk_c8 ),
prove_this_1 ).
cnf(c_0_22,negated_conjecture,
( multiply(inverse(sk_c2),sk_c7) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( inverse(sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
prove_this_21 ).
cnf(c_0_24,negated_conjecture,
( multiply(inverse(sk_c4),sk_c8) = sk_c9
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c4) = sk_c9 ),
prove_this_2 ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( multiply(inverse(sk_c5),sk_c7) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c8 ),
prove_this_16 ).
cnf(c_0_30,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c4,sk_c9) = sk_c8 ),
prove_this_7 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| multiply(X2,sk_c8) != sk_c7
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(X4) != sk_c9
| multiply(X5,sk_c8) != sk_c7
| inverse(X5) != sk_c8
| inverse(X6) != sk_c7
| multiply(X6,sk_c8) != sk_c7 ),
prove_this_37 ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c6) = sk_c7 ),
prove_this_5 ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c6,sk_c8) = sk_c7 ),
prove_this_6 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c4,sk_c9) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( multiply(inverse(sk_c2),sk_c7) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c5) = sk_c8 ),
prove_this_22 ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(X1,sk_c8) != sk_c7
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c8) != sk_c7
| multiply(X5,sk_c9) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c9
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8
| inverse(X5) != sk_c9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c5) = sk_c8 ),
prove_this_4 ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
prove_this_3 ).
cnf(c_0_42,negated_conjecture,
( multiply(inverse(sk_c4),sk_c8) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c4) = sk_c9 ),
prove_this_8 ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| inverse(sk_c5) = sk_c8 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(X1,sk_c9) != sk_c8
| multiply(X2,sk_c7) != sk_c8
| multiply(X3,sk_c8) != sk_c7
| multiply(X4,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| inverse(X4) != sk_c9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| inverse(sk_c1) = sk_c9 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
multiply(sk_c8,sk_c7) = sk_c8,
inference(spm,[status(thm)],[c_0_28,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(X1,sk_c7) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c9) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_25]),c_0_21]) ).
cnf(c_0_49,negated_conjecture,
multiply(sk_c9,sk_c8) = sk_c9,
inference(spm,[status(thm)],[c_0_30,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
identity = sk_c7,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_47]),c_0_17]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c6,sk_c7) != sk_c8
| multiply(X1,sk_c8) != sk_c7
| multiply(X2,sk_c9) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c9
| sk_c7 != sk_c8 ),
inference(spm,[status(thm)],[c_0_48,c_0_34]) ).
cnf(c_0_52,negated_conjecture,
sk_c7 = sk_c8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_49]),c_0_17]),c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c6,sk_c8) != sk_c8
| multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_52]),c_0_52])]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(rw,[status(thm)],[c_0_35,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c9 ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c6) = sk_c8 ),
inference(rw,[status(thm)],[c_0_34,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_54]) ).
cnf(c_0_58,plain,
multiply(sk_c8,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_50]),c_0_52]) ).
cnf(c_0_59,plain,
multiply(inverse(X1),X1) = sk_c8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_50]),c_0_52]) ).
cnf(c_0_60,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_61,negated_conjecture,
multiply(sk_c1,sk_c9) = sk_c8,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_25]),c_0_21]) ).
cnf(c_0_62,plain,
multiply(inverse(sk_c8),X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_58]) ).
cnf(c_0_63,plain,
multiply(X1,sk_c8) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_59]),c_0_60]) ).
cnf(c_0_64,negated_conjecture,
multiply(inverse(sk_c1),sk_c8) = sk_c9,
inference(spm,[status(thm)],[c_0_19,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c8) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c8) != sk_c8
| multiply(X5,sk_c8) != sk_c8
| multiply(X6,sk_c9) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c9
| inverse(X4) != sk_c8
| inverse(X5) != sk_c8
| inverse(X6) != sk_c9 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_52]),c_0_52]),c_0_52]),c_0_52]),c_0_52]) ).
cnf(c_0_66,plain,
inverse(sk_c8) = sk_c8,
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
multiply(inverse(sk_c1),X1) = multiply(sk_c9,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_64]),c_0_58]) ).
cnf(c_0_68,negated_conjecture,
( multiply(X1,sk_c9) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(X2) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_63]),c_0_63]),c_0_63]),c_0_63])])])])]),c_0_66])]) ).
cnf(c_0_69,negated_conjecture,
inverse(sk_c1) = sk_c9,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_63]),c_0_63]) ).
cnf(c_0_70,negated_conjecture,
( multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_61])]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_69]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : GRP250-1 : TPTP v8.1.2. Released v2.5.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n013.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Oct 3 02:07:29 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.mGdJpl8TBK/E---3.1_10473.p
% 0.16/0.49 # Version: 3.1pre001
% 0.16/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # Starting sh5l with 300s (1) cores
% 0.16/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 10550 completed with status 0
% 0.16/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.16/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.49 # No SInE strategy applied
% 0.16/0.49 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.16/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.16/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.49 # Starting sh5l with 136s (1) cores
% 0.16/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 10555 completed with status 0
% 0.16/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.16/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.49 # No SInE strategy applied
% 0.16/0.49 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.16/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.16/0.49 # Preprocessing time : 0.001 s
% 0.16/0.49 # Presaturation interreduction done
% 0.16/0.49
% 0.16/0.49 # Proof found!
% 0.16/0.49 # SZS status Unsatisfiable
% 0.16/0.49 # SZS output start CNFRefutation
% See solution above
% 0.16/0.49 # Parsed axioms : 40
% 0.16/0.49 # Removed by relevancy pruning/SinE : 0
% 0.16/0.49 # Initial clauses : 40
% 0.16/0.49 # Removed in clause preprocessing : 0
% 0.16/0.49 # Initial clauses in saturation : 40
% 0.16/0.49 # Processed clauses : 813
% 0.16/0.49 # ...of these trivial : 24
% 0.16/0.49 # ...subsumed : 376
% 0.16/0.49 # ...remaining for further processing : 413
% 0.16/0.49 # Other redundant clauses eliminated : 18
% 0.16/0.49 # Clauses deleted for lack of memory : 0
% 0.16/0.49 # Backward-subsumed : 81
% 0.16/0.49 # Backward-rewritten : 226
% 0.16/0.49 # Generated clauses : 2832
% 0.16/0.49 # ...of the previous two non-redundant : 2443
% 0.16/0.49 # ...aggressively subsumed : 0
% 0.16/0.49 # Contextual simplify-reflections : 13
% 0.16/0.49 # Paramodulations : 2812
% 0.16/0.49 # Factorizations : 2
% 0.16/0.49 # NegExts : 0
% 0.16/0.49 # Equation resolutions : 18
% 0.16/0.49 # Total rewrite steps : 1584
% 0.16/0.49 # Propositional unsat checks : 0
% 0.16/0.49 # Propositional check models : 0
% 0.16/0.49 # Propositional check unsatisfiable : 0
% 0.16/0.49 # Propositional clauses : 0
% 0.16/0.49 # Propositional clauses after purity: 0
% 0.16/0.49 # Propositional unsat core size : 0
% 0.16/0.49 # Propositional preprocessing time : 0.000
% 0.16/0.49 # Propositional encoding time : 0.000
% 0.16/0.49 # Propositional solver time : 0.000
% 0.16/0.49 # Success case prop preproc time : 0.000
% 0.16/0.49 # Success case prop encoding time : 0.000
% 0.16/0.49 # Success case prop solver time : 0.000
% 0.16/0.49 # Current number of processed clauses : 66
% 0.16/0.49 # Positive orientable unit clauses : 16
% 0.16/0.49 # Positive unorientable unit clauses: 0
% 0.16/0.49 # Negative unit clauses : 0
% 0.16/0.49 # Non-unit-clauses : 50
% 0.16/0.49 # Current number of unprocessed clauses: 1015
% 0.16/0.49 # ...number of literals in the above : 5403
% 0.16/0.49 # Current number of archived formulas : 0
% 0.16/0.49 # Current number of archived clauses : 347
% 0.16/0.49 # Clause-clause subsumption calls (NU) : 3575
% 0.16/0.49 # Rec. Clause-clause subsumption calls : 2693
% 0.16/0.49 # Non-unit clause-clause subsumptions : 431
% 0.16/0.49 # Unit Clause-clause subsumption calls : 387
% 0.16/0.49 # Rewrite failures with RHS unbound : 0
% 0.16/0.49 # BW rewrite match attempts : 71
% 0.16/0.49 # BW rewrite match successes : 54
% 0.16/0.49 # Condensation attempts : 0
% 0.16/0.49 # Condensation successes : 0
% 0.16/0.49 # Termbank termtop insertions : 39929
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.046 s
% 0.16/0.49 # System time : 0.006 s
% 0.16/0.49 # Total time : 0.052 s
% 0.16/0.49 # Maximum resident set size: 1608 pages
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.251 s
% 0.16/0.49 # System time : 0.010 s
% 0.16/0.49 # Total time : 0.261 s
% 0.16/0.49 # Maximum resident set size: 1688 pages
% 0.16/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------