%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV391+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 02:54:38 PM UTC 2026
% Result : Theorem 3.07s 0.84s
% Output : CNFRefutation 3.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 10 unt; 0 def)
% Number of atoms : 156 ( 15 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 146 ( 50 ~; 68 |; 14 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 6 usr; 2 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 167 ( 38 sgn 77 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X2,X1)
| less_than(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(l27_co,conjecture,
! [X1,X2,X3,X4] :
( ( ok(remove_cpq(triple(X1,X2,X3),X4))
& check_cpq(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l27_co) ).
fof(ax45,axiom,
! [X1,X2,X3,X4] :
( ( strictly_less_than(X4,lookup_slb(X2,X4))
& contains_slb(X2,X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax45) ).
fof(l27_l33,lemma,
! [X1,X2,X3,X4] :
( ok(remove_cpq(triple(X1,X2,X3),X4))
=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l27_l33) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(ax44,axiom,
! [X1,X2,X3,X4] :
( ( less_than(lookup_slb(X2,X4),X4)
& contains_slb(X2,X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax44) ).
fof(l27_li4142,lemma,
! [X1,X2,X3] :
( check_cpq(triple(X1,X2,X3))
<=> ! [X4,X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l27_li4142) ).
fof(l27_li2829,lemma,
! [X1,X2,X3] :
( pair_in_list(X1,X2,X3)
=> ! [X4] :
( contains_slb(X1,X4)
=> ( X2 = X4
| pair_in_list(remove_slb(X1,X4),X2,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l27_li2829) ).
fof(l27_l30,lemma,
! [X1,X2,X3,X4] :
( ( ok(remove_cpq(triple(X1,X2,X3),X4))
& check_cpq(remove_cpq(triple(X1,X2,X3),X4)) )
=> ! [X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l27_l30) ).
fof(c_0_10,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_11,plain,
! [X12,X13] :
( ( strictly_less_than(X12,X13)
| less_than(X13,X12)
| ~ less_than(X12,X13) )
& ( ~ strictly_less_than(X12,X13)
| ~ less_than(X13,X12) )
& ( ~ strictly_less_than(X12,X13)
| less_than(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_12,plain,
! [X9,X10] :
( less_than(X10,X9)
| less_than(X9,X10) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( ok(remove_cpq(triple(X1,X2,X3),X4))
& check_cpq(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
inference(assume_negation,[status(cth)],[l27_co]) ).
fof(c_0_14,plain,
! [X97,X98,X99,X100] :
( remove_cpq(triple(X97,X98,X99),X100) = triple(remove_pqp(X97,X100),remove_slb(X98,X100),bad)
| ~ strictly_less_than(X100,lookup_slb(X98,X100))
| ~ contains_slb(X98,X100) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])])]) ).
cnf(c_0_15,plain,
( ~ less_than(X1,X2)
| strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,lemma,
! [X138,X139,X140,X141] :
( contains_slb(X139,X141)
| ~ ok(remove_cpq(triple(X138,X139,X140),X141)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l27_l33])])]) ).
fof(c_0_18,negated_conjecture,
( ~ check_cpq(triple(esk3_0,esk4_0,esk5_0))
& ok(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))
& check_cpq(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_19,plain,
! [X80,X81] :
( ( ok(triple(X80,X81,bad))
| $true )
& ( ~ $true
| ~ ok(triple(X80,X81,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
cnf(c_0_20,plain,
( ~ strictly_less_than(X2,lookup_slb(X1,X2))
| ~ contains_slb(X1,X2)
| remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),bad) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,lemma,
( ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
ok(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ contains_slb(X2,X4)
| less_than(lookup_slb(X2,X4),X4)
| remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
contains_slb(esk4_0,esk6_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( less_than(lookup_slb(esk4_0,esk6_0),esk6_0)
| remove_cpq(triple(X1,esk4_0,X2),esk6_0) = triple(remove_pqp(X1,esk6_0),remove_slb(esk4_0,esk6_0),bad) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_29,plain,
! [X93,X94,X95,X96] :
( remove_cpq(triple(X93,X94,X95),X96) = triple(remove_pqp(X93,X96),remove_slb(X94,X96),X95)
| ~ less_than(lookup_slb(X94,X96),X96)
| ~ contains_slb(X94,X96) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ ok(remove_cpq(triple(X1,esk4_0,X2),esk6_0))
| less_than(lookup_slb(esk4_0,esk6_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_31,lemma,
! [X119,X120,X121,X122,X123,X124,X125,X128] :
( ( check_cpq(triple(X124,X125,X128))
| ~ less_than(esk2_2(X124,X125),esk1_2(X124,X125)) )
& ( check_cpq(triple(X124,X125,X128))
| pair_in_list(X125,esk1_2(X124,X125),esk2_2(X124,X125)) )
& ( less_than(X123,X122)
| ~ pair_in_list(X120,X122,X123)
| ~ check_cpq(triple(X119,X120,X121)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[l27_li4142])])])])])])]) ).
cnf(c_0_32,plain,
( ~ less_than(lookup_slb(X1,X2),X2)
| ~ contains_slb(X1,X2)
| remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),X4) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,negated_conjecture,
less_than(lookup_slb(esk4_0,esk6_0),esk6_0),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_34,lemma,
( ~ pair_in_list(X2,X4,X5)
| ~ check_cpq(triple(X1,X2,X3))
| less_than(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
triple(remove_pqp(X1,esk6_0),remove_slb(esk4_0,esk6_0),X2) = remove_cpq(triple(X1,esk4_0,X2),esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26])]) ).
cnf(c_0_36,lemma,
( ~ pair_in_list(remove_slb(esk4_0,esk6_0),X2,X1)
| ~ check_cpq(remove_cpq(triple(X3,esk4_0,X4),esk6_0))
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,lemma,
( check_cpq(triple(X2,X1,X3))
| pair_in_list(X1,esk1_2(X2,X1),esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,lemma,
( ~ less_than(esk2_2(X1,X2),esk1_2(X1,X2))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_39,lemma,
! [X129,X130,X131,X132] :
( X130 = X132
| pair_in_list(remove_slb(X129,X132),X130,X131)
| ~ contains_slb(X129,X132)
| ~ pair_in_list(X129,X130,X131) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l27_li2829])])])]) ).
cnf(c_0_40,lemma,
( ~ check_cpq(remove_cpq(triple(X3,esk4_0,X4),esk6_0))
| check_cpq(triple(X1,remove_slb(esk4_0,esk6_0),X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
check_cpq(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_42,lemma,
( ~ contains_slb(X1,X4)
| ~ pair_in_list(X1,X2,X3)
| X2 = X4
| pair_in_list(remove_slb(X1,X4),X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
check_cpq(triple(X1,remove_slb(esk4_0,esk6_0),X2)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,lemma,
( ~ contains_slb(X2,X3)
| pair_in_list(remove_slb(X2,X3),esk1_2(X1,X2),esk2_2(X1,X2))
| check_cpq(triple(X1,X2,X4))
| esk1_2(X1,X2) = X3 ),
inference(spm,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_45,lemma,
( ~ pair_in_list(remove_slb(esk4_0,esk6_0),X2,X1)
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( pair_in_list(remove_slb(esk4_0,esk6_0),esk1_2(X1,esk4_0),esk2_2(X1,esk4_0))
| check_cpq(triple(X1,esk4_0,X2))
| esk1_2(X1,esk4_0) = esk6_0 ),
inference(spm,[status(thm)],[c_0_44,c_0_26]) ).
fof(c_0_47,lemma,
! [X133,X134,X135,X136,X137] :
( less_than(X137,X136)
| ~ pair_in_list(X134,X136,X137)
| ~ ok(remove_cpq(triple(X133,X134,X135),X136))
| ~ check_cpq(remove_cpq(triple(X133,X134,X135),X136)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l27_l30])])])]) ).
cnf(c_0_48,lemma,
( check_cpq(triple(X1,esk4_0,X2))
| esk1_2(X1,esk4_0) = esk6_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_38]) ).
cnf(c_0_49,lemma,
( ~ pair_in_list(X2,X4,X5)
| ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
| less_than(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_50,lemma,
( pair_in_list(esk4_0,esk6_0,esk2_2(X1,esk4_0))
| check_cpq(triple(X1,esk4_0,X3))
| check_cpq(triple(X1,esk4_0,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( ~ pair_in_list(esk4_0,esk6_0,X1)
| less_than(X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_23]),c_0_41])]) ).
cnf(c_0_52,lemma,
( pair_in_list(esk4_0,esk6_0,esk2_2(X1,esk4_0))
| check_cpq(triple(X1,esk4_0,X2)) ),
inference(ef,[status(thm)],[c_0_50]) ).
cnf(c_0_53,lemma,
( ~ less_than(esk2_2(X1,esk4_0),esk6_0)
| check_cpq(triple(X1,esk4_0,X3))
| check_cpq(triple(X1,esk4_0,X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( less_than(esk2_2(X1,esk4_0),esk6_0)
| check_cpq(triple(X1,esk4_0,X2)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
~ check_cpq(triple(esk3_0,esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_56,lemma,
( check_cpq(triple(X1,esk4_0,X4))
| check_cpq(triple(X1,esk4_0,X3))
| check_cpq(triple(X1,esk4_0,X2)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( check_cpq(triple(esk3_0,esk4_0,X2))
| check_cpq(triple(esk3_0,esk4_0,X1)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,negated_conjecture,
check_cpq(triple(esk3_0,esk4_0,X1)),
inference(ef,[status(thm)],[c_0_57]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV391+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n019.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 08:44:50 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/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
% 3.07/0.84 % Version: 3.5.1
% 3.07/0.84 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.07/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.07/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.07/0.84 % Starting new_bool_3 with 300s (1) cores
% 3.07/0.84 % Starting new_bool_1 with 300s (1) cores
% 3.07/0.84 % Starting sh5l with 300s (1) cores
% 3.07/0.84 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2184319 completed with status 0
% 3.07/0.84 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.07/0.84 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.07/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.07/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.07/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.07/0.84 % No SInE strategy applied
% 3.07/0.84 % Search class: FGHSM-FFMF31-MFFFFFNN
% 3.07/0.84 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.07/0.84 % Starting SubtermCWHack with 136s (1) cores
% 3.07/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.07/0.84 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 3.07/0.84 % Starting new_bool_3 with 136s (1) cores
% 3.07/0.84 % Starting new_bool_1 with 136s (1) cores
% 3.07/0.84 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2184326 completed with status 0
% 3.07/0.84 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.07/0.84 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.07/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.07/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.07/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.07/0.84 % No SInE strategy applied
% 3.07/0.84 % Search class: FGHSM-FFMF31-MFFFFFNN
% 3.07/0.84 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.07/0.84 % Starting SubtermCWHack with 136s (1) cores
% 3.07/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.07/0.84 % Preprocessing time : 0.002 s
% 3.07/0.84 % Presaturation interreduction done
% 3.07/0.84
% 3.07/0.84 % Proof found!
% 3.07/0.84 % SZS status Theorem
% 3.07/0.84 % SZS output start CNFRefutation
% See solution above
% 3.07/0.84 % Parsed axioms : 46
% 3.07/0.84 % Removed by relevancy pruning/SinE : 0
% 3.07/0.84 % Initial clauses : 61
% 3.07/0.84 % Removed in clause preprocessing : 4
% 3.07/0.84 % Initial clauses in saturation : 57
% 3.07/0.84 % Processed clauses : 1808
% 3.07/0.84 % ...of these trivial : 62
% 3.07/0.84 % ...subsumed : 454
% 3.07/0.84 % ...remaining for further processing : 1292
% 3.07/0.84 % Other redundant clauses eliminated : 3
% 3.07/0.84 % Clauses deleted for lack of memory : 0
% 3.07/0.84 % Backward-subsumed : 50
% 3.07/0.84 % Backward-rewritten : 13
% 3.07/0.84 % Generated clauses : 13573
% 3.07/0.84 % ...of the previous two non-redundant : 12674
% 3.07/0.84 % ...aggressively subsumed : 0
% 3.07/0.84 % Contextual simplify-reflections : 7
% 3.07/0.84 % Paramodulations : 13507
% 3.07/0.84 % Factorizations : 64
% 3.07/0.84 % NegExts : 0
% 3.07/0.84 % Equation resolutions : 3
% 3.07/0.84 % Disequality decompositions : 0
% 3.07/0.84 % Total rewrite steps : 1363
% 3.07/0.84 % ...of those cached : 1097
% 3.07/0.84 % Propositional unsat checks : 0
% 3.07/0.84 % Propositional check models : 0
% 3.07/0.84 % Propositional check unsatisfiable : 0
% 3.07/0.84 % Propositional clauses : 0
% 3.07/0.84 % Propositional clauses after purity: 0
% 3.07/0.84 % Propositional unsat core size : 0
% 3.07/0.84 % Propositional preprocessing time : 0.000
% 3.07/0.84 % Propositional encoding time : 0.000
% 3.07/0.84 % Propositional solver time : 0.000
% 3.07/0.84 % Success case prop preproc time : 0.000
% 3.07/0.84 % Success case prop encoding time : 0.000
% 3.07/0.84 % Success case prop solver time : 0.000
% 3.07/0.84 % Current number of processed clauses : 1170
% 3.07/0.84 % Positive orientable unit clauses : 607
% 3.07/0.84 % Positive unorientable unit clauses: 0
% 3.07/0.84 % Negative unit clauses : 37
% 3.07/0.84 % Non-unit-clauses : 526
% 3.07/0.84 % Current number of unprocessed clauses: 10908
% 3.07/0.84 % ...number of literals in the above : 36365
% 3.07/0.84 % Current number of archived formulas : 0
% 3.07/0.84 % Current number of archived clauses : 122
% 3.07/0.84 % Clause-clause subsumption calls (NU) : 58274
% 3.07/0.84 % Rec. Clause-clause subsumption calls : 28460
% 3.07/0.84 % Non-unit clause-clause subsumptions : 419
% 3.07/0.84 % Unit Clause-clause subsumption calls : 12142
% 3.07/0.84 % Rewrite failures with RHS unbound : 0
% 3.07/0.84 % BW rewrite match attempts : 18544
% 3.07/0.84 % BW rewrite match successes : 14
% 3.07/0.84 % Condensation attempts : 0
% 3.07/0.84 % Condensation successes : 0
% 3.07/0.84 % Termbank termtop insertions : 268338
% 3.07/0.84 % Search garbage collected termcells : 760
% 3.07/0.84
% 3.07/0.84 % -------------------------------------------------
% 3.07/0.84 % User time : 0.374 s
% 3.07/0.84 % System time : 0.030 s
% 3.07/0.84 % Total time : 0.404 s
% 3.07/0.84 % Maximum resident set size: 3640 pages
% 3.07/0.84
% 3.07/0.84 % -------------------------------------------------
% 3.07/0.84 % User time : 1.827 s
% 3.07/0.84 % System time : 0.110 s
% 3.07/0.84 % Total time : 1.937 s
% 3.07/0.84 % Maximum resident set size: 4608 pages
% 3.07/0.84 % E exiting
%------------------------------------------------------------------------------