↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LCL901+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:17:42 PM UTC 2026

% Result   : Theorem 1.71s 0.66s
% Output   : CNFRefutation 2.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   84 (  67 unt;   0 def)
%            Number of atoms       :  106 (  48 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   41 (  19   ~;  16   |;   2   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :  146 (  24 sgn  48   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(sos_03,axiom,
    ! [X1] : '+'(X1,'0') = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).

fof(sos_02,axiom,
    ! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).

fof(sos_06,axiom,
    ! [X7,X8] :
      ( ( '>='(X8,X7)
        & '>='(X7,X8) )
     => X7 = X8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).

fof(sos_08,axiom,
    ! [X1] : '>='(X1,'0'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).

fof(sos_07,axiom,
    ! [X9,X10,X11] :
      ( '>='('+'(X9,X10),X11)
    <=> '>='(X10,'==>'(X9,X11)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).

fof(sos_09,axiom,
    ! [X12,X13,X14] :
      ( '>='(X12,X13)
     => '>='('+'(X12,X14),'+'(X13,X14)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).

fof(sos_12,axiom,
    ! [X1] : '+'(X1,'1') = '1',
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).

fof(sos_13,axiom,
    ! [X1,X2] : '==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_13) ).

fof(sos_14,axiom,
    ! [X1] : '+'(X1,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_14) ).

fof(sos_04,axiom,
    ! [X1] : '>='(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).

fof(sos_01,axiom,
    ! [X1,X2,X3] : '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).

fof(sos_11,axiom,
    ! [X18,X19,X20] :
      ( '>='(X18,X19)
     => '>='('==>'(X20,X18),'==>'(X20,X19)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_11) ).

fof(goals_15,conjecture,
    ! [X21] : '==>'('==>'('==>'(X21,'1'),X21),X21) = '0',
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_15) ).

fof(c_0_13,plain,
    ! [X27] : '+'(X27,'0') = X27,
    inference(variable_rename,[status(thm)],[sos_03]) ).

fof(c_0_14,plain,
    ! [X25,X26] : '+'(X25,X26) = '+'(X26,X25),
    inference(variable_rename,[status(thm)],[sos_02]) ).

fof(c_0_15,plain,
    ! [X32,X33] :
      ( X32 = X33
      | ~ '>='(X33,X32)
      | ~ '>='(X32,X33) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])])]) ).

fof(c_0_16,plain,
    ! [X37] : '>='(X37,'0'),
    inference(variable_rename,[status(thm)],[sos_08]) ).

fof(c_0_17,plain,
    ! [X34,X35,X36] :
      ( ( '>='('+'(X34,X35),X36)
        | ~ '>='(X35,'==>'(X34,X36)) )
      & ( '>='(X35,'==>'(X34,X36))
        | ~ '>='('+'(X34,X35),X36) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).

fof(c_0_18,plain,
    ! [X38,X39,X40] :
      ( '>='('+'(X38,X40),'+'(X39,X40))
      | ~ '>='(X38,X39) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])]) ).

cnf(c_0_19,plain,
    '+'(X1,'0') = X1,
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,plain,
    '+'(X1,X2) = '+'(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_21,plain,
    ! [X47] : '+'(X47,'1') = '1',
    inference(variable_rename,[status(thm)],[sos_12]) ).

cnf(c_0_22,plain,
    ( ~ '>='(X2,X1)
    | ~ '>='(X1,X2)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_23,plain,
    '>='(X1,'0'),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_24,plain,
    ( ~ '>='('+'(X1,X2),X3)
    | '>='(X2,'==>'(X1,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_25,plain,
    ( ~ '>='(X1,X2)
    | '>='('+'(X1,X3),'+'(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_26,plain,
    '+'('0',X1) = X1,
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_27,plain,
    '+'(X1,'1') = '1',
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

fof(c_0_28,plain,
    ! [X48,X49] : '==>'('==>'(X48,X49),X49) = '==>'('==>'(X49,X48),X48),
    inference(variable_rename,[status(thm)],[sos_13]) ).

cnf(c_0_29,plain,
    ( ~ '>='('0',X1)
    | '0' = X1 ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_30,plain,
    '>='(X1,'==>'(X2,'0')),
    inference(spm,[status(thm)],[c_0_24,c_0_23]) ).

cnf(c_0_31,plain,
    '>='('+'(X1,X2),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_26]) ).

cnf(c_0_32,plain,
    '+'('1',X1) = '1',
    inference(spm,[status(thm)],[c_0_27,c_0_20]) ).

cnf(c_0_33,plain,
    '==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_34,plain,
    '==>'(X1,'0') = '0',
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,plain,
    '>='('1',X1),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,plain,
    ( ~ '>='(X1,'==>'(X2,X3))
    | '>='('+'(X2,X1),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_37,plain,
    '==>'('==>'('0',X1),X1) = '0',
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,plain,
    '>='(X1,'==>'(X2,X1)),
    inference(spm,[status(thm)],[c_0_24,c_0_31]) ).

fof(c_0_39,plain,
    ! [X50] : '+'(X50,X50) = X50,
    inference(variable_rename,[status(thm)],[sos_14]) ).

fof(c_0_40,plain,
    ! [X28] : '>='(X28,X28),
    inference(variable_rename,[status(thm)],[sos_04]) ).

cnf(c_0_41,plain,
    '>='(X1,'==>'('1',X2)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_32]),c_0_35])]) ).

cnf(c_0_42,plain,
    '>='('+'('==>'('0',X1),X2),X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_23])]) ).

cnf(c_0_43,plain,
    '>='('+'(X1,X2),'+'('==>'(X3,X1),X2)),
    inference(spm,[status(thm)],[c_0_25,c_0_38]) ).

cnf(c_0_44,plain,
    '+'(X1,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_45,plain,
    '>='(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_46,plain,
    '==>'('1',X1) = '0',
    inference(spm,[status(thm)],[c_0_29,c_0_41]) ).

cnf(c_0_47,plain,
    '>='('==>'('0',X1),X1),
    inference(spm,[status(thm)],[c_0_42,c_0_19]) ).

cnf(c_0_48,plain,
    '>='(X1,'+'(X1,'==>'(X2,X1))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_20]) ).

cnf(c_0_49,plain,
    '>='('+'(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_31,c_0_20]) ).

cnf(c_0_50,plain,
    ( ~ '>='(X1,X2)
    | '>='('0','==>'(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_19]) ).

cnf(c_0_51,plain,
    '>='('+'(X1,'==>'(X1,X2)),X2),
    inference(spm,[status(thm)],[c_0_36,c_0_45]) ).

cnf(c_0_52,plain,
    '==>'('==>'(X1,'1'),'1') = '==>'('0',X1),
    inference(spm,[status(thm)],[c_0_33,c_0_46]) ).

cnf(c_0_53,plain,
    '==>'('0',X1) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_47]),c_0_38])]) ).

cnf(c_0_54,plain,
    '+'(X1,'==>'(X2,X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_48]),c_0_49])]) ).

cnf(c_0_55,plain,
    '>='('0','==>'('+'(X1,'==>'(X1,X2)),X2)),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

fof(c_0_56,plain,
    ! [X22,X23,X24] : '+'('+'(X22,X23),X24) = '+'(X22,'+'(X23,X24)),
    inference(variable_rename,[status(thm)],[sos_01]) ).

fof(c_0_57,plain,
    ! [X44,X45,X46] :
      ( '>='('==>'(X46,X44),'==>'(X46,X45))
      | ~ '>='(X44,X45) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_11])])]) ).

