TSTP Solution File: PUZ047^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ047^5 : TPTP v8.2.0. Released v4.0.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 : Tue May 21 02:24:51 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 41 ( 11 unt; 11 typ; 0 def)
% Number of atoms : 181 ( 0 equ; 0 cnn)
% Maximal formula atoms : 44 ( 6 avg)
% Number of connectives : 1042 ( 58 ~; 48 |; 57 &; 833 @)
% ( 1 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 11 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 9 usr; 5 con; 0-5 aty)
% Number of variables : 103 ( 0 ^ 101 !; 2 ?; 103 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
b: $tType ).
thf(decl_22,type,
cN: a ).
thf(decl_23,type,
cP: a > a > a > a > b > $o ).
thf(decl_24,type,
cD: b > b ).
thf(decl_25,type,
cS: a ).
thf(decl_26,type,
cG: b > b ).
thf(decl_27,type,
cW: b > b ).
thf(decl_28,type,
cL: b > b ).
thf(decl_29,type,
cO: b ).
thf(decl_30,type,
epred1_0: $o ).
thf(cTHM100A,conjecture,
( ( ( cP @ cS @ cS @ cS @ cS @ cO )
& ! [X1: b] :
( ( cP @ cS @ cN @ cS @ cN @ X1 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cL @ X1 ) ) )
& ! [X2: b] :
( ( cP @ cN @ cN @ cS @ cN @ X2 )
=> ( cP @ cS @ cN @ cS @ cN @ ( cL @ X2 ) ) )
& ! [X3: b] :
( ( cP @ cS @ cS @ cN @ cS @ X3 )
=> ( cP @ cN @ cS @ cN @ cS @ ( cL @ X3 ) ) )
& ! [X4: b] :
( ( cP @ cN @ cS @ cN @ cS @ X4 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cL @ X4 ) ) )
& ! [X5: b] :
( ( cP @ cS @ cS @ cS @ cN @ X5 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cW @ X5 ) ) )
& ! [X6: b] :
( ( cP @ cN @ cN @ cS @ cN @ X6 )
=> ( cP @ cS @ cS @ cS @ cN @ ( cW @ X6 ) ) )
& ! [X7: b] :
( ( cP @ cS @ cS @ cN @ cS @ X7 )
=> ( cP @ cN @ cN @ cN @ cS @ ( cW @ X7 ) ) )
& ! [X8: b] :
( ( cP @ cN @ cN @ cN @ cS @ X8 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cW @ X8 ) ) )
& ! [X9: a,X10: a,X11: b] :
( ( cP @ cS @ X9 @ cS @ X10 @ X11 )
=> ( cP @ cN @ X9 @ cN @ X10 @ ( cG @ X11 ) ) )
& ! [X12: a,X13: a,X14: b] :
( ( cP @ cN @ X12 @ cN @ X13 @ X14 )
=> ( cP @ cS @ X12 @ cS @ X13 @ ( cG @ X14 ) ) )
& ! [X15: b] :
( ( cP @ cS @ cN @ cS @ cS @ X15 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cD @ X15 ) ) )
& ! [X16: b] :
( ( cP @ cN @ cN @ cS @ cN @ X16 )
=> ( cP @ cS @ cN @ cS @ cS @ ( cD @ X16 ) ) )
& ! [X17: b] :
( ( cP @ cS @ cS @ cN @ cS @ X17 )
=> ( cP @ cN @ cS @ cN @ cN @ ( cD @ X17 ) ) )
& ! [X18: b] :
( ( cP @ cN @ cS @ cN @ cN @ X18 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cD @ X18 ) ) ) )
=> ? [X19: b] : ( cP @ cN @ cN @ cN @ cN @ X19 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM100A) ).
thf(c_0_1,plain,
( epred1_0
<=> ( ( cP @ cS @ cS @ cS @ cS @ cO )
& ! [X1: b] :
( ( cP @ cS @ cN @ cS @ cN @ X1 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cL @ X1 ) ) )
& ! [X2: b] :
( ( cP @ cN @ cN @ cS @ cN @ X2 )
=> ( cP @ cS @ cN @ cS @ cN @ ( cL @ X2 ) ) )
& ! [X3: b] :
( ( cP @ cS @ cS @ cN @ cS @ X3 )
=> ( cP @ cN @ cS @ cN @ cS @ ( cL @ X3 ) ) )
& ! [X4: b] :
( ( cP @ cN @ cS @ cN @ cS @ X4 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cL @ X4 ) ) )
& ! [X5: b] :
( ( cP @ cS @ cS @ cS @ cN @ X5 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cW @ X5 ) ) )
& ! [X6: b] :
( ( cP @ cN @ cN @ cS @ cN @ X6 )
=> ( cP @ cS @ cS @ cS @ cN @ ( cW @ X6 ) ) )
& ! [X7: b] :
( ( cP @ cS @ cS @ cN @ cS @ X7 )
=> ( cP @ cN @ cN @ cN @ cS @ ( cW @ X7 ) ) )
& ! [X8: b] :
( ( cP @ cN @ cN @ cN @ cS @ X8 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cW @ X8 ) ) )
& ! [X9: a,X10: a,X11: b] :
( ( cP @ cS @ X9 @ cS @ X10 @ X11 )
=> ( cP @ cN @ X9 @ cN @ X10 @ ( cG @ X11 ) ) )
& ! [X12: a,X13: a,X14: b] :
( ( cP @ cN @ X12 @ cN @ X13 @ X14 )
=> ( cP @ cS @ X12 @ cS @ X13 @ ( cG @ X14 ) ) )
& ! [X15: b] :
( ( cP @ cS @ cN @ cS @ cS @ X15 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cD @ X15 ) ) )
& ! [X16: b] :
( ( cP @ cN @ cN @ cS @ cN @ X16 )
=> ( cP @ cS @ cN @ cS @ cS @ ( cD @ X16 ) ) )
& ! [X17: b] :
( ( cP @ cS @ cS @ cN @ cS @ X17 )
=> ( cP @ cN @ cS @ cN @ cN @ ( cD @ X17 ) ) )
& ! [X18: b] :
( ( cP @ cN @ cS @ cN @ cN @ X18 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cD @ X18 ) ) ) ) ),
introduced(definition) ).
thf(c_0_2,plain,
( epred1_0
=> ( ( cP @ cS @ cS @ cS @ cS @ cO )
& ! [X1: b] :
( ( cP @ cS @ cN @ cS @ cN @ X1 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cL @ X1 ) ) )
& ! [X2: b] :
( ( cP @ cN @ cN @ cS @ cN @ X2 )
=> ( cP @ cS @ cN @ cS @ cN @ ( cL @ X2 ) ) )
& ! [X3: b] :
( ( cP @ cS @ cS @ cN @ cS @ X3 )
=> ( cP @ cN @ cS @ cN @ cS @ ( cL @ X3 ) ) )
& ! [X4: b] :
( ( cP @ cN @ cS @ cN @ cS @ X4 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cL @ X4 ) ) )
& ! [X5: b] :
( ( cP @ cS @ cS @ cS @ cN @ X5 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cW @ X5 ) ) )
& ! [X6: b] :
( ( cP @ cN @ cN @ cS @ cN @ X6 )
=> ( cP @ cS @ cS @ cS @ cN @ ( cW @ X6 ) ) )
& ! [X7: b] :
( ( cP @ cS @ cS @ cN @ cS @ X7 )
=> ( cP @ cN @ cN @ cN @ cS @ ( cW @ X7 ) ) )
& ! [X8: b] :
( ( cP @ cN @ cN @ cN @ cS @ X8 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cW @ X8 ) ) )
& ! [X9: a,X10: a,X11: b] :
( ( cP @ cS @ X9 @ cS @ X10 @ X11 )
=> ( cP @ cN @ X9 @ cN @ X10 @ ( cG @ X11 ) ) )
& ! [X12: a,X13: a,X14: b] :
( ( cP @ cN @ X12 @ cN @ X13 @ X14 )
=> ( cP @ cS @ X12 @ cS @ X13 @ ( cG @ X14 ) ) )
& ! [X15: b] :
( ( cP @ cS @ cN @ cS @ cS @ X15 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cD @ X15 ) ) )
& ! [X16: b] :
( ( cP @ cN @ cN @ cS @ cN @ X16 )
=> ( cP @ cS @ cN @ cS @ cS @ ( cD @ X16 ) ) )
& ! [X17: b] :
( ( cP @ cS @ cS @ cN @ cS @ X17 )
=> ( cP @ cN @ cS @ cN @ cN @ ( cD @ X17 ) ) )
& ! [X18: b] :
( ( cP @ cN @ cS @ cN @ cN @ X18 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cD @ X18 ) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
~ ( epred1_0
=> ? [X19: b] : ( cP @ cN @ cN @ cN @ cN @ X19 ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM100A]),c_0_1]) ).
thf(c_0_4,plain,
! [X40: b,X41: b,X42: b,X43: b,X44: b,X45: b,X46: b,X47: b,X48: a,X49: a,X50: b,X51: a,X52: a,X53: b,X54: b,X55: b,X56: b,X57: b] :
( ( ( cP @ cS @ cS @ cS @ cS @ cO )
| ~ epred1_0 )
& ( ~ ( cP @ cS @ cN @ cS @ cN @ X40 )
| ( cP @ cN @ cN @ cS @ cN @ ( cL @ X40 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cN @ cN @ cS @ cN @ X41 )
| ( cP @ cS @ cN @ cS @ cN @ ( cL @ X41 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cS @ cS @ cN @ cS @ X42 )
| ( cP @ cN @ cS @ cN @ cS @ ( cL @ X42 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cN @ cS @ cN @ cS @ X43 )
| ( cP @ cS @ cS @ cN @ cS @ ( cL @ X43 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cS @ cS @ cS @ cN @ X44 )
| ( cP @ cN @ cN @ cS @ cN @ ( cW @ X44 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cN @ cN @ cS @ cN @ X45 )
| ( cP @ cS @ cS @ cS @ cN @ ( cW @ X45 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cS @ cS @ cN @ cS @ X46 )
| ( cP @ cN @ cN @ cN @ cS @ ( cW @ X46 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cN @ cN @ cN @ cS @ X47 )
| ( cP @ cS @ cS @ cN @ cS @ ( cW @ X47 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cS @ X48 @ cS @ X49 @ X50 )
| ( cP @ cN @ X48 @ cN @ X49 @ ( cG @ X50 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cN @ X51 @ cN @ X52 @ X53 )
| ( cP @ cS @ X51 @ cS @ X52 @ ( cG @ X53 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cS @ cN @ cS @ cS @ X54 )
| ( cP @ cN @ cN @ cS @ cN @ ( cD @ X54 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cN @ cN @ cS @ cN @ X55 )
| ( cP @ cS @ cN @ cS @ cS @ ( cD @ X55 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cS @ cS @ cN @ cS @ X56 )
| ( cP @ cN @ cS @ cN @ cN @ ( cD @ X56 ) )
| ~ epred1_0 )
& ( ~ ( cP @ cN @ cS @ cN @ cN @ X57 )
| ( cP @ cS @ cS @ cN @ cS @ ( cD @ X57 ) )
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X39: b] :
( epred1_0
& ~ ( cP @ cN @ cN @ cN @ cN @ X39 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_6,plain,
! [X10: a,X9: a,X1: b] :
( ( cP @ cN @ X9 @ cN @ X10 @ ( cG @ X1 ) )
| ~ ( cP @ cS @ X9 @ cS @ X10 @ X1 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X1: b] :
~ ( cP @ cN @ cN @ cN @ cN @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X10: a,X9: a,X1: b] :
( ( cP @ cN @ X9 @ cN @ X10 @ ( cG @ X1 ) )
| ~ ( cP @ cS @ X9 @ cS @ X10 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
thf(c_0_10,plain,
! [X1: b] :
( ( cP @ cS @ cN @ cS @ cN @ ( cL @ X1 ) )
| ~ ( cP @ cN @ cN @ cS @ cN @ X1 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,plain,
! [X1: b] :
( ( cP @ cN @ cN @ cS @ cN @ ( cW @ X1 ) )
| ~ ( cP @ cS @ cS @ cS @ cN @ X1 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,negated_conjecture,
! [X1: b] :
~ ( cP @ cS @ cN @ cS @ cN @ X1 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,plain,
! [X1: b] :
( ( cP @ cS @ cN @ cS @ cN @ ( cL @ X1 ) )
| ~ ( cP @ cN @ cN @ cS @ cN @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7])]) ).
thf(c_0_14,plain,
! [X1: b] :
( ( cP @ cN @ cN @ cS @ cN @ ( cW @ X1 ) )
| ~ ( cP @ cS @ cS @ cS @ cN @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).
thf(c_0_15,plain,
! [X1: b] :
~ ( cP @ cN @ cN @ cS @ cN @ X1 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,plain,
! [X10: a,X9: a,X1: b] :
( ( cP @ cS @ X9 @ cS @ X10 @ ( cG @ X1 ) )
| ~ ( cP @ cN @ X9 @ cN @ X10 @ X1 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_17,plain,
! [X1: b] :
~ ( cP @ cS @ cS @ cS @ cN @ X1 ),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,plain,
! [X10: a,X9: a,X1: b] :
( ( cP @ cS @ X9 @ cS @ X10 @ ( cG @ X1 ) )
| ~ ( cP @ cN @ X9 @ cN @ X10 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_7])]) ).
thf(c_0_19,plain,
! [X1: b] :
( ( cP @ cN @ cS @ cN @ cN @ ( cD @ X1 ) )
| ~ ( cP @ cS @ cS @ cN @ cS @ X1 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_20,plain,
! [X1: b] :
~ ( cP @ cN @ cS @ cN @ cN @ X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,plain,
! [X1: b] :
( ( cP @ cN @ cS @ cN @ cN @ ( cD @ X1 ) )
| ~ ( cP @ cS @ cS @ cN @ cS @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_7])]) ).
thf(c_0_22,plain,
! [X1: b] :
( ( cP @ cS @ cS @ cN @ cS @ ( cL @ X1 ) )
| ~ ( cP @ cN @ cS @ cN @ cS @ X1 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_23,plain,
! [X1: b] :
~ ( cP @ cS @ cS @ cN @ cS @ X1 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_24,plain,
! [X1: b] :
( ( cP @ cS @ cS @ cN @ cS @ ( cL @ X1 ) )
| ~ ( cP @ cN @ cS @ cN @ cS @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_7])]) ).
thf(c_0_25,plain,
( ( cP @ cS @ cS @ cS @ cS @ cO )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_26,plain,
! [X1: b] :
~ ( cP @ cN @ cS @ cN @ cS @ X1 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_27,plain,
cP @ cS @ cS @ cS @ cS @ cO,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_7])]) ).
thf(c_0_28,plain,
! [X1: b] :
~ ( cP @ cS @ cS @ cS @ cS @ X1 ),
inference(spm,[status(thm)],[c_0_26,c_0_9]) ).
thf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : PUZ047^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 11:00:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/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/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_5 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49 # new_bool_1 with pid 4519 completed with status 0
% 0.20/0.49 # Result found by new_bool_1
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: HHUNF-FFMF11-SFFFFFNN
% 0.20/0.49 # partial match(1): HHUNF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.49 # new_ho_10 with pid 4523 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: HHUNF-FFMF11-SFFFFFNN
% 0.20/0.49 # partial match(1): HHUNF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 11
% 0.20/0.49 # Removed by relevancy pruning/SinE : 10
% 0.20/0.49 # Initial clauses : 17
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 17
% 0.20/0.49 # Processed clauses : 44
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 5
% 0.20/0.49 # ...remaining for further processing : 39
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 8
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 13
% 0.20/0.49 # ...of the previous two non-redundant : 11
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 12
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 15
% 0.20/0.49 # ...of those cached : 14
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 13
% 0.20/0.49 # Positive orientable unit clauses : 1
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 10
% 0.20/0.49 # Non-unit-clauses : 2
% 0.20/0.49 # Current number of unprocessed clauses: 0
% 0.20/0.49 # ...number of literals in the above : 0
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 26
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 8
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 8
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 18
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 48
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 2507
% 0.20/0.49 # Search garbage collected termcells : 405
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1924 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.005 s
% 0.20/0.49 # Total time : 0.011 s
% 0.20/0.49 # Maximum resident set size: 1740 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------