TSTP Solution File: SWC045+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC045+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 20:26:20 EDT 2022
% Result : Theorem 0.33s 23.52s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 70 ( 11 unt; 0 def)
% Number of atoms : 269 ( 75 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 338 ( 139 ~; 139 |; 28 &)
% ( 3 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 50 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ? [X6] :
( ssList(X6)
& segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) ) )
| ( ! [X6] :
( ssList(X6)
=> ~ segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) )
& memberP(X3,X5) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ? [X6] :
( ssList(X6)
& segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) ) )
| ( ! [X6] :
( ssList(X6)
=> ~ segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) )
& memberP(X3,X5) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])])]) ).
fof(c_0_14,negated_conjecture,
! [X11,X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& nil = esk2_0
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& nil != esk1_0
& ( memberP(esk3_0,X11)
| ~ ssList(X12)
| ~ segmentP(esk4_0,app(app(cons(X11,nil),X12),cons(X11,nil)))
| ~ ssItem(X11) )
& ( ssList(esk5_1(X11))
| ~ memberP(esk3_0,X11)
| ~ ssItem(X11) )
& ( segmentP(esk4_0,app(app(cons(X11,nil),esk5_1(X11)),cons(X11,nil)))
| ~ memberP(esk3_0,X11)
| ~ ssItem(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])])])])])])]) ).
fof(c_0_15,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_16,plain,
! [X2] :
( ( ~ segmentP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| segmentP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| ssList(cons(X4,X3)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])])]) ).
cnf(c_0_18,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
nil = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])])]) ).
cnf(c_0_21,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_23,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| nil != cons(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])])])]) ).
cnf(c_0_24,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( segmentP(esk4_0,app(app(cons(X1,nil),esk5_1(X1)),cons(X1,nil)))
| ~ ssItem(X1)
| ~ memberP(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_28,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
( cons(X1,X2) = app(cons(X1,esk2_0),X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_30,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
( app(X1,esk2_0) = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_32,plain,
ssList(esk2_0),
inference(rw,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_33,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_34,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])])]) ).
cnf(c_0_35,plain,
( esk2_0 = X1
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_19]),c_0_19]) ).
cnf(c_0_36,negated_conjecture,
( segmentP(esk2_0,app(app(cons(X1,esk2_0),esk5_1(X1)),cons(X1,esk2_0)))
| ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_19]),c_0_19]),c_0_27]) ).
fof(c_0_37,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ssList(app(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])])]) ).
cnf(c_0_38,plain,
( ssList(app(cons(X1,esk2_0),X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,plain,
( app(cons(X1,X2),esk2_0) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_40,plain,
( cons(X1,X2) != esk2_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_33,c_0_19]) ).
cnf(c_0_41,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( app(app(cons(X1,esk2_0),esk5_1(X1)),cons(X1,esk2_0)) = esk2_0
| ~ memberP(esk1_0,X1)
| ~ ssList(app(app(cons(X1,esk2_0),esk5_1(X1)),cons(X1,esk2_0)))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
( ssList(cons(X1,esk2_0))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32])]) ).
cnf(c_0_45,plain,
( app(cons(X1,esk2_0),X2) != esk2_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
fof(c_0_46,plain,
! [X4,X5,X6] :
( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( X4 != X5
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])])]) ).
fof(c_0_47,plain,
! [X4] :
( ( ssList(esk10_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( ssItem(esk11_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( cons(esk11_1(X4),esk10_1(X4)) = X4
| nil = X4
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])])]) ).
cnf(c_0_48,plain,
( esk2_0 = X1
| app(X2,X1) != esk2_0
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_19]),c_0_19]) ).
cnf(c_0_49,negated_conjecture,
( app(app(cons(X1,esk2_0),esk5_1(X1)),cons(X1,esk2_0)) = esk2_0
| ~ memberP(esk1_0,X1)
| ~ ssList(app(cons(X1,esk2_0),esk5_1(X1)))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_50,plain,
( cons(X1,esk2_0) != esk2_0
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_39]),c_0_32])]) ).
cnf(c_0_51,negated_conjecture,
( ssList(esk5_1(X1))
| ~ ssItem(X1)
| ~ memberP(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_52,plain,
( memberP(cons(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
( nil = X1
| cons(esk11_1(X1),esk10_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,plain,
( nil = X1
| ssItem(esk11_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
( nil = X1
| ssList(esk10_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,negated_conjecture,
( ~ memberP(esk1_0,X1)
| ~ ssList(app(cons(X1,esk2_0),esk5_1(X1)))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_44]),c_0_50]) ).
cnf(c_0_57,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_30]),c_0_43]) ).
cnf(c_0_58,negated_conjecture,
( ssList(esk5_1(X1))
| ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_51,c_0_27]) ).
cnf(c_0_59,plain,
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_60,plain,
( cons(esk11_1(X1),esk10_1(X1)) = X1
| esk2_0 = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_53,c_0_19]) ).
cnf(c_0_61,plain,
( esk2_0 = X1
| ssItem(esk11_1(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_54,c_0_19]) ).
cnf(c_0_62,plain,
( esk2_0 = X1
| ssList(esk10_1(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_55,c_0_19]) ).
cnf(c_0_63,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_64,negated_conjecture,
( ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_32])]),c_0_58]) ).
cnf(c_0_65,plain,
( esk2_0 = X1
| memberP(X1,esk11_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62]) ).
cnf(c_0_66,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_67,negated_conjecture,
esk2_0 != esk1_0,
inference(rw,[status(thm)],[c_0_63,c_0_19]) ).
cnf(c_0_68,negated_conjecture,
~ ssItem(esk11_1(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]),c_0_67]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_61]),c_0_66])]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC045+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 12:34:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.33/23.40 eprover: CPU time limit exceeded, terminating
% 0.33/23.41 eprover: CPU time limit exceeded, terminating
% 0.33/23.41 eprover: CPU time limit exceeded, terminating
% 0.33/23.52 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.33/23.52 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.33/23.52 # Preprocessing time : 0.020 s
% 0.33/23.52
% 0.33/23.52 # Proof found!
% 0.33/23.52 # SZS status Theorem
% 0.33/23.52 # SZS output start CNFRefutation
% See solution above
% 0.33/23.52 # Proof object total steps : 70
% 0.33/23.52 # Proof object clause steps : 46
% 0.33/23.52 # Proof object formula steps : 24
% 0.33/23.52 # Proof object conjectures : 19
% 0.33/23.52 # Proof object clause conjectures : 16
% 0.33/23.52 # Proof object formula conjectures : 3
% 0.33/23.52 # Proof object initial clauses used : 20
% 0.33/23.52 # Proof object initial formulas used : 12
% 0.33/23.52 # Proof object generating inferences : 13
% 0.33/23.52 # Proof object simplifying inferences : 39
% 0.33/23.52 # Training examples: 0 positive, 0 negative
% 0.33/23.52 # Parsed axioms : 96
% 0.33/23.52 # Removed by relevancy pruning/SinE : 68
% 0.33/23.52 # Initial clauses : 56
% 0.33/23.52 # Removed in clause preprocessing : 0
% 0.33/23.52 # Initial clauses in saturation : 56
% 0.33/23.52 # Processed clauses : 14713
% 0.33/23.52 # ...of these trivial : 258
% 0.33/23.52 # ...subsumed : 12707
% 0.33/23.52 # ...remaining for further processing : 1748
% 0.33/23.52 # Other redundant clauses eliminated : 1340
% 0.33/23.52 # Clauses deleted for lack of memory : 531880
% 0.33/23.52 # Backward-subsumed : 78
% 0.33/23.52 # Backward-rewritten : 6
% 0.33/23.52 # Generated clauses : 688649
% 0.33/23.52 # ...of the previous two non-trivial : 652024
% 0.33/23.52 # Contextual simplify-reflections : 8315
% 0.33/23.52 # Paramodulations : 687065
% 0.33/23.52 # Factorizations : 0
% 0.33/23.52 # Equation resolutions : 1584
% 0.33/23.52 # Current number of processed clauses : 1663
% 0.33/23.52 # Positive orientable unit clauses : 11
% 0.33/23.52 # Positive unorientable unit clauses: 0
% 0.33/23.52 # Negative unit clauses : 3
% 0.33/23.52 # Non-unit-clauses : 1649
% 0.33/23.52 # Current number of unprocessed clauses: 98877
% 0.33/23.52 # ...number of literals in the above : 518868
% 0.33/23.52 # Current number of archived formulas : 0
% 0.33/23.52 # Current number of archived clauses : 84
% 0.33/23.52 # Clause-clause subsumption calls (NU) : 1406224
% 0.33/23.52 # Rec. Clause-clause subsumption calls : 380507
% 0.33/23.52 # Non-unit clause-clause subsumptions : 21096
% 0.33/23.52 # Unit Clause-clause subsumption calls : 2659
% 0.33/23.52 # Rewrite failures with RHS unbound : 0
% 0.33/23.52 # BW rewrite match attempts : 4
% 0.33/23.52 # BW rewrite match successes : 4
% 0.33/23.52 # Condensation attempts : 0
% 0.33/23.52 # Condensation successes : 0
% 0.33/23.52 # Termbank termtop insertions : 16633854
% 0.33/23.52
% 0.33/23.52 # -------------------------------------------------
% 0.33/23.52 # User time : 22.462 s
% 0.33/23.52 # System time : 0.143 s
% 0.33/23.52 # Total time : 22.605 s
% 0.33/23.52 # Maximum resident set size: 133784 pages
%------------------------------------------------------------------------------