TSTP Solution File: CSR130^1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : CSR130^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : 300s
% DateTime : Mon Jun 24 05:07:23 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 38 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 96 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 344 ( 46 ~; 44 |; 20 &; 234 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 21 ( 0 ^ 19 !; 2 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_25,type,
lBill_THFTYPE_i: $i ).
thf(decl_27,type,
lMary_THFTYPE_i: $i ).
thf(decl_28,type,
lSue_THFTYPE_i: $i ).
thf(decl_29,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_30,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_31,type,
n2009_THFTYPE_i: $i ).
thf(decl_33,type,
esk1_1: ( $i > $i > $o ) > $i ).
thf(decl_34,type,
esk2_1: ( $i > $i > $o ) > $i ).
thf(ax_007,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
file('/export/starexec/sandbox2/tmp/tmp.BlbD0I2cFT/E---3.1_9353.p',ax_007) ).
thf(con,conjecture,
? [X1: $i > $i > $o] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BlbD0I2cFT/E---3.1_9353.p',con) ).
thf(ax_002,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.BlbD0I2cFT/E---3.1_9353.p',ax_002) ).
thf(ax_004,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.BlbD0I2cFT/E---3.1_9353.p',ax_004) ).
thf(c_0_4,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_007])]) ).
thf(c_0_5,negated_conjecture,
~ ? [X1: $i > $i > $o] :
( ( ~ ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_6,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_002]) ).
thf(c_0_8,negated_conjecture,
! [X5: $i > $i > $o,X8: $i,X9: $i] :
( ( ~ ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X5 @ X8 @ X9 )
| ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X5 @ X8 @ X9 )
| ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X5 @ X8 @ X9 )
| ~ ( X5 @ ( esk1_1 @ X5 ) @ ( esk2_1 @ X5 ) ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( X5 @ ( esk1_1 @ X5 ) @ ( esk2_1 @ X5 ) ) )
& ( ~ ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X5 @ X8 @ X9 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
thf(c_0_9,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_004]) ).
thf(c_0_15,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i > $i > $o] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_19,negated_conjecture,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_20,negated_conjecture,
! [X3: $i,X2: $i,X1: $i > $i > $o] :
( ( X1 @ X2 @ X3 )
| ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_21,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_22,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
thf(c_0_23,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i,X2: $i,X1: $i > $i > $o] :
( ( X1 @ X2 @ X3 )
| ~ ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19])]) ).
thf(c_0_25,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(sr,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_26,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(sr,[status(thm)],[c_0_23,c_0_22]) ).
thf(c_0_27,negated_conjecture,
! [X2: $i,X3: $i] : ( likes_THFTYPE_IiioI @ X2 @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
thf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_27])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR130^1 : TPTP v8.2.0. Released v4.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n024.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 : 300
% 0.12/0.33 % DateTime : Wed Jun 19 20:55:38 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.BlbD0I2cFT/E---3.1_9353.p
% 0.21/0.49 # Version: 3.2.0-ho
% 0.21/0.49 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_11 with 1500s (5) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # Starting new_ho_9 with 300s (1) cores
% 0.21/0.49 # Starting ho_unfolding_4 with 300s (1) cores
% 0.21/0.49 # new_ho_11 with pid 9431 completed with status 0
% 0.21/0.49 # Result found by new_ho_11
% 0.21/0.49 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_11 with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: HGHNF-FFSM11-SSSFFSBN
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.49 # Starting new_ho_11 with 151s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.49 # Starting new_bool_2 with 136s (1) cores
% 0.21/0.49 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.21/0.49 # new_ho_11 with pid 9438 completed with status 0
% 0.21/0.49 # Result found by new_ho_11
% 0.21/0.49 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_11 with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: HGHNF-FFSM11-SSSFFSBN
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.49 # Starting new_ho_11 with 151s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 21
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 36
% 0.21/0.49 # Removed in clause preprocessing : 14
% 0.21/0.49 # Initial clauses in saturation : 22
% 0.21/0.49 # Processed clauses : 61
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 4
% 0.21/0.49 # ...remaining for further processing : 57
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 5
% 0.21/0.49 # Backward-rewritten : 15
% 0.21/0.49 # Generated clauses : 22
% 0.21/0.49 # ...of the previous two non-redundant : 22
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 15
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 16
% 0.21/0.49 # ...of those cached : 10
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 8
% 0.21/0.49 # Positive orientable unit clauses : 6
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 1
% 0.21/0.49 # Non-unit-clauses : 1
% 0.21/0.49 # Current number of unprocessed clauses: 0
% 0.21/0.49 # ...number of literals in the above : 0
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 49
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 102
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 70
% 0.21/0.49 # Non-unit clause-clause subsumptions : 5
% 0.21/0.49 # Unit Clause-clause subsumption calls : 12
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 5
% 0.21/0.49 # BW rewrite match successes : 5
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 1904
% 0.21/0.49 # Search garbage collected termcells : 136
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.005 s
% 0.21/0.49 # System time : 0.003 s
% 0.21/0.49 # Total time : 0.007 s
% 0.21/0.49 # Maximum resident set size: 1832 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.018 s
% 0.21/0.49 # System time : 0.007 s
% 0.21/0.49 # Total time : 0.025 s
% 0.21/0.49 # Maximum resident set size: 1724 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------