%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU689^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:25:03 AM UTC 2026
% Result : Theorem 0.94s 0.48s
% Output : CNFRefutation 0.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 141 ( 16 equ; 0 cnn)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 637 ( 49 ~; 61 |; 9 &; 470 @)
% ( 2 <=>; 46 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 7 con; 0-4 aty)
% Number of variables : 116 ( 13 ^; 103 !; 0 ?; 116 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
subset: $i > $i > $o ).
thf(decl_25,type,
subsetI1: $o ).
thf(decl_26,type,
kpair: $i > $i > $i ).
thf(decl_27,type,
cartprod: $i > $i > $i ).
thf(decl_28,type,
breln: $i > $i > $i > $o ).
thf(decl_29,type,
brelnall1: $o ).
thf(decl_30,type,
esk1_2: $i > $i > $i ).
thf(decl_31,type,
esk2_4: $i > $i > $i > ( $i > $o ) > $i ).
thf(decl_32,type,
esk3_4: $i > $i > $i > ( $i > $o ) > $i ).
thf(decl_33,type,
esk4_0: $i ).
thf(decl_34,type,
esk5_0: $i ).
thf(decl_35,type,
esk6_0: $i ).
thf(decl_36,type,
esk7_0: $i ).
thf(breln,axiom,
( breln
= ( ^ [X1: $i,X2: $i,X4: $i] : ( subset @ X4 @ ( cartprod @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ilDnhoMuar/E---3.1_1347469.p',breln) ).
thf(subbreln,conjecture,
( subsetI1
=> ( brelnall1
=> ! [X1: $i,X2: $i,X5: $i] :
( ( breln @ X1 @ X2 @ X5 )
=> ! [X8: $i] :
( ( breln @ X1 @ X2 @ X8 )
=> ( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X3 @ X7 ) @ X5 )
=> ( in @ ( kpair @ X3 @ X7 ) @ X8 ) ) ) )
=> ( subset @ X5 @ X8 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ilDnhoMuar/E---3.1_1347469.p',subbreln) ).
thf(brelnall1,axiom,
( brelnall1
<=> ! [X1: $i,X2: $i,X5: $i] :
( ( breln @ X1 @ X2 @ X5 )
=> ! [X6: $i > $o] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X3 @ X7 ) @ X5 )
=> ( X6 @ ( kpair @ X3 @ X7 ) ) ) ) )
=> ! [X3: $i] :
( ( in @ X3 @ X5 )
=> ( X6 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ilDnhoMuar/E---3.1_1347469.p',brelnall1) ).
thf(subsetI1,axiom,
( subsetI1
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) )
=> ( subset @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ilDnhoMuar/E---3.1_1347469.p',subsetI1) ).
thf(c_0_4,plain,
( breln
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln]) ).
thf(c_0_5,negated_conjecture,
~ ( subsetI1
=> ( brelnall1
=> ! [X1: $i,X2: $i,X5: $i] :
( ( breln @ X1 @ X2 @ X5 )
=> ! [X8: $i] :
( ( breln @ X1 @ X2 @ X8 )
=> ( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X3 @ X7 ) @ X5 )
=> ( in @ ( kpair @ X3 @ X7 ) @ X8 ) ) ) )
=> ( subset @ X5 @ X8 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[subbreln]) ).
thf(c_0_6,axiom,
( brelnall1
= ( ! [X1: $i,X2: $i,X5: $i] :
( ( subset @ X5 @ ( cartprod @ X1 @ X2 ) )
=> ! [X6: $i > $o] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X3 @ X7 ) @ X5 )
=> ( X6 @ ( kpair @ X3 @ X7 ) ) ) ) )
=> ! [X3: $i] :
( ( in @ X3 @ X5 )
=> ( X6 @ X3 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[brelnall1,c_0_4]) ).
thf(c_0_7,negated_conjecture,
~ ( ! [X25: $i,X26: $i] :
( ! [X27: $i] :
( ( in @ X27 @ X25 )
=> ( in @ X27 @ X26 ) )
=> ( subset @ X25 @ X26 ) )
=> ( ! [X28: $i,X29: $i,X30: $i] :
( ( subset @ X30 @ ( cartprod @ X28 @ X29 ) )
=> ! [X31: $i > $o] :
( ! [X32: $i] :
( ( in @ X32 @ X28 )
=> ! [X33: $i] :
( ( in @ X33 @ X29 )
=> ( ( in @ ( kpair @ X32 @ X33 ) @ X30 )
=> ( X31 @ ( kpair @ X32 @ X33 ) ) ) ) )
=> ! [X34: $i] :
( ( in @ X34 @ X30 )
=> ( X31 @ X34 ) ) ) )
=> ! [X1: $i,X2: $i,X5: $i] :
( ( subset @ X5 @ ( cartprod @ X1 @ X2 ) )
=> ! [X8: $i] :
( ( subset @ X8 @ ( cartprod @ X1 @ X2 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X3 @ X7 ) @ X5 )
=> ( in @ ( kpair @ X3 @ X7 ) @ X8 ) ) ) )
=> ( subset @ X5 @ X8 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,subsetI1]),c_0_4]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X35: $i,X36: $i,X38: $i,X39: $i,X40: $i,X41: $i > $o,X44: $i,X49: $i,X50: $i] :
( ( ( in @ ( esk1_2 @ X35 @ X36 ) @ X35 )
| ( subset @ X35 @ X36 ) )
& ( ~ ( in @ ( esk1_2 @ X35 @ X36 ) @ X36 )
| ( subset @ X35 @ X36 ) )
& ( ( in @ ( esk2_4 @ X38 @ X39 @ X40 @ X41 ) @ X38 )
| ~ ( in @ X44 @ X40 )
| ( X41 @ X44 )
| ~ ( subset @ X40 @ ( cartprod @ X38 @ X39 ) ) )
& ( ( in @ ( esk3_4 @ X38 @ X39 @ X40 @ X41 ) @ X39 )
| ~ ( in @ X44 @ X40 )
| ( X41 @ X44 )
| ~ ( subset @ X40 @ ( cartprod @ X38 @ X39 ) ) )
& ( ( in @ ( kpair @ ( esk2_4 @ X38 @ X39 @ X40 @ X41 ) @ ( esk3_4 @ X38 @ X39 @ X40 @ X41 ) ) @ X40 )
| ~ ( in @ X44 @ X40 )
| ( X41 @ X44 )
| ~ ( subset @ X40 @ ( cartprod @ X38 @ X39 ) ) )
& ( ~ ( X41 @ ( kpair @ ( esk2_4 @ X38 @ X39 @ X40 @ X41 ) @ ( esk3_4 @ X38 @ X39 @ X40 @ X41 ) ) )
| ~ ( in @ X44 @ X40 )
| ( X41 @ X44 )
| ~ ( subset @ X40 @ ( cartprod @ X38 @ X39 ) ) )
& ( subset @ esk6_0 @ ( cartprod @ esk4_0 @ esk5_0 ) )
& ( subset @ esk7_0 @ ( cartprod @ esk4_0 @ esk5_0 ) )
& ( ~ ( in @ X49 @ esk4_0 )
| ~ ( in @ X50 @ esk5_0 )
| ~ ( in @ ( kpair @ X49 @ X50 ) @ esk6_0 )
| ( in @ ( kpair @ X49 @ X50 ) @ esk7_0 ) )
& ~ ( subset @ esk6_0 @ esk7_0 ) ),
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_7])])])])])]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X6: $i > $o,X4: $i,X3: $i,X2: $i] :
( ( X6 @ X4 )
| ~ ( X6 @ ( kpair @ ( esk2_4 @ X1 @ X2 @ X3 @ X6 ) @ ( esk3_4 @ X1 @ X2 @ X3 @ X6 ) ) )
| ~ ( in @ X4 @ X3 )
| ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i,X4: $i,X3: $i] :
( ( ( kpair
@ ( esk2_4 @ X1 @ X2 @ X3
@ ^ [Z0: $i] : ( Z0 != X4 ) )
@ ( esk3_4 @ X1 @ X2 @ X3
@ ^ [Z0: $i] : ( Z0 != X4 ) ) )
= X4 )
| ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) )
| ~ ( in @ X4 @ X3 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 )
| ( subset @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X6: $i > $o,X4: $i,X3: $i,X2: $i] :
( ( in @ ( esk3_4 @ X1 @ X2 @ X3 @ X6 ) @ X2 )
| ( X6 @ X4 )
| ~ ( in @ X4 @ X3 )
| ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
subset @ esk6_0 @ ( cartprod @ esk4_0 @ esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( kpair @ X1 @ X2 ) @ esk7_0 )
| ~ ( in @ X1 @ esk4_0 )
| ~ ( in @ X2 @ esk5_0 )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ esk6_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X4: $i,X3: $i,X2: $i] :
( ( ( kpair
@ ( esk2_4 @ X1 @ X2 @ X3
@ ^ [Z0: $i] :
( Z0
!= ( esk1_2 @ X3 @ X4 ) ) )
@ ( esk3_4 @ X1 @ X2 @ X3
@ ^ [Z0: $i] :
( Z0
!= ( esk1_2 @ X3 @ X4 ) ) ) )
= ( esk1_2 @ X3 @ X4 ) )
| ( subset @ X3 @ X4 )
| ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_16,negated_conjecture,
! [X6: $i > $o,X1: $i] :
( ( in @ ( esk3_4 @ esk4_0 @ esk5_0 @ esk6_0 @ X6 ) @ esk5_0 )
| ( X6 @ X1 )
| ~ ( in @ X1 @ esk6_0 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X6: $i > $o,X4: $i,X3: $i,X2: $i] :
( ( in @ ( esk2_4 @ X1 @ X2 @ X3 @ X6 ) @ X1 )
| ( X6 @ X4 )
| ~ ( in @ X4 @ X3 )
| ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ esk7_0 )
| ( subset @ X1 @ X2 )
| ~ ( in
@ ( esk3_4 @ X3 @ X4 @ X1
@ ^ [Z0: $i] :
( Z0
!= ( esk1_2 @ X1 @ X2 ) ) )
@ esk5_0 )
| ~ ( in
@ ( esk2_4 @ X3 @ X4 @ X1
@ ^ [Z0: $i] :
( Z0
!= ( esk1_2 @ X1 @ X2 ) ) )
@ esk4_0 )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ esk6_0 )
| ~ ( subset @ X1 @ ( cartprod @ X3 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_19,negated_conjecture,
! [X6: $i > $o,X1: $i] :
( ( in @ ( esk3_4 @ esk4_0 @ esk5_0 @ esk6_0 @ X6 ) @ esk5_0 )
| ( X6 @ ( esk1_2 @ esk6_0 @ X1 ) )
| ( subset @ esk6_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
thf(c_0_20,negated_conjecture,
! [X6: $i > $o,X1: $i] :
( ( in @ ( esk2_4 @ esk4_0 @ esk5_0 @ esk6_0 @ X6 ) @ esk4_0 )
| ( X6 @ X1 )
| ~ ( in @ X1 @ esk6_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
thf(c_0_21,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ esk6_0 @ X1 ) @ esk7_0 )
| ( subset @ esk6_0 @ X2 )
| ( subset @ esk6_0 @ X1 )
| ( ( esk1_2 @ esk6_0 @ X2 )
!= ( esk1_2 @ esk6_0 @ X1 ) )
| ~ ( in
@ ( esk2_4 @ esk4_0 @ esk5_0 @ esk6_0
@ ^ [Z0: $i] :
( Z0
!= ( esk1_2 @ esk6_0 @ X1 ) ) )
@ esk4_0 ) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]),c_0_13])]),c_0_11]) ).
thf(c_0_22,negated_conjecture,
! [X6: $i > $o,X1: $i] :
( ( in @ ( esk2_4 @ esk4_0 @ esk5_0 @ esk6_0 @ X6 ) @ esk4_0 )
| ( X6 @ ( esk1_2 @ esk6_0 @ X1 ) )
| ( subset @ esk6_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
thf(c_0_23,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ esk6_0 @ X1 ) @ esk7_0 )
| ( subset @ esk6_0 @ X2 )
| ( subset @ esk6_0 @ X1 )
| ( subset @ esk6_0 @ X3 )
| ( ( esk1_2 @ esk6_0 @ X2 )
!= ( esk1_2 @ esk6_0 @ X1 ) )
| ( ( esk1_2 @ esk6_0 @ X3 )
!= ( esk1_2 @ esk6_0 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22])]) ).
thf(c_0_24,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ esk6_0 @ X1 ) @ esk7_0 )
| ( subset @ esk6_0 @ X2 )
| ( subset @ esk6_0 @ X1 )
| ( ( esk1_2 @ esk6_0 @ X2 )
!= ( esk1_2 @ esk6_0 @ X1 ) ) ),
inference(er,[status(thm)],[c_0_23]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk1_2 @ esk6_0 @ X1 ) @ esk7_0 )
| ( subset @ esk6_0 @ X1 ) ),
inference(er,[status(thm)],[c_0_24]) ).
thf(c_0_27,negated_conjecture,
~ ( subset @ esk6_0 @ esk7_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU689^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n002.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 14:12:22 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 Running higher-order theorem proving
% 0.10/0.27 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.ilDnhoMuar/E---3.1_1347469.p
% 0.94/0.48 % Version: 3.5.1-ho
% 0.94/0.48 % Preprocessing class: HSSSSLSSSLSNSFA.
% 0.94/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.48 % Starting post_as_ho5 with 1500s (5) cores
% 0.94/0.48 % Starting post_as_ho10 with 300s (1) cores
% 0.94/0.48 % Starting post_as_ho4 with 300s (1) cores
% 0.94/0.48 % Starting sh5l with 300s (1) cores
% 0.94/0.48 % post_as_ho5 with pid 1347482 completed with status 0
% 0.94/0.48 % Result found by post_as_ho5
% 0.94/0.48 % Preprocessing class: HSSSSLSSSLSNSFA.
% 0.94/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.48 % Starting post_as_ho5 with 1500s (5) cores
% 0.94/0.48 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.94/0.48 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.94/0.48 % Search class: HGUNF-FFSF32-SSFFMSBN
% 0.94/0.48 % partial match(2): HGUNF-FFSF11-SSFFMSBN
% 0.94/0.48 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.94/0.48 % Starting SubtermCWHack with 151s (1) cores
% 0.94/0.48 % Starting post_as_ho12 with 601s (1) cores
% 0.94/0.48 % Starting new_ho_8 with 226s (1) cores
% 0.94/0.48 % Starting new_ho_4 with 226s (1) cores
% 0.94/0.48 % Starting post_as_ho5 with 226s (1) cores
% 0.94/0.48 % post_as_ho5 with pid 1347493 completed with status 0
% 0.94/0.48 % Result found by post_as_ho5
% 0.94/0.48 % Preprocessing class: HSSSSLSSSLSNSFA.
% 0.94/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.48 % Starting post_as_ho5 with 1500s (5) cores
% 0.94/0.48 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.94/0.48 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.94/0.48 % Search class: HGUNF-FFSF32-SSFFMSBN
% 0.94/0.48 % partial match(2): HGUNF-FFSF11-SSFFMSBN
% 0.94/0.48 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.94/0.48 % Starting SubtermCWHack with 151s (1) cores
% 0.94/0.48 % Starting post_as_ho12 with 601s (1) cores
% 0.94/0.48 % Starting new_ho_8 with 226s (1) cores
% 0.94/0.48 % Starting new_ho_4 with 226s (1) cores
% 0.94/0.48 % Starting post_as_ho5 with 226s (1) cores
% 0.94/0.48 % Preprocessing time : 0.001 s
% 0.94/0.48 % Presaturation interreduction done
% 0.94/0.48
% 0.94/0.48 % Proof found!
% 0.94/0.48 % SZS status Theorem
% 0.94/0.48 % SZS output start CNFRefutation
% See solution above
% 0.94/0.48 % Parsed axioms : 11
% 0.94/0.48 % Removed by relevancy pruning/SinE : 7
% 0.94/0.48 % Initial clauses : 10
% 0.94/0.48 % Removed in clause preprocessing : 0
% 0.94/0.48 % Initial clauses in saturation : 10
% 0.94/0.48 % Processed clauses : 115
% 0.94/0.48 % ...of these trivial : 6
% 0.94/0.48 % ...subsumed : 10
% 0.94/0.48 % ...remaining for further processing : 99
% 0.94/0.48 % Other redundant clauses eliminated : 3
% 0.94/0.48 % Clauses deleted for lack of memory : 0
% 0.94/0.48 % Backward-subsumed : 3
% 0.94/0.48 % Backward-rewritten : 0
% 0.94/0.48 % Generated clauses : 778
% 0.94/0.48 % ...of the previous two non-redundant : 686
% 0.94/0.48 % ...aggressively subsumed : 0
% 0.94/0.48 % Contextual simplify-reflections : 1
% 0.94/0.48 % Paramodulations : 726
% 0.94/0.48 % Factorizations : 12
% 0.94/0.48 % NegExts : 8
% 0.94/0.48 % Equation resolutions : 18
% 0.94/0.48 % Disequality decompositions : 0
% 0.94/0.48 % Total rewrite steps : 68
% 0.94/0.48 % ...of those cached : 58
% 0.94/0.48 % Propositional unsat checks : 0
% 0.94/0.48 % Propositional check models : 0
% 0.94/0.48 % Propositional check unsatisfiable : 0
% 0.94/0.48 % Propositional clauses : 0
% 0.94/0.48 % Propositional clauses after purity: 0
% 0.94/0.48 % Propositional unsat core size : 0
% 0.94/0.48 % Propositional preprocessing time : 0.000
% 0.94/0.48 % Propositional encoding time : 0.000
% 0.94/0.48 % Propositional solver time : 0.000
% 0.94/0.48 % Success case prop preproc time : 0.000
% 0.94/0.48 % Success case prop encoding time : 0.000
% 0.94/0.48 % Success case prop solver time : 0.000
% 0.94/0.48 % Current number of processed clauses : 80
% 0.94/0.48 % Positive orientable unit clauses : 3
% 0.94/0.48 % Positive unorientable unit clauses: 0
% 0.94/0.48 % Negative unit clauses : 1
% 0.94/0.48 % Non-unit-clauses : 76
% 0.94/0.48 % Current number of unprocessed clauses: 564
% 0.94/0.48 % ...number of literals in the above : 2960
% 0.94/0.48 % Current number of archived formulas : 0
% 0.94/0.48 % Current number of archived clauses : 19
% 0.94/0.48 % Clause-clause subsumption calls (NU) : 585
% 0.94/0.48 % Rec. Clause-clause subsumption calls : 136
% 0.94/0.48 % Non-unit clause-clause subsumptions : 14
% 0.94/0.48 % Unit Clause-clause subsumption calls : 2
% 0.94/0.48 % Rewrite failures with RHS unbound : 0
% 0.94/0.48 % BW rewrite match attempts : 4
% 0.94/0.48 % BW rewrite match successes : 0
% 0.94/0.48 % Condensation attempts : 0
% 0.94/0.48 % Condensation successes : 0
% 0.94/0.48 % Termbank termtop insertions : 195801
% 0.94/0.48 % Search garbage collected termcells : 509
% 0.94/0.48
% 0.94/0.48 % -------------------------------------------------
% 0.94/0.48 % User time : 0.079 s
% 0.94/0.48 % System time : 0.005 s
% 0.94/0.48 % Total time : 0.085 s
% 0.94/0.48 % Maximum resident set size: 3640 pages
% 0.94/0.48
% 0.94/0.48 % -------------------------------------------------
% 0.94/0.48 % User time : 0.644 s
% 0.94/0.48 % System time : 0.031 s
% 0.94/0.48 % Total time : 0.675 s
% 0.94/0.48 % Maximum resident set size: 4864 pages
% 0.94/0.48 % E exiting
%------------------------------------------------------------------------------