TSTP Solution File: SEV028^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV028^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 04:07:25 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 18
% Syntax : Number of formulae : 60 ( 8 unt; 16 typ; 0 def)
% Number of atoms : 159 ( 6 equ; 0 cnn)
% Maximal formula atoms : 25 ( 3 avg)
% Number of connectives : 591 ( 81 ~; 92 |; 42 &; 344 @)
% ( 10 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 90 ( 0 ^ 75 !; 15 ?; 90 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
cQ: a > a > $o ).
thf(decl_23,type,
epred1_0: $o ).
thf(decl_24,type,
esk1_0: a ).
thf(decl_25,type,
esk2_0: a ).
thf(decl_26,type,
esk3_0: a ).
thf(decl_27,type,
esk4_0: a ).
thf(decl_28,type,
esk5_0: a ).
thf(decl_29,type,
esk6_0: a ).
thf(decl_30,type,
esk7_1: ( a > $o ) > a ).
thf(decl_31,type,
esk8_1: ( a > $o ) > a ).
thf(decl_32,type,
esk9_1: ( a > $o ) > a ).
thf(decl_33,type,
epred2_1: a > a > $o ).
thf(decl_34,type,
esk10_1: a > a ).
thf(decl_35,type,
esk11_2: a > ( a > $o ) > a ).
thf(decl_36,type,
esk12_2: a > ( a > $o ) > a ).
thf(cTHM558_pme,conjecture,
( ( ! [X1: a > $o] :
( ( ? [X2: a] : ( X1 @ X2 )
& ! [X3: a] :
( ( X1 @ X3 )
=> ! [X4: a] :
( ( X1 @ X4 )
<=> ( cQ @ X3 @ X4 ) ) ) )
=> ? [X2: a] : ( X1 @ X2 ) )
& ! [X3: a] :
? [X1: a > $o] :
( ? [X2: a] : ( X1 @ X2 )
& ! [X5: a] :
( ( X1 @ X5 )
=> ! [X4: a] :
( ( X1 @ X4 )
<=> ( cQ @ X5 @ X4 ) ) )
& ( X1 @ X3 )
& ! [X6: a > $o] :
( ( ? [X2: a] : ( X6 @ X2 )
& ! [X5: a] :
( ( X6 @ X5 )
=> ! [X4: a] :
( ( X6 @ X4 )
<=> ( cQ @ X5 @ X4 ) ) )
& ( X6 @ X3 ) )
=> ( X6 = X1 ) ) ) )
=> ( ! [X3: a] : ( cQ @ X3 @ X3 )
& ! [X3: a,X4: a] :
( ( cQ @ X3 @ X4 )
=> ( cQ @ X4 @ X3 ) )
& ! [X3: a,X4: a,X2: a] :
( ( ( cQ @ X3 @ X4 )
& ( cQ @ X4 @ X2 ) )
=> ( cQ @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM558_pme) ).
thf(c_0_1,plain,
( epred1_0
<=> ( ! [X1: a > $o] :
( ( ? [X2: a] : ( X1 @ X2 )
& ! [X3: a] :
( ( X1 @ X3 )
=> ! [X4: a] :
( ( X1 @ X4 )
<=> ( cQ @ X3 @ X4 ) ) ) )
=> ? [X2: a] : ( X1 @ X2 ) )
& ! [X3: a] :
? [X1: a > $o] :
( ? [X2: a] : ( X1 @ X2 )
& ! [X5: a] :
( ( X1 @ X5 )
=> ! [X4: a] :
( ( X1 @ X4 )
<=> ( cQ @ X5 @ X4 ) ) )
& ( X1 @ X3 )
& ! [X6: a > $o] :
( ( ? [X2: a] : ( X6 @ X2 )
& ! [X5: a] :
( ( X6 @ X5 )
=> ! [X4: a] :
( ( X6 @ X4 )
<=> ( cQ @ X5 @ X4 ) ) )
& ( X6 @ X3 ) )
=> ( X6 = X1 ) ) ) ) ),
introduced(definition) ).
thf(c_0_2,plain,
( epred1_0
=> ( ! [X1: a > $o] :
( ( ? [X2: a] : ( X1 @ X2 )
& ! [X3: a] :
( ( X1 @ X3 )
=> ! [X4: a] :
( ( X1 @ X4 )
<=> ( cQ @ X3 @ X4 ) ) ) )
=> ? [X2: a] : ( X1 @ X2 ) )
& ! [X3: a] :
? [X1: a > $o] :
( ? [X2: a] : ( X1 @ X2 )
& ! [X5: a] :
( ( X1 @ X5 )
=> ! [X4: a] :
( ( X1 @ X4 )
<=> ( cQ @ X5 @ X4 ) ) )
& ( X1 @ X3 )
& ! [X6: a > $o] :
( ( ? [X2: a] : ( X6 @ X2 )
& ! [X5: a] :
( ( X6 @ X5 )
=> ! [X4: a] :
( ( X6 @ X4 )
<=> ( cQ @ X5 @ X4 ) ) )
& ( X6 @ X3 ) )
=> ( X6 = X1 ) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
~ ( epred1_0
=> ( ! [X3: a] : ( cQ @ X3 @ X3 )
& ! [X3: a,X4: a] :
( ( cQ @ X3 @ X4 )
=> ( cQ @ X4 @ X3 ) )
& ! [X3: a,X4: a,X2: a] :
( ( ( cQ @ X3 @ X4 )
& ( cQ @ X4 @ X2 ) )
=> ( cQ @ X3 @ X2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM558_pme]),c_0_1]) ).
thf(c_0_4,plain,
! [X33: a > $o,X34: a,X38: a,X41: a,X42: a,X43: a,X44: a > $o,X45: a] :
( ( ( X33 @ ( esk7_1 @ X33 ) )
| ~ ( X33 @ X34 )
| ( X33 @ ( esk9_1 @ X33 ) )
| ~ epred1_0 )
& ( ~ ( X33 @ ( esk8_1 @ X33 ) )
| ~ ( cQ @ ( esk7_1 @ X33 ) @ ( esk8_1 @ X33 ) )
| ~ ( X33 @ X34 )
| ( X33 @ ( esk9_1 @ X33 ) )
| ~ epred1_0 )
& ( ( X33 @ ( esk8_1 @ X33 ) )
| ( cQ @ ( esk7_1 @ X33 ) @ ( esk8_1 @ X33 ) )
| ~ ( X33 @ X34 )
| ( X33 @ ( esk9_1 @ X33 ) )
| ~ epred1_0 )
& ( ( epred2_1 @ X38 @ ( esk10_1 @ X38 ) )
| ~ epred1_0 )
& ( ~ ( epred2_1 @ X38 @ X42 )
| ( cQ @ X41 @ X42 )
| ~ ( epred2_1 @ X38 @ X41 )
| ~ epred1_0 )
& ( ~ ( cQ @ X41 @ X43 )
| ( epred2_1 @ X38 @ X43 )
| ~ ( epred2_1 @ X38 @ X41 )
| ~ epred1_0 )
& ( ( epred2_1 @ X38 @ X38 )
| ~ epred1_0 )
& ( ( X44 @ ( esk11_2 @ X38 @ X44 ) )
| ~ ( X44 @ X45 )
| ~ ( X44 @ X38 )
| ( X44
= ( epred2_1 @ X38 ) )
| ~ epred1_0 )
& ( ~ ( X44 @ ( esk12_2 @ X38 @ X44 ) )
| ~ ( cQ @ ( esk11_2 @ X38 @ X44 ) @ ( esk12_2 @ X38 @ X44 ) )
| ~ ( X44 @ X45 )
| ~ ( X44 @ X38 )
| ( X44
= ( epred2_1 @ X38 ) )
| ~ epred1_0 )
& ( ( X44 @ ( esk12_2 @ X38 @ X44 ) )
| ( cQ @ ( esk11_2 @ X38 @ X44 ) @ ( esk12_2 @ X38 @ X44 ) )
| ~ ( X44 @ X45 )
| ~ ( X44 @ X38 )
| ( X44
= ( epred2_1 @ X38 ) )
| ~ epred1_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(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])]) ).
thf(c_0_5,negated_conjecture,
( epred1_0
& ( ( cQ @ esk4_0 @ esk5_0 )
| ( cQ @ esk2_0 @ esk3_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) )
& ( ( cQ @ esk5_0 @ esk6_0 )
| ( cQ @ esk2_0 @ esk3_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) )
& ( ~ ( cQ @ esk4_0 @ esk6_0 )
| ( cQ @ esk2_0 @ esk3_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) )
& ( ( cQ @ esk4_0 @ esk5_0 )
| ~ ( cQ @ esk3_0 @ esk2_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) )
& ( ( cQ @ esk5_0 @ esk6_0 )
| ~ ( cQ @ esk3_0 @ esk2_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) )
& ( ~ ( cQ @ esk4_0 @ esk6_0 )
| ~ ( cQ @ esk3_0 @ esk2_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
thf(c_0_6,plain,
! [X2: a,X3: a,X4: a] :
( ( cQ @ X4 @ X3 )
| ~ ( epred2_1 @ X2 @ X3 )
| ~ ( epred2_1 @ X2 @ X4 )
| ~ 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,plain,
! [X2: a] :
( ( epred2_1 @ X2 @ X2 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_9,plain,
! [X2: a,X4: a,X3: a] :
( ( cQ @ X2 @ X3 )
| ~ ( epred2_1 @ X4 @ X2 )
| ~ ( epred2_1 @ X4 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
thf(c_0_10,plain,
! [X2: a] : ( epred2_1 @ X2 @ X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
thf(c_0_11,plain,
! [X2: a,X3: a] :
( ( cQ @ X2 @ X3 )
| ~ ( epred2_1 @ X2 @ X3 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,plain,
! [X4: a,X3: a,X2: a] :
( ( epred2_1 @ X4 @ X3 )
| ~ ( cQ @ X2 @ X3 )
| ~ ( epred2_1 @ X4 @ X2 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_13,negated_conjecture,
( ( cQ @ esk4_0 @ esk5_0 )
| ( cQ @ esk2_0 @ esk3_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_14,plain,
! [X2: a] : ( cQ @ X2 @ X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
thf(c_0_15,negated_conjecture,
( ( cQ @ esk5_0 @ esk6_0 )
| ( cQ @ esk2_0 @ esk3_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_16,plain,
! [X2: a,X3: a,X4: a] :
( ( epred2_1 @ X2 @ X3 )
| ~ ( cQ @ X4 @ X3 )
| ~ ( epred2_1 @ X2 @ X4 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_7])]) ).
thf(c_0_17,negated_conjecture,
( ( cQ @ esk4_0 @ esk5_0 )
| ( cQ @ esk2_0 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
thf(c_0_18,negated_conjecture,
( ( cQ @ esk5_0 @ esk6_0 )
| ( cQ @ esk2_0 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14])]) ).
thf(c_0_19,negated_conjecture,
! [X2: a] :
( ( cQ @ esk2_0 @ esk3_0 )
| ( epred2_1 @ X2 @ esk5_0 )
| ~ ( epred2_1 @ X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_20,negated_conjecture,
! [X2: a] :
( ( cQ @ esk2_0 @ esk3_0 )
| ( epred2_1 @ X2 @ esk6_0 )
| ~ ( epred2_1 @ X2 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
thf(c_0_21,plain,
( ( epred2_1 @ esk4_0 @ esk5_0 )
| ( cQ @ esk2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
thf(c_0_22,negated_conjecture,
( ( cQ @ esk2_0 @ esk3_0 )
| ~ ( cQ @ esk4_0 @ esk6_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_23,negated_conjecture,
( ( epred2_1 @ esk4_0 @ esk6_0 )
| ( cQ @ esk2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_24,negated_conjecture,
( ( cQ @ esk2_0 @ esk3_0 )
| ~ ( cQ @ esk4_0 @ esk6_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_14])]) ).
thf(c_0_25,plain,
cQ @ esk2_0 @ esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_23]),c_0_24]) ).
thf(c_0_26,plain,
! [X2: a] :
( ( epred2_1 @ X2 @ esk3_0 )
| ~ ( epred2_1 @ X2 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
thf(c_0_27,negated_conjecture,
( ( cQ @ esk5_0 @ esk6_0 )
| ~ ( cQ @ esk3_0 @ esk2_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_28,plain,
! [X3: a,X2: a] :
( ( cQ @ esk3_0 @ X2 )
| ~ ( epred2_1 @ X3 @ esk2_0 )
| ~ ( epred2_1 @ X3 @ X2 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_26]) ).
thf(c_0_29,negated_conjecture,
( ( cQ @ esk5_0 @ esk6_0 )
| ~ ( cQ @ esk3_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_14])]) ).
thf(c_0_30,negated_conjecture,
( ( cQ @ esk4_0 @ esk5_0 )
| ~ ( cQ @ esk3_0 @ esk2_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_31,plain,
! [X2: a] :
( ( cQ @ esk3_0 @ X2 )
| ~ ( epred2_1 @ esk2_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_10]) ).
thf(c_0_32,negated_conjecture,
! [X2: a] :
( ( epred2_1 @ X2 @ esk6_0 )
| ~ ( cQ @ esk3_0 @ esk2_0 )
| ~ ( epred2_1 @ X2 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_29]) ).
thf(c_0_33,negated_conjecture,
( ( cQ @ esk4_0 @ esk5_0 )
| ~ ( cQ @ esk3_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_14])]) ).
thf(c_0_34,plain,
cQ @ esk3_0 @ esk2_0,
inference(spm,[status(thm)],[c_0_31,c_0_10]) ).
thf(c_0_35,plain,
! [X2: a] :
( ( cQ @ X2 @ esk6_0 )
| ~ ( cQ @ esk3_0 @ esk2_0 )
| ~ ( epred2_1 @ X2 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_32]) ).
thf(c_0_36,negated_conjecture,
cQ @ esk4_0 @ esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
thf(c_0_37,negated_conjecture,
( ~ ( cQ @ esk4_0 @ esk6_0 )
| ~ ( cQ @ esk3_0 @ esk2_0 )
| ~ ( cQ @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_38,plain,
! [X2: a] :
( ( cQ @ X2 @ esk6_0 )
| ~ ( epred2_1 @ X2 @ esk5_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_34])]) ).
thf(c_0_39,plain,
! [X2: a] :
( ( epred2_1 @ X2 @ esk5_0 )
| ~ ( epred2_1 @ X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_36]) ).
thf(c_0_40,negated_conjecture,
( ~ ( cQ @ esk3_0 @ esk2_0 )
| ~ ( cQ @ esk4_0 @ esk6_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_14])]) ).
thf(c_0_41,plain,
! [X2: a] :
( ( cQ @ X2 @ esk6_0 )
| ~ ( epred2_1 @ X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
thf(c_0_42,negated_conjecture,
~ ( cQ @ esk4_0 @ esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_34])]) ).
thf(c_0_43,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_10]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEV028^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 18:41:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.51 # Starting new_ho_3 with 300s (1) cores
% 0.21/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.51 # post_as_ho1 with pid 13720 completed with status 0
% 0.21/0.51 # Result found by post_as_ho1
% 0.21/0.51 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHSF-FFSF21-SSSFFSBN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.51 # Starting post_as_ho1 with 151s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_2 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_9 with 136s (1) cores
% 0.21/0.51 # post_as_ho1 with pid 13729 completed with status 0
% 0.21/0.51 # Result found by post_as_ho1
% 0.21/0.51 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHSF-FFSF21-SSSFFSBN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.51 # Starting post_as_ho1 with 151s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 3
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 19
% 0.21/0.52 # Removed in clause preprocessing : 2
% 0.21/0.52 # Initial clauses in saturation : 17
% 0.21/0.52 # Processed clauses : 107
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 12
% 0.21/0.52 # ...remaining for further processing : 95
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 27
% 0.21/0.52 # Generated clauses : 238
% 0.21/0.52 # ...of the previous two non-redundant : 234
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 2
% 0.21/0.52 # Paramodulations : 235
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 51
% 0.21/0.52 # ...of those cached : 39
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 51
% 0.21/0.52 # Positive orientable unit clauses : 12
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 38
% 0.21/0.52 # Current number of unprocessed clauses: 157
% 0.21/0.52 # ...number of literals in the above : 534
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 44
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 489
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 423
% 0.21/0.52 # Non-unit clause-clause subsumptions : 14
% 0.21/0.52 # Unit Clause-clause subsumption calls : 6
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 9
% 0.21/0.52 # BW rewrite match successes : 3
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 5402
% 0.21/0.52 # Search garbage collected termcells : 566
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.015 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.018 s
% 0.21/0.52 # Maximum resident set size: 1840 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.063 s
% 0.21/0.52 # System time : 0.015 s
% 0.21/0.52 # Total time : 0.078 s
% 0.21/0.52 # Maximum resident set size: 1724 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------