cnf(c_0_58,plain,
    '==>'('==>'(X1,'1'),'1') = X1,
    inference(rw,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_59,plain,
    '>='(X1,'==>'(X2,'+'(X2,X1))),
    inference(spm,[status(thm)],[c_0_24,c_0_45]) ).

cnf(c_0_60,plain,
    '+'(X1,'==>'('==>'(X1,X2),X2)) = X1,
    inference(spm,[status(thm)],[c_0_54,c_0_33]) ).

cnf(c_0_61,plain,
    '==>'('+'(X1,'==>'(X1,X2)),X2) = '0',
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_55]),c_0_23])]) ).

cnf(c_0_62,plain,
    '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_56]) ).

cnf(c_0_63,plain,
    ( ~ '>='(X1,X2)
    | '>='('==>'(X3,X1),'==>'(X3,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_57]) ).

cnf(c_0_64,plain,
    ( ~ '>='(X2,X1)
    | '>='('+'('==>'(X1,'1'),X2),'1') ),
    inference(spm,[status(thm)],[c_0_36,c_0_58]) ).

cnf(c_0_65,plain,
    '>='('0','==>'(X1,'==>'(X2,X1))),
    inference(spm,[status(thm)],[c_0_50,c_0_38]) ).

cnf(c_0_66,plain,
    ( ~ '>='('==>'(X1,'+'(X1,X2)),X2)
    | '==>'(X1,'+'(X1,X2)) = X2 ),
    inference(spm,[status(thm)],[c_0_22,c_0_59]) ).

cnf(c_0_67,plain,
    '+'(X1,'==>'(X1,X2)) = '+'(X1,X2),
    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_61]),c_0_53]),c_0_62]),c_0_20]),c_0_54]) ).

