TSTP Solution File: CSR133^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR133^2 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 May 20 19:16:38 EDT 2024
% Result : Theorem 0.23s 0.51s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 48 ( 12 unt; 9 typ; 0 def)
% Number of atoms : 128 ( 16 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 370 ( 53 ~; 51 |; 22 &; 242 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 37 ( 37 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 30 ( 0 ^ 24 !; 6 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_28,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_33,type,
lAnna_THFTYPE_i: $i ).
thf(decl_37,type,
lBill_THFTYPE_i: $i ).
thf(decl_39,type,
lBob_THFTYPE_i: $i ).
thf(decl_46,type,
lSue_THFTYPE_i: $i ).
thf(decl_53,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_54,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_58,type,
n2009_THFTYPE_i: $i ).
thf(decl_60,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(con,conjecture,
? [X36: $i > $i > $o,X37: $i > $i > $o,X2: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X37 @ X2 @ lBill_THFTYPE_i )
& ( X36 @ X2 @ lAnna_THFTYPE_i )
& ( X37 != X36 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(ax_014,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_014) ).
thf(ax_009,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_009) ).
thf(ax_003,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_003) ).
thf(ax_019,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_019) ).
thf(c_0_5,negated_conjecture,
~ ? [X36: $i > $i > $o,X37: $i > $i > $o,X2: $i] :
( ( ~ ( ( X37 @ X2 @ lBill_THFTYPE_i )
& ( X36 @ X2 @ lAnna_THFTYPE_i )
& ( X37 != X36 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X37 @ X2 @ lBill_THFTYPE_i )
& ( X36 @ X2 @ lAnna_THFTYPE_i )
& ( X37 != X36 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])])]) ).
thf(c_0_6,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_014]) ).
thf(c_0_7,negated_conjecture,
! [X43: $i > $i > $o,X44: $i > $i > $o,X45: $i] :
( ( ~ ( X44 @ X45 @ lBill_THFTYPE_i )
| ~ ( X43 @ X45 @ lAnna_THFTYPE_i )
| ( X44 = X43 )
| ( X44 @ X45 @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X44 @ X45 @ lBill_THFTYPE_i ) )
& ( ~ ( X44 @ X45 @ lBill_THFTYPE_i )
| ~ ( X43 @ X45 @ lAnna_THFTYPE_i )
| ( X44 = X43 )
| ( X43 @ X45 @ lAnna_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X43 @ X45 @ lAnna_THFTYPE_i ) )
& ( ~ ( X44 @ X45 @ lBill_THFTYPE_i )
| ~ ( X43 @ X45 @ lAnna_THFTYPE_i )
| ( X44 = X43 )
| ( X44 != X43 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X44 != X43 ) )
& ( ~ ( X44 @ X45 @ lBill_THFTYPE_i )
| ~ ( X43 @ X45 @ lAnna_THFTYPE_i )
| ( X44 = X43 )
| ~ ( 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
thf(c_0_8,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X36: $i > $i > $o,X37: $i > $i > $o] :
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ( X36 != X37 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
( ( likes_THFTYPE_IiioI @ lBob_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_11,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(er,[status(thm)],[c_0_9]) ).
thf(c_0_12,axiom,
( ( ~ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_009]) ).
thf(c_0_13,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,plain,
likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,plain,
( ( ~ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
thf(c_0_16,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_003]) ).
thf(c_0_17,negated_conjecture,
! [X37: $i > $i > $o,X36: $i > $i > $o,X1: $i] :
( ( X36 = X37 )
| ~ ( X36 @ X1 @ lBill_THFTYPE_i )
| ~ ( X37 @ X1 @ lAnna_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_18,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
thf(c_0_19,plain,
( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_20,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_16]) ).
thf(c_0_21,negated_conjecture,
! [X37: $i > $i > $o,X36: $i > $i > $o,X1: $i] :
( ( X36 = X37 )
| ~ ( X37 @ X1 @ lAnna_THFTYPE_i )
| ~ ( X36 @ X1 @ lBill_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
thf(c_0_22,plain,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
inference(sr,[status(thm)],[c_0_19,c_0_11]) ).
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_20]) ).
thf(c_0_24,negated_conjecture,
! [X36: $i > $i > $o] :
( ( X36 = parent_THFTYPE_IiioI )
| ~ ( X36 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_25,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(sr,[status(thm)],[c_0_23,c_0_11]) ).
thf(c_0_26,negated_conjecture,
likes_THFTYPE_IiioI = parent_THFTYPE_IiioI,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_27,negated_conjecture,
! [X50: $i,X51: $i,X36: $i > $i > $o] :
( ( ( X36 @ X50 @ X51 )
<=> ( parent_THFTYPE_IiioI @ X50 @ X51 ) )
| ~ ( X36 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(arg_cong,[status(thm)],[c_0_24]) ).
thf(c_0_28,plain,
( ( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_019])]) ).
thf(c_0_29,negated_conjecture,
! [X52: $i,X53: $i] :
( ( likes_THFTYPE_IiioI @ X52 @ X53 )
<=> ( parent_THFTYPE_IiioI @ X52 @ X53 ) ),
inference(arg_cong,[status(thm)],[c_0_26]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i,X36: $i > $i > $o,X2: $i] :
( ( X36 @ X1 @ X2 )
| ~ ( X36 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( parent_THFTYPE_IiioI @ X1 @ X2 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_27]) ).
thf(c_0_31,plain,
( ( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_28]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i,X2: $i] :
( ( parent_THFTYPE_IiioI @ X1 @ X2 )
| ~ ( likes_THFTYPE_IiioI @ X1 @ X2 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_29]) ).
thf(c_0_33,negated_conjecture,
! [X2: $i,X1: $i] :
( ( lBill_THFTYPE_i = X1 )
| ~ ( parent_THFTYPE_IiioI @ X2 @ X1 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_30]) ).
thf(c_0_34,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_35,negated_conjecture,
parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
inference(spm,[status(thm)],[c_0_32,c_0_14]) ).
thf(c_0_36,negated_conjecture,
lBill_THFTYPE_i = lAnna_THFTYPE_i,
inference(spm,[status(thm)],[c_0_33,c_0_22]) ).
thf(c_0_37,plain,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
inference(sr,[status(thm)],[c_0_34,c_0_11]) ).
thf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR133^2 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n028.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun May 19 02:18:08 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.23/0.49 Running higher-order theorem proving
% 0.23/0.49 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/benchmark/theBenchmark.p
% 0.23/0.51 # Version: 3.1.0-ho
% 0.23/0.51 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.23/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 # Starting new_ho_10_unif with 1500s (5) cores
% 0.23/0.51 # Starting sh3l with 300s (1) cores
% 0.23/0.51 # Starting new_ho_6 with 300s (1) cores
% 0.23/0.51 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.23/0.51 # sh3l with pid 18134 completed with status 0
% 0.23/0.51 # Result found by sh3l
% 0.23/0.51 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.23/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 # Starting new_ho_10_unif with 1500s (5) cores
% 0.23/0.51 # Starting sh3l with 300s (1) cores
% 0.23/0.51 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.23/0.51 # Search class: HGHSF-FFMM11-SSSFFFBN
% 0.23/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.51 # Starting ho_unfolding_3 with 163s (1) cores
% 0.23/0.51 # ho_unfolding_3 with pid 18137 completed with status 0
% 0.23/0.51 # Result found by ho_unfolding_3
% 0.23/0.51 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.23/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 # Starting new_ho_10_unif with 1500s (5) cores
% 0.23/0.51 # Starting sh3l with 300s (1) cores
% 0.23/0.51 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.23/0.51 # Search class: HGHSF-FFMM11-SSSFFFBN
% 0.23/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.51 # Starting ho_unfolding_3 with 163s (1) cores
% 0.23/0.51 # Preprocessing time : 0.003 s
% 0.23/0.51 # Presaturation interreduction done
% 0.23/0.51
% 0.23/0.51 # Proof found!
% 0.23/0.51 # SZS status Theorem
% 0.23/0.51 # SZS output start CNFRefutation
% See solution above
% 0.23/0.51 # Parsed axioms : 128
% 0.23/0.51 # Removed by relevancy pruning/SinE : 106
% 0.23/0.51 # Initial clauses : 52
% 0.23/0.51 # Removed in clause preprocessing : 4
% 0.23/0.51 # Initial clauses in saturation : 48
% 0.23/0.51 # Processed clauses : 92
% 0.23/0.51 # ...of these trivial : 16
% 0.23/0.51 # ...subsumed : 21
% 0.23/0.51 # ...remaining for further processing : 55
% 0.23/0.51 # Other redundant clauses eliminated : 1
% 0.23/0.51 # Clauses deleted for lack of memory : 0
% 0.23/0.51 # Backward-subsumed : 0
% 0.23/0.51 # Backward-rewritten : 20
% 0.23/0.51 # Generated clauses : 57
% 0.23/0.51 # ...of the previous two non-redundant : 48
% 0.23/0.51 # ...aggressively subsumed : 0
% 0.23/0.51 # Contextual simplify-reflections : 0
% 0.23/0.51 # Paramodulations : 26
% 0.23/0.51 # Factorizations : 0
% 0.23/0.51 # NegExts : 0
% 0.23/0.51 # Equation resolutions : 1
% 0.23/0.51 # Disequality decompositions : 0
% 0.23/0.51 # Total rewrite steps : 41
% 0.23/0.51 # ...of those cached : 28
% 0.23/0.51 # Propositional unsat checks : 0
% 0.23/0.51 # Propositional check models : 0
% 0.23/0.51 # Propositional check unsatisfiable : 0
% 0.23/0.51 # Propositional clauses : 0
% 0.23/0.51 # Propositional clauses after purity: 0
% 0.23/0.51 # Propositional unsat core size : 0
% 0.23/0.51 # Propositional preprocessing time : 0.000
% 0.23/0.51 # Propositional encoding time : 0.000
% 0.23/0.51 # Propositional solver time : 0.000
% 0.23/0.51 # Success case prop preproc time : 0.000
% 0.23/0.51 # Success case prop encoding time : 0.000
% 0.23/0.51 # Success case prop solver time : 0.000
% 0.23/0.51 # Current number of processed clauses : 16
% 0.23/0.51 # Positive orientable unit clauses : 8
% 0.23/0.51 # Positive unorientable unit clauses: 0
% 0.23/0.51 # Negative unit clauses : 5
% 0.23/0.51 # Non-unit-clauses : 3
% 0.23/0.51 # Current number of unprocessed clauses: 16
% 0.23/0.51 # ...number of literals in the above : 36
% 0.23/0.51 # Current number of archived formulas : 0
% 0.23/0.51 # Current number of archived clauses : 38
% 0.23/0.51 # Clause-clause subsumption calls (NU) : 57
% 0.23/0.51 # Rec. Clause-clause subsumption calls : 49
% 0.23/0.51 # Non-unit clause-clause subsumptions : 17
% 0.23/0.51 # Unit Clause-clause subsumption calls : 1
% 0.23/0.51 # Rewrite failures with RHS unbound : 0
% 0.23/0.51 # BW rewrite match attempts : 4
% 0.23/0.51 # BW rewrite match successes : 3
% 0.23/0.51 # Condensation attempts : 92
% 0.23/0.51 # Condensation successes : 1
% 0.23/0.51 # Termbank termtop insertions : 4644
% 0.23/0.51 # Search garbage collected termcells : 512
% 0.23/0.51
% 0.23/0.51 # -------------------------------------------------
% 0.23/0.51 # User time : 0.008 s
% 0.23/0.51 # System time : 0.004 s
% 0.23/0.51 # Total time : 0.012 s
% 0.23/0.51 # Maximum resident set size: 1896 pages
% 0.23/0.51
% 0.23/0.51 # -------------------------------------------------
% 0.23/0.51 # User time : 0.013 s
% 0.23/0.51 # System time : 0.005 s
% 0.23/0.51 # Total time : 0.017 s
% 0.23/0.51 # Maximum resident set size: 1824 pages
% 0.23/0.51 % E---3.1 exiting
% 0.23/0.51 % E exiting
%------------------------------------------------------------------------------