%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU156+2 : 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:24:01 PM UTC 2026
% Result : Theorem 0.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 8
% Syntax : Number of formulae : 66 ( 25 unt; 0 def)
% Number of atoms : 153 ( 125 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 131 ( 44 ~; 68 |; 11 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 99 ( 7 sgn 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X2 = X4
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X2
| X4 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(t8_zfmisc_1,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(t9_zfmisc_1,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X2 = X4
& X1 = X3 ) ),
inference(assume_negation,[status(cth)],[t33_zfmisc_1]) ).
fof(c_0_9,plain,
! [X88,X89] : ordered_pair(X88,X89) = unordered_pair(unordered_pair(X88,X89),singleton(X88)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_10,lemma,
! [X190] : unordered_pair(X190,X190) = singleton(X190),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_11,negated_conjecture,
( ( esk16_0 != esk18_0
| esk15_0 != esk17_0 )
& ordered_pair(esk15_0,esk16_0) = ordered_pair(esk17_0,esk18_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_12,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X35,X36,X37,X38,X39,X40,X41,X42] :
( ( X42 = unordered_pair(X40,X41)
| esk4_3(X40,X41,X42) = X41
| esk4_3(X40,X41,X42) = X40
| in(esk4_3(X40,X41,X42),X42) )
& ( X42 = unordered_pair(X40,X41)
| ~ in(esk4_3(X40,X41,X42),X42)
| esk4_3(X40,X41,X42) != X41 )
& ( X42 = unordered_pair(X40,X41)
| ~ in(esk4_3(X40,X41,X42),X42)
| esk4_3(X40,X41,X42) != X40 )
& ( X37 != unordered_pair(X35,X36)
| in(X39,X37)
| X39 != X36 )
& ( X37 != unordered_pair(X35,X36)
| in(X39,X37)
| X39 != X35 )
& ( X37 != unordered_pair(X35,X36)
| X38 = X36
| X38 = X35
| ~ in(X38,X37) ) ),
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)],[d2_tarski])])])])])])]) ).
cnf(c_0_15,negated_conjecture,
ordered_pair(esk15_0,esk16_0) = ordered_pair(esk17_0,esk18_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,plain,
! [X9,X10] : unordered_pair(X9,X10) = unordered_pair(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_18,plain,
( X3 != unordered_pair(X4,X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
unordered_pair(unordered_pair(esk17_0,esk18_0),unordered_pair(esk17_0,esk17_0)) = unordered_pair(unordered_pair(esk15_0,esk16_0),unordered_pair(esk15_0,esk15_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_20,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( X2 != unordered_pair(X3,X4)
| ~ in(X1,X2)
| X1 = X4
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_18])]) ).
cnf(c_0_23,negated_conjecture,
unordered_pair(unordered_pair(esk15_0,esk15_0),unordered_pair(esk15_0,esk16_0)) = unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_24,plain,
( ~ in(X1,unordered_pair(X3,X2))
| X1 = X3
| X1 = X2 ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
in(unordered_pair(esk15_0,esk16_0),unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_26,plain,
! [X17,X18,X19,X20,X21,X22] :
( ( X22 = singleton(X21)
| esk1_2(X21,X22) = X21
| in(esk1_2(X21,X22),X22) )
& ( X22 = singleton(X21)
| esk1_2(X21,X22) != X21
| ~ in(esk1_2(X21,X22),X22) )
& ( X18 != singleton(X17)
| in(X20,X18)
| X20 != X17 )
& ( X18 != singleton(X17)
| X19 = X17
| ~ in(X19,X18) ) ),
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)],[d1_tarski])])])])])])]) ).
cnf(c_0_27,negated_conjecture,
( unordered_pair(esk15_0,esk16_0) = unordered_pair(esk17_0,esk17_0)
| unordered_pair(esk15_0,esk16_0) = unordered_pair(esk17_0,esk18_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( X3 != unordered_pair(X2,X4)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,plain,
( X2 != singleton(X3)
| ~ in(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( in(esk16_0,unordered_pair(esk17_0,esk18_0))
| unordered_pair(esk15_0,esk16_0) = unordered_pair(esk17_0,esk17_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_31,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_28])]) ).
fof(c_0_32,lemma,
! [X205,X206,X207] :
( X205 = X206
| singleton(X205) != unordered_pair(X206,X207) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])])]) ).
cnf(c_0_33,plain,
( ~ in(X1,X2)
| X2 != unordered_pair(X3,X3)
| X1 = X3 ),
inference(rw,[status(thm)],[c_0_29,c_0_13]) ).
cnf(c_0_34,negated_conjecture,
( esk16_0 = esk17_0
| esk16_0 = esk18_0
| unordered_pair(esk15_0,esk16_0) = unordered_pair(esk17_0,esk17_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
in(unordered_pair(esk15_0,esk15_0),unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0))),
inference(spm,[status(thm)],[c_0_31,c_0_23]) ).
cnf(c_0_36,lemma,
( singleton(X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
( ~ in(X1,unordered_pair(X2,X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( in(esk15_0,unordered_pair(esk17_0,esk17_0))
| esk16_0 = esk18_0
| esk16_0 = esk17_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_34]) ).
fof(c_0_39,lemma,
! [X208,X209,X210] :
( X209 = X210
| singleton(X208) != unordered_pair(X209,X210) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_zfmisc_1])])]) ).
cnf(c_0_40,negated_conjecture,
( unordered_pair(esk15_0,esk15_0) = unordered_pair(esk17_0,esk17_0)
| unordered_pair(esk15_0,esk15_0) = unordered_pair(esk17_0,esk18_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( in(esk15_0,unordered_pair(esk17_0,esk18_0))
| unordered_pair(esk15_0,esk16_0) = unordered_pair(esk17_0,esk17_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_42,lemma,
( unordered_pair(X1,X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(rw,[status(thm)],[c_0_36,c_0_13]) ).
cnf(c_0_43,negated_conjecture,
( esk15_0 = esk17_0
| esk16_0 = esk17_0
| esk16_0 = esk18_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,lemma,
( singleton(X1) != unordered_pair(X2,X3)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( unordered_pair(esk15_0,esk15_0) = unordered_pair(esk17_0,esk17_0)
| unordered_pair(unordered_pair(esk17_0,esk18_0),unordered_pair(esk15_0,esk16_0)) = unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( esk15_0 = esk17_0
| esk18_0 = esk15_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_41]),c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( esk16_0 = esk17_0
| esk15_0 = esk17_0
| unordered_pair(esk15_0,esk18_0) = unordered_pair(esk17_0,esk18_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_43]),c_0_42]) ).
cnf(c_0_48,lemma,
( unordered_pair(X1,X1) != unordered_pair(X2,X3)
| X2 = X3 ),
inference(rw,[status(thm)],[c_0_44,c_0_13]) ).
cnf(c_0_49,negated_conjecture,
( esk15_0 = esk17_0
| unordered_pair(unordered_pair(esk17_0,esk15_0),unordered_pair(esk15_0,esk16_0)) = unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk15_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( esk15_0 = esk17_0
| esk16_0 = esk17_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_46]),c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( unordered_pair(X1,X1) != unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0))
| unordered_pair(esk15_0,esk16_0) = unordered_pair(esk15_0,esk15_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_23]) ).
cnf(c_0_52,negated_conjecture,
( esk15_0 = esk17_0
| unordered_pair(unordered_pair(esk17_0,esk15_0),unordered_pair(esk17_0,esk15_0)) = unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk15_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_20]) ).
cnf(c_0_53,negated_conjecture,
( unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0)) != unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk15_0))
| esk15_0 = esk17_0
| unordered_pair(esk15_0,esk16_0) = unordered_pair(esk15_0,esk15_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,negated_conjecture,
( esk15_0 = esk17_0
| unordered_pair(esk15_0,esk16_0) = unordered_pair(esk15_0,esk15_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_46]) ).
cnf(c_0_55,negated_conjecture,
esk15_0 = esk17_0,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_50]),c_0_20]),c_0_42]) ).
cnf(c_0_56,negated_conjecture,
( esk16_0 != esk18_0
| esk15_0 != esk17_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_57,negated_conjecture,
( esk16_0 = esk18_0
| esk16_0 = esk17_0 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_55]),c_0_48]) ).
cnf(c_0_58,negated_conjecture,
esk16_0 != esk18_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_55])]) ).
cnf(c_0_59,negated_conjecture,
esk16_0 = esk17_0,
inference(sr,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,negated_conjecture,
unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0)) = unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk17_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_55]),c_0_59]) ).
cnf(c_0_61,lemma,
( unordered_pair(X1,X1) != unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk17_0))
| unordered_pair(esk17_0,esk18_0) = unordered_pair(esk17_0,esk17_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_60]) ).
cnf(c_0_62,lemma,
unordered_pair(esk17_0,esk18_0) = unordered_pair(esk17_0,esk17_0),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_63,lemma,
in(esk18_0,unordered_pair(esk17_0,esk17_0)),
inference(spm,[status(thm)],[c_0_22,c_0_62]) ).
cnf(c_0_64,negated_conjecture,
esk18_0 != esk17_0,
inference(rw,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_63]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU156+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n019.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 05:53:34 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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
% 0.20/0.57 % Version: 3.5.1
% 0.20/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 % Starting sh5l with 300s (1) cores
% 0.20/0.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1824930 completed with status 0
% 0.20/0.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.57 % No SInE strategy applied
% 0.20/0.57 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.20/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.57 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.20/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.20/0.57 % new_bool_3 with pid 1824941 completed with status 0
% 0.20/0.57 % Result found by new_bool_3
% 0.20/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.57 % No SInE strategy applied
% 0.20/0.57 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.20/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.57 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.20/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.20/0.57 % Preprocessing time : 0.004 s
% 0.20/0.57 % Presaturation interreduction done
% 0.20/0.57
% 0.20/0.57 % Proof found!
% 0.20/0.57 % SZS status Theorem
% 0.20/0.57 % SZS output start CNFRefutation
% See solution above
% 0.20/0.57 % Parsed axioms : 84
% 0.20/0.57 % Removed by relevancy pruning/SinE : 0
% 0.20/0.57 % Initial clauses : 134
% 0.20/0.57 % Removed in clause preprocessing : 12
% 0.20/0.57 % Initial clauses in saturation : 122
% 0.20/0.57 % Processed clauses : 562
% 0.20/0.57 % ...of these trivial : 17
% 0.20/0.57 % ...subsumed : 227
% 0.20/0.57 % ...remaining for further processing : 318
% 0.20/0.57 % Other redundant clauses eliminated : 77
% 0.20/0.57 % Clauses deleted for lack of memory : 0
% 0.20/0.57 % Backward-subsumed : 8
% 0.20/0.57 % Backward-rewritten : 50
% 0.20/0.57 % Generated clauses : 1471
% 0.20/0.57 % ...of the previous two non-redundant : 1198
% 0.20/0.57 % ...aggressively subsumed : 0
% 0.20/0.57 % Contextual simplify-reflections : 10
% 0.20/0.57 % Paramodulations : 1388
% 0.20/0.57 % Factorizations : 4
% 0.20/0.57 % NegExts : 0
% 0.20/0.57 % Equation resolutions : 81
% 0.20/0.57 % Disequality decompositions : 0
% 0.20/0.57 % Total rewrite steps : 585
% 0.20/0.57 % ...of those cached : 493
% 0.20/0.57 % Propositional unsat checks : 0
% 0.20/0.57 % Propositional check models : 0
% 0.20/0.57 % Propositional check unsatisfiable : 0
% 0.20/0.57 % Propositional clauses : 0
% 0.20/0.57 % Propositional clauses after purity: 0
% 0.20/0.57 % Propositional unsat core size : 0
% 0.20/0.57 % Propositional preprocessing time : 0.000
% 0.20/0.57 % Propositional encoding time : 0.000
% 0.20/0.57 % Propositional solver time : 0.000
% 0.20/0.57 % Success case prop preproc time : 0.000
% 0.20/0.57 % Success case prop encoding time : 0.000
% 0.20/0.57 % Success case prop solver time : 0.000
% 0.20/0.57 % Current number of processed clauses : 124
% 0.20/0.57 % Positive orientable unit clauses : 30
% 0.20/0.57 % Positive unorientable unit clauses: 3
% 0.20/0.57 % Negative unit clauses : 17
% 0.20/0.57 % Non-unit-clauses : 74
% 0.20/0.57 % Current number of unprocessed clauses: 740
% 0.20/0.57 % ...number of literals in the above : 1889
% 0.20/0.57 % Current number of archived formulas : 0
% 0.20/0.57 % Current number of archived clauses : 172
% 0.20/0.57 % Clause-clause subsumption calls (NU) : 2428
% 0.20/0.57 % Rec. Clause-clause subsumption calls : 1911
% 0.20/0.57 % Non-unit clause-clause subsumptions : 102
% 0.20/0.57 % Unit Clause-clause subsumption calls : 324
% 0.20/0.57 % Rewrite failures with RHS unbound : 0
% 0.20/0.57 % BW rewrite match attempts : 95
% 0.20/0.57 % BW rewrite match successes : 73
% 0.20/0.57 % Condensation attempts : 0
% 0.20/0.57 % Condensation successes : 0
% 0.20/0.57 % Termbank termtop insertions : 22964
% 0.20/0.57 % Search garbage collected termcells : 1908
% 0.20/0.57
% 0.20/0.57 % -------------------------------------------------
% 0.20/0.57 % User time : 0.044 s
% 0.20/0.57 % System time : 0.012 s
% 0.20/0.57 % Total time : 0.055 s
% 0.20/0.57 % Maximum resident set size: 3444 pages
% 0.20/0.57
% 0.20/0.57 % -------------------------------------------------
% 0.20/0.57 % User time : 0.108 s
% 0.20/0.57 % System time : 0.034 s
% 0.20/0.57 % Total time : 0.143 s
% 0.20/0.57 % Maximum resident set size: 4608 pages
% 0.20/0.57 % E exiting
%------------------------------------------------------------------------------