cnf(c_0_68,plain,
    '>='('==>'(X1,'+'(X2,X3)),'==>'(X1,X3)),
    inference(spm,[status(thm)],[c_0_63,c_0_31]) ).

cnf(c_0_69,plain,
    '>='('+'(X1,'==>'('==>'(X2,X1),'1')),'1'),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_38]),c_0_20]) ).

cnf(c_0_70,plain,
    '==>'(X1,'==>'(X2,X1)) = '0',
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_65]),c_0_23])]) ).

cnf(c_0_71,plain,
    '==>'(X1,'+'(X1,X2)) = '==>'(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]) ).

cnf(c_0_72,plain,
    '+'(X1,'==>'('==>'(X2,X1),'1')) = '1',
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_69]),c_0_35])]) ).

fof(c_0_73,negated_conjecture,
    ~ ! [X21] : '==>'('==>'('==>'(X21,'1'),X21),X21) = '0',
    inference(assume_negation,[status(cth)],[goals_15]) ).

cnf(c_0_74,plain,
    '==>'('==>'('==>'(X1,X2),X2),X2) = '==>'(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_70]),c_0_53]) ).

cnf(c_0_75,plain,
    '==>'(X1,'==>'('==>'(X2,X1),'1')) = '==>'(X1,'1'),
    inference(spm,[status(thm)],[c_0_71,c_0_72]) ).

cnf(c_0_76,plain,
    '>='(X1,'==>'(X2,X2)),
    inference(spm,[status(thm)],[c_0_24,c_0_49]) ).

fof(c_0_77,negated_conjecture,
    '==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0) != '0',
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_73])])])]) ).

cnf(c_0_78,plain,
    '==>'('==>'('==>'(X1,X2),X2),X1) = '==>'(X2,X1),
    inference(spm,[status(thm)],[c_0_74,c_0_33]) ).

cnf(c_0_79,plain,
    '==>'(X1,'==>'(X1,'1')) = '==>'(X1,'1'),
    inference(spm,[status(thm)],[c_0_75,c_0_53]) ).

cnf(c_0_80,plain,
    '==>'(X1,X1) = '0',
    inference(spm,[status(thm)],[c_0_29,c_0_76]) ).

cnf(c_0_81,negated_conjecture,
    '==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0) != '0',
    inference(split_conjunct,[status(thm)],[c_0_77]) ).

cnf(c_0_82,plain,
    '==>'('==>'(X1,'1'),X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]),c_0_53]) ).

