%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC397+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 : n007.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:44:14 PM UTC 2026
% Result : Theorem 0.14s 0.60s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 58 ( 17 unt; 0 def)
% Number of atoms : 239 ( 50 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 303 ( 122 ~; 116 |; 24 &)
% ( 4 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 77 ( 0 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X7,cons(X6,nil)) != X4
| app(cons(X6,nil),X7) != X3 ) ) ) )
| ( nil = X4
& nil != X3 )
| ! [X5] :
( ssItem(X5)
=> ( memberP(X2,X5)
| ~ memberP(X1,X5) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
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(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X3,X1)
| memberP(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( memberP(X3,X1)
| X1 = X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X7,cons(X6,nil)) != X4
| app(cons(X6,nil),X7) != X3 ) ) ) )
| ( nil = X4
& nil != X3 )
| ! [X5] :
( ssItem(X5)
=> ( memberP(X2,X5)
| ~ memberP(X1,X5) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X7,cons(X6,nil)) != X4
| app(cons(X6,nil),X7) != X3 ) ) ) )
| ( nil = X4
& nil != X3 )
| ! [X5] :
( ssItem(X5)
=> ( memberP(X2,X5)
| ~ memberP(X1,X5) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,negated_conjecture,
( ( ~ neq(esk4_0,nil)
| app(esk7_0,cons(esk6_0,nil)) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(cons(esk6_0,nil),esk7_0) = esk3_0 )
& ( ~ neq(esk4_0,nil)
| ssList(esk7_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk6_0) )
& ( nil != esk4_0
| nil = esk3_0 )
& ~ memberP(esk2_0,esk5_0)
& memberP(esk1_0,esk5_0)
& ssItem(esk5_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_9])])])])]) ).
fof(c_0_11,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_12,negated_conjecture,
memberP(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_15,plain,
! [X66] :
( ~ memberP(nil,X66)
| ~ ssItem(X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_16,negated_conjecture,
memberP(esk3_0,esk5_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( nil != esk4_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X17,X18] :
( ( ~ ssList(X17)
| ~ ssList(X18)
| neq(X17,X18)
| X17 = X18 )
& ( ~ ssList(X17)
| ~ ssList(X18)
| X17 != X18
| ~ neq(X17,X18) ) ),
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_14])])])])]) ).
cnf(c_0_19,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( esk4_0 != nil
| memberP(nil,esk5_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_22,plain,
! [X60,X61,X62] :
( ( ~ ssItem(X60)
| ~ ssList(X61)
| ~ ssList(X62)
| memberP(app(X61,X62),X60)
| ~ memberP(X62,X60) )
& ( ~ ssItem(X60)
| ~ ssList(X61)
| ~ ssList(X62)
| memberP(app(X61,X62),X60)
| ~ memberP(X61,X60) )
& ( ~ ssItem(X60)
| ~ ssList(X61)
| ~ ssList(X62)
| memberP(X62,X60)
| memberP(X61,X60)
| ~ memberP(app(X61,X62),X60) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssList(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
fof(c_0_28,plain,
! [X36,X37] :
( cons(X37,X36) = app(cons(X37,nil),X36)
| ~ ssItem(X37)
| ~ ssList(X36) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssItem(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(esk7_0,cons(esk6_0,nil)) = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk7_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(cons(esk6_0,nil),esk7_0) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,negated_conjecture,
ssItem(esk6_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssItem(X1)
| ~ neq(esk4_0,nil)
| ~ ssList(cons(esk6_0,nil))
| ~ memberP(esk7_0,X1)
| memberP(esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
fof(c_0_37,plain,
! [X44,X45] :
( ssList(cons(X45,X44))
| ~ ssItem(X45)
| ~ ssList(X44) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_38,plain,
! [X63,X64,X65] :
( ( ~ ssItem(X63)
| ~ ssItem(X64)
| ~ ssList(X65)
| memberP(cons(X64,X65),X63)
| ~ memberP(X65,X63) )
& ( ~ ssItem(X63)
| ~ ssItem(X64)
| ~ ssList(X65)
| memberP(cons(X64,X65),X63)
| X63 != X64 )
& ( ~ ssItem(X63)
| ~ ssItem(X64)
| ~ ssList(X65)
| memberP(X65,X63)
| X63 = X64
| ~ memberP(cons(X64,X65),X63) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])]) ).
cnf(c_0_39,negated_conjecture,
( ~ neq(esk4_0,nil)
| cons(esk6_0,esk7_0) = esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32]),c_0_35])]) ).
cnf(c_0_40,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(cons(esk6_0,nil))
| ~ memberP(esk7_0,X1)
| memberP(esk4_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_41,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| memberP(X2,X3)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,negated_conjecture,
cons(esk6_0,esk7_0) = esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk7_0,X1)
| memberP(esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_25]),c_0_35])]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk3_0,X1)
| memberP(esk7_0,X1)
| esk6_0 = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_32]),c_0_35])]) ).
cnf(c_0_46,negated_conjecture,
~ memberP(esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_47,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk3_0,X1)
| memberP(esk4_0,X1)
| esk6_0 = X1 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
~ memberP(esk4_0,esk5_0),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_51,negated_conjecture,
esk6_0 = esk5_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_16]),c_0_21])]),c_0_49]) ).
cnf(c_0_52,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssItem(X1)
| ~ neq(esk4_0,nil)
| ~ ssList(cons(esk5_0,nil))
| ~ memberP(cons(esk5_0,nil),X1)
| memberP(esk4_0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_31]),c_0_32])]),c_0_51]),c_0_51]) ).
cnf(c_0_54,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ ssList(cons(esk5_0,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_21]),c_0_25])]),c_0_49]) ).
cnf(c_0_56,negated_conjecture,
~ ssList(cons(esk5_0,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_41]),c_0_25]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC397+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.10/0.51 % Computer : n007.cluster.edu
% 0.10/0.51 % Model : x86_64 x86_64
% 0.10/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.51 % Memory : 8046.5625MB
% 0.10/0.51 % OS : Linux 6.8.0-71-generic
% 0.10/0.51 % CPULimit : 300
% 0.10/0.51 % WCLimit : 300
% 0.10/0.51 % DateTime : Mon Sep 21 08:19:06 UTC 2026
% 0.10/0.52 % CPUTime :
% 0.10/0.52 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.56 Running first-order theorem proving
% 0.14/0.56 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.14/0.60 % Version: 3.5.1
% 0.14/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.60 % Starting sh5l with 300s (1) cores
% 0.14/0.60 % new_bool_3 with pid 630964 completed with status 0
% 0.14/0.60 % Result found by new_bool_3
% 0.14/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.60 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.60 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.60 % SubtermCWHack with pid 630970 completed with status 0
% 0.14/0.60 % Result found by SubtermCWHack
% 0.14/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.60 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.60 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.60 % Preprocessing time : 0.002 s
% 0.14/0.60
% 0.14/0.60 % Proof found!
% 0.14/0.60 % SZS status Theorem
% 0.14/0.60 % SZS output start CNFRefutation
% See solution above
% 0.14/0.60 % Parsed axioms : 96
% 0.14/0.60 % Removed by relevancy pruning/SinE : 73
% 0.14/0.60 % Initial clauses : 52
% 0.14/0.60 % Removed in clause preprocessing : 0
% 0.14/0.60 % Initial clauses in saturation : 52
% 0.14/0.60 % Processed clauses : 211
% 0.14/0.60 % ...of these trivial : 5
% 0.14/0.60 % ...subsumed : 62
% 0.14/0.60 % ...remaining for further processing : 144
% 0.14/0.60 % Other redundant clauses eliminated : 19
% 0.14/0.60 % Clauses deleted for lack of memory : 0
% 0.14/0.60 % Backward-subsumed : 17
% 0.14/0.60 % Backward-rewritten : 18
% 0.14/0.60 % Generated clauses : 588
% 0.14/0.60 % ...of the previous two non-redundant : 430
% 0.14/0.60 % ...aggressively subsumed : 0
% 0.14/0.60 % Contextual simplify-reflections : 6
% 0.14/0.60 % Paramodulations : 566
% 0.14/0.60 % Factorizations : 0
% 0.14/0.60 % NegExts : 0
% 0.14/0.60 % Equation resolutions : 23
% 0.14/0.60 % Disequality decompositions : 0
% 0.14/0.60 % Total rewrite steps : 618
% 0.14/0.60 % ...of those cached : 599
% 0.14/0.60 % Propositional unsat checks : 0
% 0.14/0.60 % Propositional check models : 0
% 0.14/0.60 % Propositional check unsatisfiable : 0
% 0.14/0.60 % Propositional clauses : 0
% 0.14/0.60 % Propositional clauses after purity: 0
% 0.14/0.60 % Propositional unsat core size : 0
% 0.14/0.60 % Propositional preprocessing time : 0.000
% 0.14/0.60 % Propositional encoding time : 0.000
% 0.14/0.60 % Propositional solver time : 0.000
% 0.14/0.60 % Success case prop preproc time : 0.000
% 0.14/0.60 % Success case prop encoding time : 0.000
% 0.14/0.60 % Success case prop solver time : 0.000
% 0.14/0.60 % Current number of processed clauses : 104
% 0.14/0.60 % Positive orientable unit clauses : 18
% 0.14/0.60 % Positive unorientable unit clauses: 0
% 0.14/0.60 % Negative unit clauses : 9
% 0.14/0.60 % Non-unit-clauses : 77
% 0.14/0.60 % Current number of unprocessed clauses: 262
% 0.14/0.60 % ...number of literals in the above : 1326
% 0.14/0.60 % Current number of archived formulas : 0
% 0.14/0.60 % Current number of archived clauses : 35
% 0.14/0.60 % Clause-clause subsumption calls (NU) : 861
% 0.14/0.60 % Rec. Clause-clause subsumption calls : 419
% 0.14/0.60 % Non-unit clause-clause subsumptions : 59
% 0.14/0.60 % Unit Clause-clause subsumption calls : 306
% 0.14/0.60 % Rewrite failures with RHS unbound : 0
% 0.14/0.60 % BW rewrite match attempts : 9
% 0.14/0.60 % BW rewrite match successes : 9
% 0.14/0.60 % Condensation attempts : 0
% 0.14/0.60 % Condensation successes : 0
% 0.14/0.60 % Termbank termtop insertions : 14263
% 0.14/0.60 % Search garbage collected termcells : 1588
% 0.14/0.60
% 0.14/0.60 % -------------------------------------------------
% 0.14/0.60 % User time : 0.021 s
% 0.14/0.60 % System time : 0.003 s
% 0.14/0.60 % Total time : 0.024 s
% 0.14/0.60 % Maximum resident set size: 3760 pages
% 0.14/0.60
% 0.14/0.60 % -------------------------------------------------
% 0.14/0.60 % User time : 0.025 s
% 0.14/0.60 % System time : 0.008 s
% 0.14/0.60 % Total time : 0.033 s
% 0.14/0.60 % Maximum resident set size: 4864 pages
% 0.14/0.60 % E exiting
%------------------------------------------------------------------------------