%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC315+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:43:54 PM UTC 2026
% Result : Theorem 0.18s 5.77s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 65 ( 17 unt; 0 def)
% Number of atoms : 240 ( 119 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 285 ( 110 ~; 113 |; 30 &)
% ( 2 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( neq(X4,nil)
& ! [X7] :
( ssItem(X7)
=> ! [X8] :
( app(X8,cons(X7,nil)) != X3
| app(cons(X7,nil),X8) != X4
| ~ ssList(X8) ) ) )
| ( ( nil = X1
| nil != X2 )
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( app(X6,cons(X5,nil)) = X1
| app(cons(X5,nil),X6) != X2
| ~ ssList(X6) ) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssItem(X4)
=> ( cons(X3,X1) = cons(X4,X2)
=> ( X2 = X1
& X3 = X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax19) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( neq(X4,nil)
& ! [X7] :
( ssItem(X7)
=> ! [X8] :
( app(X8,cons(X7,nil)) != X3
| app(cons(X7,nil),X8) != X4
| ~ ssList(X8) ) ) )
| ( ( nil = X1
| nil != X2 )
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( app(X6,cons(X5,nil)) = X1
| app(cons(X5,nil),X6) != X2
| ~ ssList(X6) ) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( neq(X4,nil)
& ! [X7] :
( ssItem(X7)
=> ! [X8] :
( app(X8,cons(X7,nil)) != X3
| app(cons(X7,nil),X8) != X4
| ~ ssList(X8) ) ) )
| ( ( nil = X1
| nil != X2 )
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( app(X6,cons(X5,nil)) = X1
| app(cons(X5,nil),X6) != X2
| ~ ssList(X6) ) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,negated_conjecture,
( ( ~ neq(esk4_0,nil)
| app(esk8_0,cons(esk7_0,nil)) = esk3_0 )
& ( ~ neq(esk4_0,nil)
| app(cons(esk7_0,nil),esk8_0) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| ssList(esk8_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk7_0) )
& ( app(esk6_0,cons(esk5_0,nil)) != esk1_0
| nil != esk1_0 )
& ( app(esk6_0,cons(esk5_0,nil)) != esk1_0
| nil = esk2_0 )
& ( app(cons(esk5_0,nil),esk6_0) = esk2_0
| nil != esk1_0 )
& ( app(cons(esk5_0,nil),esk6_0) = esk2_0
| nil = esk2_0 )
& ( ssList(esk6_0)
| nil != esk1_0 )
& ( ssList(esk6_0)
| nil = esk2_0 )
& ( ssItem(esk5_0)
| nil != esk1_0 )
& ( ssItem(esk5_0)
| nil = esk2_0 )
& ( nil != esk4_0
| nil = esk3_0 )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
fof(c_0_9,plain,
! [X38,X39] :
( cons(X39,X38) = app(cons(X39,nil),X38)
| ~ ssItem(X39)
| ~ ssList(X38) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_10,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_11,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_12,negated_conjecture,
( nil != esk1_0
| app(cons(esk5_0,nil),esk6_0) = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(cons(esk7_0,nil),esk8_0) = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssItem(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssList(esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_18,plain,
! [X19,X20] :
( ( ~ ssList(X19)
| ~ ssList(X20)
| neq(X19,X20)
| X19 = X20 )
& ( ~ ssList(X19)
| ~ ssList(X20)
| X19 != X20
| ~ neq(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_19,plain,
! [X24,X25] :
( nil != cons(X25,X24)
| ~ ssItem(X25)
| ~ ssList(X24) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_20,negated_conjecture,
( esk1_0 != nil
| app(cons(esk5_0,nil),esk6_0) = esk4_0 ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( nil != esk1_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
( nil != esk1_0
| ssList(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( nil != esk4_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( ~ neq(esk4_0,nil)
| cons(esk7_0,esk8_0) = esk4_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,negated_conjecture,
( esk1_0 != nil
| cons(esk5_0,esk6_0) = esk4_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_21]),c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( esk4_0 != nil
| esk1_0 = nil ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk2_0
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
( ssItem(esk5_0)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,negated_conjecture,
( ssList(esk6_0)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_35,plain,
! [X50,X51,X52,X53] :
( ( ~ ssList(X50)
| ~ ssList(X51)
| ~ ssItem(X52)
| ~ ssItem(X53)
| cons(X52,X50) != cons(X53,X51)
| X51 = X50 )
& ( ~ ssList(X50)
| ~ ssList(X51)
| ~ ssItem(X52)
| ~ ssItem(X53)
| cons(X52,X50) != cons(X53,X51)
| X52 = X53 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax19])])])])]) ).
cnf(c_0_36,negated_conjecture,
( esk4_0 = nil
| cons(esk7_0,esk8_0) = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_37,negated_conjecture,
esk4_0 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21]),c_0_22]),c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( ssList(esk8_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_39,negated_conjecture,
( ssItem(esk7_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_40,negated_conjecture,
( esk4_0 = nil
| app(cons(esk5_0,nil),esk6_0) = esk4_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_13]),c_0_13]) ).
cnf(c_0_41,negated_conjecture,
( ssItem(esk5_0)
| esk4_0 = nil ),
inference(rw,[status(thm)],[c_0_33,c_0_13]) ).
cnf(c_0_42,negated_conjecture,
( ssList(esk6_0)
| esk4_0 = nil ),
inference(rw,[status(thm)],[c_0_34,c_0_13]) ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X4)
| cons(X3,X2) != cons(X4,X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_44,negated_conjecture,
cons(esk7_0,esk8_0) = esk4_0,
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk8_0),
inference(sr,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_46,negated_conjecture,
ssItem(esk7_0),
inference(sr,[status(thm)],[c_0_39,c_0_37]) ).
cnf(c_0_47,negated_conjecture,
( esk4_0 = nil
| cons(esk5_0,esk6_0) = esk4_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_15]),c_0_41]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) != esk4_0
| esk8_0 = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_49,negated_conjecture,
cons(esk5_0,esk6_0) = esk4_0,
inference(sr,[status(thm)],[c_0_47,c_0_37]) ).
cnf(c_0_50,negated_conjecture,
ssList(esk6_0),
inference(sr,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_51,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_41,c_0_37]) ).
cnf(c_0_52,negated_conjecture,
esk8_0 = esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51])]) ).
cnf(c_0_53,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(esk8_0,cons(esk7_0,nil)) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_54,plain,
( ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X1)
| ~ ssItem(X2)
| cons(X1,X3) != cons(X2,X4)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_55,negated_conjecture,
cons(esk7_0,esk6_0) = esk4_0,
inference(rw,[status(thm)],[c_0_44,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(esk8_0,cons(esk7_0,nil)) = esk1_0 ),
inference(rw,[status(thm)],[c_0_53,c_0_24]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,X2) != esk4_0
| X1 = esk7_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_50]),c_0_46])]) ).
cnf(c_0_58,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) != esk1_0
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_59,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(esk6_0,cons(esk7_0,nil)) = esk1_0 ),
inference(rw,[status(thm)],[c_0_56,c_0_52]) ).
cnf(c_0_60,negated_conjecture,
esk7_0 = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_49]),c_0_50]),c_0_51])]) ).
cnf(c_0_61,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) != esk1_0
| esk4_0 = nil ),
inference(rw,[status(thm)],[c_0_58,c_0_13]) ).
cnf(c_0_62,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(esk6_0,cons(esk5_0,nil)) = esk1_0 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
~ neq(esk4_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_37]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_26]),c_0_27]),c_0_28])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC315+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.61 % Computer : n010.cluster.edu
% 0.14/5.61 % Model : x86_64 x86_64
% 0.14/5.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.61 % Memory : 8046.5625MB
% 0.14/5.61 % OS : Linux 6.8.0-71-generic
% 0.14/5.61 % CPULimit : 300
% 0.14/5.61 % WCLimit : 300
% 0.14/5.61 % DateTime : Mon Sep 21 08:15:31 UTC 2026
% 0.14/5.62 % CPUTime :
% 0.14/5.62 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.69 Running first-order theorem proving
% 0.14/5.69 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.18/5.77 % Version: 3.5.1
% 0.18/5.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/5.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/5.77 % Starting new_bool_3 with 300s (1) cores
% 0.18/5.77 % Starting new_bool_1 with 300s (1) cores
% 0.18/5.77 % Starting sh5l with 300s (1) cores
% 0.18/5.77 % new_bool_1 with pid 446991 completed with status 0
% 0.18/5.77 % Result found by new_bool_1
% 0.18/5.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/5.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/5.77 % Starting new_bool_3 with 300s (1) cores
% 0.18/5.77 % Starting new_bool_1 with 300s (1) cores
% 0.18/5.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/5.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/5.77 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/5.77 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.18/5.77 % Starting SubtermCWHack with 28s (1) cores
% 0.18/5.77 % SubtermCWHack with pid 446993 completed with status 0
% 0.18/5.77 % Result found by SubtermCWHack
% 0.18/5.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/5.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/5.77 % Starting new_bool_3 with 300s (1) cores
% 0.18/5.77 % Starting new_bool_1 with 300s (1) cores
% 0.18/5.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/5.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/5.77 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/5.77 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.18/5.77 % Starting SubtermCWHack with 28s (1) cores
% 0.18/5.77 % Preprocessing time : 0.003 s
% 0.18/5.77
% 0.18/5.77 % Proof found!
% 0.18/5.77 % SZS status Theorem
% 0.18/5.77 % SZS output start CNFRefutation
% See solution above
% 0.18/5.77 % Parsed axioms : 96
% 0.18/5.77 % Removed by relevancy pruning/SinE : 77
% 0.18/5.77 % Initial clauses : 46
% 0.18/5.77 % Removed in clause preprocessing : 0
% 0.18/5.77 % Initial clauses in saturation : 46
% 0.18/5.77 % Processed clauses : 113
% 0.18/5.77 % ...of these trivial : 0
% 0.18/5.77 % ...subsumed : 23
% 0.18/5.77 % ...remaining for further processing : 90
% 0.18/5.77 % Other redundant clauses eliminated : 15
% 0.18/5.77 % Clauses deleted for lack of memory : 0
% 0.18/5.77 % Backward-subsumed : 14
% 0.18/5.77 % Backward-rewritten : 15
% 0.18/5.77 % Generated clauses : 240
% 0.18/5.77 % ...of the previous two non-redundant : 191
% 0.18/5.77 % ...aggressively subsumed : 0
% 0.18/5.77 % Contextual simplify-reflections : 13
% 0.18/5.77 % Paramodulations : 215
% 0.18/5.77 % Factorizations : 0
% 0.18/5.77 % NegExts : 0
% 0.18/5.77 % Equation resolutions : 19
% 0.18/5.77 % Disequality decompositions : 0
% 0.18/5.77 % Total rewrite steps : 215
% 0.18/5.77 % ...of those cached : 199
% 0.18/5.77 % Propositional unsat checks : 0
% 0.18/5.77 % Propositional check models : 0
% 0.18/5.77 % Propositional check unsatisfiable : 0
% 0.18/5.77 % Propositional clauses : 0
% 0.18/5.77 % Propositional clauses after purity: 0
% 0.18/5.77 % Propositional unsat core size : 0
% 0.18/5.77 % Propositional preprocessing time : 0.000
% 0.18/5.77 % Propositional encoding time : 0.000
% 0.18/5.77 % Propositional solver time : 0.000
% 0.18/5.77 % Success case prop preproc time : 0.000
% 0.18/5.77 % Success case prop encoding time : 0.000
% 0.18/5.77 % Success case prop solver time : 0.000
% 0.18/5.77 % Current number of processed clauses : 51
% 0.18/5.77 % Positive orientable unit clauses : 16
% 0.18/5.77 % Positive unorientable unit clauses: 0
% 0.18/5.77 % Negative unit clauses : 4
% 0.18/5.77 % Non-unit-clauses : 31
% 0.18/5.77 % Current number of unprocessed clauses: 117
% 0.18/5.77 % ...number of literals in the above : 582
% 0.18/5.77 % Current number of archived formulas : 0
% 0.18/5.77 % Current number of archived clauses : 36
% 0.18/5.77 % Clause-clause subsumption calls (NU) : 214
% 0.18/5.77 % Rec. Clause-clause subsumption calls : 129
% 0.18/5.77 % Non-unit clause-clause subsumptions : 30
% 0.18/5.77 % Unit Clause-clause subsumption calls : 83
% 0.18/5.77 % Rewrite failures with RHS unbound : 0
% 0.18/5.77 % BW rewrite match attempts : 12
% 0.18/5.77 % BW rewrite match successes : 12
% 0.18/5.77 % Condensation attempts : 0
% 0.18/5.77 % Condensation successes : 0
% 0.18/5.77 % Termbank termtop insertions : 7513
% 0.18/5.77 % Search garbage collected termcells : 1404
% 0.18/5.77
% 0.18/5.77 % -------------------------------------------------
% 0.18/5.77 % User time : 0.017 s
% 0.18/5.77 % System time : 0.006 s
% 0.18/5.77 % Total time : 0.023 s
% 0.18/5.77 % Maximum resident set size: 3760 pages
% 0.18/5.77
% 0.18/5.77 % -------------------------------------------------
% 0.18/5.77 % User time : 0.020 s
% 0.18/5.77 % System time : 0.015 s
% 0.18/5.77 % Total time : 0.035 s
% 0.18/5.77 % Maximum resident set size: 4864 pages
% 0.18/5.77 % E exiting
%------------------------------------------------------------------------------