cnf(c_0_83,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_80])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL901+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n016.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 01:15:38 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.71/0.66  % Version: 3.5.1
% 1.71/0.66  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.71/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.71/0.66  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.71/0.66  % Starting new_bool_3 with 300s (1) cores
% 1.71/0.66  % Starting new_bool_1 with 300s (1) cores
% 1.71/0.66  % Starting sh5l with 300s (1) cores
% 1.71/0.66  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1254595 completed with status 0
% 1.71/0.66  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.71/0.66  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.71/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.71/0.66  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.71/0.66  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.71/0.66  % No SInE strategy applied
% 1.71/0.66  % Search class: FHUSM-FFSF22-MFFFFFNN
% 1.71/0.66  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.71/0.66  % Starting SubtermCWHack with 136s (1) cores
% 1.71/0.66  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.71/0.66  % Starting U----_212g_01_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.71/0.66  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.71/0.66  % Starting new_bool_3 with 136s (1) cores
% 1.71/0.66  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 1254606 completed with status 0
% 1.71/0.66  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 1.71/0.66  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.71/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.71/0.66  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.71/0.66  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.71/0.66  % No SInE strategy applied
% 1.71/0.66  % Search class: FHUSM-FFSF22-MFFFFFNN
% 1.71/0.66  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.71/0.66  % Starting SubtermCWHack with 136s (1) cores
% 1.71/0.66  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.71/0.66  % Starting U----_212g_01_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.71/0.66  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.71/0.66  % Preprocessing time       : 0.001 s
% 1.71/0.66  % Presaturation interreduction done
% 1.71/0.66  
% 1.71/0.66  % Proof found!
% 1.71/0.66  % SZS status Theorem
% 1.71/0.66  % SZS output start CNFRefutation
% See solution above
% 2.04/0.66  % Parsed axioms                        : 15
% 2.04/0.66  % Removed by relevancy pruning/SinE    : 0
% 2.04/0.66  % Initial clauses                      : 16
% 2.04/0.66  % Removed in clause preprocessing      : 0
% 2.04/0.66  % Initial clauses in saturation        : 16
% 2.04/0.66  % Processed clauses                    : 2249
% 2.04/0.66  % ...of these trivial                  : 339
% 2.04/0.66  % ...subsumed                          : 1590
% 2.04/0.66  % ...remaining for further processing  : 320
% 2.04/0.66  % Other redundant clauses eliminated   : 0
% 2.04/0.66  % Clauses deleted for lack of memory   : 0
% 2.04/0.66  % Backward-subsumed                    : 2
% 2.04/0.66  % Backward-rewritten                   : 66
% 2.04/0.66  % Generated clauses                    : 29189
% 2.04/0.66  % ...of the previous two non-redundant : 10826
% 2.04/0.66  % ...aggressively subsumed             : 0
% 2.04/0.66  % Contextual simplify-reflections      : 0
% 2.04/0.66  % Paramodulations                      : 29189
% 2.04/0.66  % Factorizations                       : 0
% 2.04/0.66  % NegExts                              : 0
% 2.04/0.66  % Equation resolutions                 : 0
% 2.04/0.66  % Disequality decompositions           : 0
% 2.04/0.66  % Total rewrite steps                  : 48166
% 2.04/0.66  % ...of those cached                   : 44164
% 2.04/0.66  % Propositional unsat checks           : 0
% 2.04/0.66  %    Propositional check models        : 0
% 2.04/0.66  %    Propositional check unsatisfiable : 0
% 2.04/0.66  %    Propositional clauses             : 0
% 2.04/0.66  %    Propositional clauses after purity: 0
% 2.04/0.66  %    Propositional unsat core size     : 0
% 2.04/0.66  %    Propositional preprocessing time  : 0.000
% 2.04/0.66  %    Propositional encoding time       : 0.000
% 2.04/0.66  %    Propositional solver time         : 0.000
% 2.04/0.66  %    Success case prop preproc time    : 0.000
% 2.04/0.66  %    Success case prop encoding time   : 0.000
% 2.04/0.66  %    Success case prop solver time     : 0.000
% 2.04/0.66  % Current number of processed clauses  : 236
% 2.04/0.66  %    Positive orientable unit clauses  : 155
% 2.04/0.66  %    Positive unorientable unit clauses: 5
% 2.04/0.66  %    Negative unit clauses             : 0
% 2.04/0.66  %    Non-unit-clauses                  : 76
% 2.04/0.66  % Current number of unprocessed clauses: 8387
% 2.04/0.66  % ...number of literals in the above   : 10634
% 2.04/0.66  % Current number of archived formulas  : 0
% 2.04/0.66  % Current number of archived clauses   : 84
% 2.04/0.66  % Clause-clause subsumption calls (NU) : 4232
% 2.04/0.66  % Rec. Clause-clause subsumption calls : 4232
% 2.04/0.66  % Non-unit clause-clause subsumptions  : 1535
% 2.04/0.66  % Unit Clause-clause subsumption calls : 113
% 2.04/0.66  % Rewrite failures with RHS unbound    : 0
% 2.04/0.66  % BW rewrite match attempts            : 878
% 2.04/0.66  % BW rewrite match successes           : 107
% 2.04/0.66  % Condensation attempts                : 0
% 2.04/0.66  % Condensation successes               : 0
% 2.04/0.66  % Termbank termtop insertions          : 271421
% 2.04/0.66  % Search garbage collected termcells   : 113
% 2.04/0.66  
% 2.04/0.66  % -------------------------------------------------
% 2.04/0.66  % User time                : 0.227 s
% 2.04/0.66  % System time              : 0.012 s
% 2.04/0.66  % Total time               : 0.239 s
% 2.04/0.66  % Maximum resident set size: 3596 pages
% 2.04/0.66  
% 2.04/0.66  % -------------------------------------------------
% 2.04/0.66  % User time                : 1.124 s
% 2.04/0.66  % System time              : 0.071 s
% 2.04/0.66  % Total time               : 1.194 s
% 2.04/0.66  % Maximum resident set size: 4864 pages
% 2.04/0.66  % E exiting
%------------------------------------------------------------------------------