TSTP Solution File: SWC316+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC316+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:28:00 EDT 2022
% Result : Theorem 0.36s 24.54s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 60 ( 17 unt; 0 def)
% Number of atoms : 280 ( 95 equ)
% Maximal formula atoms : 52 ( 4 avg)
% Number of connectives : 380 ( 160 ~; 153 |; 42 &)
% ( 1 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn 40 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(cons(X5,nil),X6) != X3
| app(X6,cons(X5,nil)) != X4 ) ) )
| ( ? [X7] :
( ssList(X7)
& X2 = X7
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& tl(X1) = X8
& app(X8,X9) = X7
& ? [X10] :
( ssItem(X10)
& cons(X10,nil) = X9
& hd(X1) = X10
& neq(nil,X1) )
& neq(nil,X1) ) ) )
& neq(X1,nil) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(cons(X5,nil),X6) != X3
| app(X6,cons(X5,nil)) != X4 ) ) )
| ( ? [X7] :
( ssList(X7)
& X2 = X7
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& tl(X1) = X8
& app(X8,X9) = X7
& ? [X10] :
( ssItem(X10)
& cons(X10,nil) = X9
& hd(X1) = X10
& neq(nil,X1) )
& neq(nil,X1) ) ) )
& neq(X1,nil) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_9,negated_conjecture,
! [X17,X18,X19,X20] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ssItem(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_0) )
& ( neq(esk2_0,nil)
| ssList(esk6_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk6_0) )
& ( neq(esk2_0,nil)
| app(cons(esk5_0,nil),esk6_0) = esk3_0 )
& ( ~ neq(esk4_0,nil)
| app(cons(esk5_0,nil),esk6_0) = esk3_0 )
& ( neq(esk2_0,nil)
| app(esk6_0,cons(esk5_0,nil)) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(esk6_0,cons(esk5_0,nil)) = esk4_0 )
& ( neq(esk2_0,nil)
| ~ ssList(X17)
| esk2_0 != X17
| ~ ssList(X18)
| ~ ssList(X19)
| tl(esk1_0) != X18
| app(X18,X19) != X17
| ~ ssItem(X20)
| cons(X20,nil) != X19
| hd(esk1_0) != X20
| ~ neq(nil,esk1_0)
| ~ neq(nil,esk1_0)
| ~ neq(esk1_0,nil) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X17)
| esk2_0 != X17
| ~ ssList(X18)
| ~ ssList(X19)
| tl(esk1_0) != X18
| app(X18,X19) != X17
| ~ ssItem(X20)
| cons(X20,nil) != X19
| hd(esk1_0) != X20
| ~ neq(nil,esk1_0)
| ~ neq(nil,esk1_0)
| ~ neq(esk1_0,nil) ) ),
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_8])])])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ neq(nil,esk1_0)
| ~ neq(nil,esk1_0)
| hd(esk1_0) != X1
| cons(X1,nil) != X2
| ~ ssItem(X1)
| app(X3,X2) != X4
| tl(esk1_0) != X3
| ~ ssList(X2)
| ~ ssList(X3)
| esk2_0 != X4
| ~ ssList(X4)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| hd(cons(X4,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)],[ax23])])])])]) ).
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])])])])]) ).
cnf(c_0_14,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk3_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( esk2_0 != X4
| hd(esk1_0) != X1
| tl(esk1_0) != X3
| app(X3,X2) != X4
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ neq(nil,esk1_0)
| ~ neq(esk1_0,nil)
| ~ neq(esk4_0,nil) ),
inference(cn,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk1_0
| neq(esk2_0,nil) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( ssList(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( cons(X1,nil) != X2
| hd(esk1_0) != X1
| tl(esk1_0) != X3
| app(X3,X2) != X4
| esk2_0 != X4
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ neq(nil,esk1_0)
| ~ neq(esk1_0,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_27,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk2_0
| neq(esk2_0,nil) ),
inference(rw,[status(thm)],[c_0_19,c_0_17]) ).
fof(c_0_29,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| tl(cons(X4,X3)) = 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)],[ax25])])])])]) ).
cnf(c_0_30,plain,
( hd(app(cons(X1,nil),X2)) = X1
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(pm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_31,negated_conjecture,
app(cons(esk5_0,nil),esk6_0) = esk1_0,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_15]),c_0_17]),c_0_23]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_17]),c_0_18])]) ).
cnf(c_0_33,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_17]),c_0_18])]) ).
cnf(c_0_34,negated_conjecture,
( app(X1,cons(X2,nil)) != X3
| hd(esk1_0) != X2
| tl(esk1_0) != X1
| esk2_0 != X3
| ~ ssList(cons(X2,nil))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ neq(nil,esk1_0)
| ~ neq(esk1_0,nil)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
app(esk6_0,cons(esk5_0,nil)) = esk2_0,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_17]),c_0_17]),c_0_28]) ).
cnf(c_0_36,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,negated_conjecture,
esk5_0 = hd(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_38,negated_conjecture,
( esk5_0 != hd(esk1_0)
| esk6_0 != tl(esk1_0)
| esk2_0 != X1
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(X1)
| ~ neq(nil,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_32]),c_0_33])]) ).
cnf(c_0_39,plain,
( tl(app(cons(X1,nil),X2)) = X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(pm,[status(thm)],[c_0_36,c_0_21]) ).
cnf(c_0_40,negated_conjecture,
app(cons(hd(esk1_0),nil),esk6_0) = esk1_0,
inference(rw,[status(thm)],[c_0_31,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
ssItem(hd(esk1_0)),
inference(rw,[status(thm)],[c_0_33,c_0_37]) ).
fof(c_0_42,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_43,negated_conjecture,
( esk6_0 != tl(esk1_0)
| esk2_0 != X1
| ~ ssList(cons(hd(esk1_0),nil))
| ~ ssList(X1)
| ~ neq(nil,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_37]),c_0_37])]) ).
cnf(c_0_44,negated_conjecture,
esk6_0 = tl(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_32]),c_0_41])]) ).
fof(c_0_45,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_46,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( esk2_0 != X1
| ~ ssList(cons(hd(esk1_0),nil))
| ~ ssList(X1)
| ~ neq(nil,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_48,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_50,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(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)],[ax15])])])])])]) ).
cnf(c_0_51,plain,
( app(cons(X1,nil),X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(pm,[status(thm)],[c_0_46,c_0_21]) ).
cnf(c_0_52,negated_conjecture,
( esk2_0 != X1
| ~ ssList(X1)
| ~ neq(nil,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_41])]) ).
cnf(c_0_53,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_54,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_55,negated_conjecture,
esk1_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_56,negated_conjecture,
( esk2_0 != X1
| ~ ssList(X1)
| ~ neq(nil,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_49]),c_0_54])]),c_0_55]) ).
cnf(c_0_57,negated_conjecture,
( esk2_0 != X1
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_53]),c_0_54]),c_0_49])]),c_0_55]) ).
cnf(c_0_58,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_57,c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC316+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n027.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 18:38:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/24.54 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.36/24.54
% 0.36/24.54 # Failure: Resource limit exceeded (time)
% 0.36/24.54 # OLD status Res
% 0.36/24.54 # Preprocessing time : 0.025 s
% 0.36/24.54 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.36/24.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.36/24.54 # Preprocessing time : 0.012 s
% 0.36/24.54
% 0.36/24.54 # Proof found!
% 0.36/24.54 # SZS status Theorem
% 0.36/24.54 # SZS output start CNFRefutation
% See solution above
% 0.36/24.54 # Proof object total steps : 60
% 0.36/24.54 # Proof object clause steps : 44
% 0.36/24.54 # Proof object formula steps : 16
% 0.36/24.54 # Proof object conjectures : 37
% 0.36/24.54 # Proof object clause conjectures : 34
% 0.36/24.54 # Proof object formula conjectures : 3
% 0.36/24.54 # Proof object initial clauses used : 19
% 0.36/24.54 # Proof object initial formulas used : 8
% 0.36/24.54 # Proof object generating inferences : 12
% 0.36/24.54 # Proof object simplifying inferences : 49
% 0.36/24.54 # Training examples: 0 positive, 0 negative
% 0.36/24.54 # Parsed axioms : 96
% 0.36/24.54 # Removed by relevancy pruning/SinE : 67
% 0.36/24.54 # Initial clauses : 57
% 0.36/24.54 # Removed in clause preprocessing : 0
% 0.36/24.54 # Initial clauses in saturation : 57
% 0.36/24.54 # Processed clauses : 884
% 0.36/24.54 # ...of these trivial : 45
% 0.36/24.54 # ...subsumed : 492
% 0.36/24.54 # ...remaining for further processing : 347
% 0.36/24.54 # Other redundant clauses eliminated : 12
% 0.36/24.54 # Clauses deleted for lack of memory : 0
% 0.36/24.54 # Backward-subsumed : 51
% 0.36/24.54 # Backward-rewritten : 99
% 0.36/24.54 # Generated clauses : 6164
% 0.36/24.54 # ...of the previous two non-trivial : 5811
% 0.36/24.54 # Contextual simplify-reflections : 290
% 0.36/24.54 # Paramodulations : 6058
% 0.36/24.54 # Factorizations : 0
% 0.36/24.54 # Equation resolutions : 46
% 0.36/24.54 # Current number of processed clauses : 194
% 0.36/24.54 # Positive orientable unit clauses : 14
% 0.36/24.54 # Positive unorientable unit clauses: 0
% 0.36/24.54 # Negative unit clauses : 9
% 0.36/24.54 # Non-unit-clauses : 171
% 0.36/24.54 # Current number of unprocessed clauses: 2607
% 0.36/24.54 # ...number of literals in the above : 16100
% 0.36/24.54 # Current number of archived formulas : 0
% 0.36/24.54 # Current number of archived clauses : 150
% 0.36/24.54 # Clause-clause subsumption calls (NU) : 17538
% 0.36/24.54 # Rec. Clause-clause subsumption calls : 5369
% 0.36/24.54 # Non-unit clause-clause subsumptions : 706
% 0.36/24.54 # Unit Clause-clause subsumption calls : 485
% 0.36/24.54 # Rewrite failures with RHS unbound : 0
% 0.36/24.54 # BW rewrite match attempts : 6
% 0.36/24.54 # BW rewrite match successes : 6
% 0.36/24.54 # Condensation attempts : 0
% 0.36/24.54 # Condensation successes : 0
% 0.36/24.54 # Termbank termtop insertions : 103022
% 0.36/24.54
% 0.36/24.54 # -------------------------------------------------
% 0.36/24.54 # User time : 0.240 s
% 0.36/24.54 # System time : 0.003 s
% 0.36/24.54 # Total time : 0.243 s
% 0.36/24.54 # Maximum resident set size: 6096 pages
%------------------------------------------------------------------------------