%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL878^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 : Wed Sep 30 08:12:50 AM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 135 ( 13 equ; 0 cnn)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 418 ( 49 ~; 82 |; 7 &; 274 @)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 53 ( 53 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 101 ( 32 ^; 69 !; 0 ?; 101 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_25,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_38,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
epred1_0: $i > $i > $o ).
thf(decl_55,type,
epred2_0: $i > $i > $o ).
thf(decl_56,type,
esk1_0: $i ).
thf(decl_57,type,
epred3_0: $i > $o ).
thf(decl_58,type,
esk2_0: $i ).
thf(decl_59,type,
esk3_0: $i ).
thf(decl_60,type,
esk4_0: $i ).
thf(decl_61,type,
esk5_2: $i > ( $i > $o ) > $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.F3J5rzvM4R/E---3.1_157952.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.F3J5rzvM4R/E---3.1_157952.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.F3J5rzvM4R/E---3.1_157952.p',mor) ).
thf(conj,conjecture,
! [X18: $i > $i > $o,X19: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X6: $i > $o] : ( mimplies @ ( mbox @ X18 @ X6 ) @ ( mbox @ X19 @ X6 ) ) ) )
<=> ! [X17: $i,X14: $i] :
( ( X19 @ X17 @ X14 )
=> ( X18 @ X17 @ X14 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.F3J5rzvM4R/E---3.1_157952.p',conj) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.F3J5rzvM4R/E---3.1_157952.p',mbox) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.F3J5rzvM4R/E---3.1_157952.p',mforall_prop) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.F3J5rzvM4R/E---3.1_157952.p',mvalid) ).
thf(c_0_7,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_8,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_9,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_10,negated_conjecture,
~ ! [X18: $i > $i > $o,X19: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X6: $i > $o] : ( mimplies @ ( mbox @ X18 @ X6 ) @ ( mbox @ X19 @ X6 ) ) ) )
<=> ! [X17: $i,X14: $i] :
( ( X19 @ X17 @ X14 )
=> ( X18 @ X17 @ X14 ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_11,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_12,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_13,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_14,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_15,negated_conjecture,
~ ! [X18: $i > $i > $o,X19: $i > $i > $o] :
( ! [X27: $i,X26: $i > $o] :
( ~ ! [X24: $i] :
( ~ ( X18 @ X27 @ X24 )
| ( X26 @ X24 ) )
| ! [X25: $i] :
( ~ ( X19 @ X27 @ X25 )
| ( X26 @ X25 ) ) )
<=> ! [X17: $i,X14: $i] :
( ( X19 @ X17 @ X14 )
=> ( X18 @ X17 @ X14 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).
thf(c_0_16,negated_conjecture,
! [X32: $i,X36: $i,X37: $i > $o,X39: $i,X40: $i,X41: $i] :
( ( ( epred2_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X32 )
| ( epred3_0 @ X32 ) )
& ( ~ ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X32 )
| ( epred3_0 @ X32 ) )
& ( ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk3_0 @ esk4_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 ) )
& ( ( epred2_0 @ esk3_0 @ esk4_0 )
| ~ ( epred3_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred3_0 @ esk2_0 ) )
& ( ( epred1_0 @ X36 @ ( esk5_2 @ X36 @ X37 ) )
| ~ ( epred2_0 @ X36 @ X39 )
| ( X37 @ X39 )
| ~ ( epred2_0 @ X40 @ X41 )
| ( epred1_0 @ X40 @ X41 ) )
& ( ~ ( X37 @ ( esk5_2 @ X36 @ X37 ) )
| ~ ( epred2_0 @ X36 @ X39 )
| ( X37 @ X39 )
| ~ ( epred2_0 @ X40 @ X41 )
| ( epred1_0 @ X40 @ X41 ) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])]) ).
thf(c_0_17,negated_conjecture,
! [X15: $i,X3: $i,X4: $i > $o,X14: $i,X16: $i] :
( ( epred1_0 @ X3 @ ( esk5_2 @ X3 @ X4 ) )
| ( X4 @ X14 )
| ( epred1_0 @ X15 @ X16 )
| ~ ( epred2_0 @ X3 @ X14 )
| ~ ( epred2_0 @ X15 @ X16 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_18,negated_conjecture,
( ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( epred1_0 @ esk1_0 @ ( esk5_2 @ esk1_0 @ X4 ) )
| ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ X3 @ X14 )
| ( X4 @ esk2_0 )
| ~ ( epred2_0 @ X3 @ X14 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_20,negated_conjecture,
! [X15: $i,X3: $i,X4: $i > $o,X14: $i,X16: $i] :
( ( X4 @ X14 )
| ( epred1_0 @ X15 @ X16 )
| ~ ( X4 @ ( esk5_2 @ X3 @ X4 ) )
| ~ ( epred2_0 @ X3 @ X14 )
| ~ ( epred2_0 @ X15 @ X16 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_21,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0 @ esk1_0 @ ( esk5_2 @ esk1_0 @ X4 ) )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( epred2_0 @ esk3_0 @ esk4_0 )
| ( X4 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
thf(c_0_22,negated_conjecture,
! [X3: $i,X14: $i,X15: $i] :
( ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 @ X3 )
| ( epred1_0 @ X14 @ X15 )
| ~ ( epred2_0 @ esk1_0 @ X3 )
| ~ ( epred2_0 @ X14 @ X15 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_23,negated_conjecture,
! [X3: $i,X14: $i] :
( ( epred1_0 @ esk1_0 @ esk2_0 )
| ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ X3 @ X14 )
| ~ ( epred2_0 @ X3 @ X14 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i] :
( ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred3_0 @ X3 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_25,negated_conjecture,
( ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
thf(c_0_26,negated_conjecture,
( ( epred2_0 @ esk3_0 @ esk4_0 )
| ~ ( epred3_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_27,negated_conjecture,
epred2_0 @ esk3_0 @ esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
thf(c_0_28,negated_conjecture,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( epred1_0 @ esk3_0 @ ( esk5_2 @ esk3_0 @ X4 ) )
| ( epred1_0 @ X3 @ X14 )
| ( X4 @ esk4_0 )
| ~ ( epred2_0 @ X3 @ X14 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
thf(c_0_29,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0 @ esk3_0 @ ( esk5_2 @ esk3_0 @ X4 ) )
| ( epred1_0 @ esk3_0 @ esk4_0 )
| ( X4 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
thf(c_0_30,negated_conjecture,
! [X3: $i,X14: $i,X15: $i] :
( ( epred1_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ X3 )
| ( epred1_0 @ X14 @ X15 )
| ~ ( epred2_0 @ esk3_0 @ X3 )
| ~ ( epred2_0 @ X14 @ X15 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
thf(c_0_31,negated_conjecture,
! [X3: $i,X14: $i] :
( ( epred1_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ X3 @ X14 )
| ~ ( epred2_0 @ X3 @ X14 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
thf(c_0_32,negated_conjecture,
( ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_33,negated_conjecture,
epred1_0 @ esk3_0 @ esk4_0,
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
thf(c_0_34,negated_conjecture,
epred2_0 @ esk1_0 @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
thf(c_0_35,negated_conjecture,
! [X3: $i] :
( ( epred3_0 @ X3 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_36,negated_conjecture,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( epred1_0 @ esk1_0 @ ( esk5_2 @ esk1_0 @ X4 ) )
| ( epred1_0 @ X3 @ X14 )
| ( X4 @ esk2_0 )
| ~ ( epred2_0 @ X3 @ X14 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
thf(c_0_37,negated_conjecture,
! [X3: $i] :
( ( epred3_0 @ X3 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_33])]) ).
thf(c_0_38,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0 @ esk1_0 @ ( esk5_2 @ esk1_0 @ X4 ) )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X4 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_36,c_0_34]) ).
thf(c_0_39,negated_conjecture,
( ~ ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred3_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_40,negated_conjecture,
! [X4: $i > $o] :
( ( epred3_0 @ ( esk5_2 @ esk1_0 @ X4 ) )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X4 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
thf(c_0_41,negated_conjecture,
~ ( epred3_0 @ esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_33])]) ).
thf(c_0_42,negated_conjecture,
! [X15: $i,X3: $i,X14: $i] :
( ( epred1_0 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ X3 @ X14 )
| ( epred3_0 @ X15 )
| ~ ( epred2_0 @ esk1_0 @ X15 )
| ~ ( epred2_0 @ X3 @ X14 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_40]),c_0_41]) ).
thf(c_0_43,negated_conjecture,
! [X3: $i,X14: $i] :
( ( epred1_0 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ X3 @ X14 )
| ~ ( epred2_0 @ X3 @ X14 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_34]),c_0_41]) ).
thf(c_0_44,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(spm,[status(thm)],[c_0_43,c_0_34]) ).
thf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_44]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL878^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.16 % Computer : n017.cluster.edu
% 0.08/0.16 % Model : x86_64 x86_64
% 0.08/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16 % Memory : 8046.5625MB
% 0.08/0.16 % OS : Linux 6.8.0-71-generic
% 0.08/0.16 % CPULimit : 300
% 0.08/0.16 % WCLimit : 300
% 0.08/0.16 % DateTime : Tue Sep 29 10:18:46 UTC 2026
% 0.08/0.16 % CPUTime :
% 0.08/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 Running higher-order theorem proving
% 0.08/0.22 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.F3J5rzvM4R/E---3.1_157952.p
% 0.08/0.24 % Version: 3.5.1-ho
% 0.08/0.24 % Preprocessing class: HSMSSMSSMLMNHHA.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.24 % Starting sh5l with 300s (1) cores
% 0.08/0.24 % Starting new_bool_2 with 300s (1) cores
% 0.08/0.24 % Starting new_bool_9 with 300s (1) cores
% 0.08/0.24 % new_bool_2 with pid 157967 completed with status 0
% 0.08/0.24 % Result found by new_bool_2
% 0.08/0.24 % Preprocessing class: HSMSSMSSMLMNHHA.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.24 % Starting sh5l with 300s (1) cores
% 0.08/0.24 % Starting new_bool_2 with 300s (1) cores
% 0.08/0.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.24 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.24 % Search class: HGHNF-FFSF22-SHHSMSBN
% 0.08/0.24 % partial match(2): HGHNF-FFSF22-SHHFFSBN
% 0.08/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.24 % SubtermCWHack with pid 157971 completed with status 0
% 0.08/0.24 % Result found by SubtermCWHack
% 0.08/0.24 % Preprocessing class: HSMSSMSSMLMNHHA.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.24 % Starting sh5l with 300s (1) cores
% 0.08/0.24 % Starting new_bool_2 with 300s (1) cores
% 0.08/0.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.24 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.24 % Search class: HGHNF-FFSF22-SHHSMSBN
% 0.08/0.24 % partial match(2): HGHNF-FFSF22-SHHFFSBN
% 0.08/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.24 % Preprocessing time : 0.001 s
% 0.08/0.24
% 0.08/0.24 % Proof found!
% 0.08/0.24 % SZS status Theorem
% 0.08/0.24 % SZS output start CNFRefutation
% See solution above
% 0.08/0.24 % Parsed axioms : 64
% 0.08/0.24 % Removed by relevancy pruning/SinE : 55
% 0.08/0.24 % Initial clauses : 8
% 0.08/0.24 % Removed in clause preprocessing : 0
% 0.08/0.24 % Initial clauses in saturation : 8
% 0.08/0.24 % Processed clauses : 34
% 0.08/0.24 % ...of these trivial : 0
% 0.08/0.24 % ...subsumed : 3
% 0.08/0.24 % ...remaining for further processing : 31
% 0.08/0.24 % Other redundant clauses eliminated : 0
% 0.08/0.24 % Clauses deleted for lack of memory : 0
% 0.08/0.24 % Backward-subsumed : 8
% 0.08/0.24 % Backward-rewritten : 13
% 0.08/0.24 % Generated clauses : 30
% 0.08/0.24 % ...of the previous two non-redundant : 29
% 0.08/0.24 % ...aggressively subsumed : 0
% 0.08/0.24 % Contextual simplify-reflections : 1
% 0.08/0.24 % Paramodulations : 30
% 0.08/0.24 % Factorizations : 0
% 0.08/0.24 % NegExts : 0
% 0.08/0.24 % Equation resolutions : 0
% 0.08/0.24 % Disequality decompositions : 0
% 0.08/0.24 % Total rewrite steps : 16
% 0.08/0.24 % ...of those cached : 13
% 0.08/0.24 % Propositional unsat checks : 0
% 0.08/0.24 % Propositional check models : 0
% 0.08/0.24 % Propositional check unsatisfiable : 0
% 0.08/0.24 % Propositional clauses : 0
% 0.08/0.24 % Propositional clauses after purity: 0
% 0.08/0.24 % Propositional unsat core size : 0
% 0.08/0.24 % Propositional preprocessing time : 0.000
% 0.08/0.24 % Propositional encoding time : 0.000
% 0.08/0.24 % Propositional solver time : 0.000
% 0.08/0.24 % Success case prop preproc time : 0.000
% 0.08/0.24 % Success case prop encoding time : 0.000
% 0.08/0.24 % Success case prop solver time : 0.000
% 0.08/0.24 % Current number of processed clauses : 10
% 0.08/0.24 % Positive orientable unit clauses : 4
% 0.08/0.24 % Positive unorientable unit clauses: 0
% 0.08/0.24 % Negative unit clauses : 1
% 0.08/0.24 % Non-unit-clauses : 5
% 0.08/0.24 % Current number of unprocessed clauses: 0
% 0.08/0.24 % ...number of literals in the above : 0
% 0.08/0.24 % Current number of archived formulas : 0
% 0.08/0.24 % Current number of archived clauses : 21
% 0.08/0.24 % Clause-clause subsumption calls (NU) : 57
% 0.08/0.24 % Rec. Clause-clause subsumption calls : 16
% 0.08/0.24 % Non-unit clause-clause subsumptions : 11
% 0.08/0.24 % Unit Clause-clause subsumption calls : 3
% 0.08/0.24 % Rewrite failures with RHS unbound : 0
% 0.08/0.24 % BW rewrite match attempts : 3
% 0.08/0.24 % BW rewrite match successes : 3
% 0.08/0.24 % Condensation attempts : 0
% 0.08/0.24 % Condensation successes : 0
% 0.08/0.24 % Termbank termtop insertions : 2330
% 0.08/0.24 % Search garbage collected termcells : 581
% 0.08/0.24
% 0.08/0.24 % -------------------------------------------------
% 0.08/0.24 % User time : 0.005 s
% 0.08/0.24 % System time : 0.005 s
% 0.08/0.24 % Total time : 0.009 s
% 0.08/0.24 % Maximum resident set size: 3952 pages
% 0.08/0.24
% 0.08/0.24 % -------------------------------------------------
% 0.08/0.24 % User time : 0.006 s
% 0.08/0.24 % System time : 0.008 s
% 0.08/0.24 % Total time : 0.014 s
% 0.08/0.24 % Maximum resident set size: 4864 pages
% 0.08/0.24 % E exiting
%------------------------------------------------------------------------------