TSTP Solution File: SEV063^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV063^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:30 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of formulae : 53 ( 10 unt; 16 typ; 0 def)
% Number of atoms : 101 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 614 ( 38 ~; 76 |; 28 &; 452 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 78 ( 78 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 15 usr; 4 con; 0-2 aty)
% Number of variables : 72 ( 0 ^ 72 !; 0 ?; 72 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > a > $o ).
thf(decl_23,type,
esk1_0: a ).
thf(decl_24,type,
esk2_0: a ).
thf(decl_25,type,
esk3_0: a ).
thf(decl_26,type,
esk4_1: ( a > a > $o ) > a ).
thf(decl_27,type,
esk5_1: ( a > a > $o ) > a ).
thf(decl_28,type,
esk6_1: ( a > a > $o ) > a ).
thf(decl_29,type,
esk7_1: ( a > a > $o ) > a ).
thf(decl_30,type,
esk8_1: ( a > a > $o ) > a ).
thf(decl_31,type,
esk9_1: ( a > a > $o ) > a ).
thf(decl_32,type,
esk10_1: ( a > a > $o ) > a ).
thf(decl_33,type,
esk11_1: ( a > a > $o ) > a ).
thf(decl_34,type,
esk12_1: ( a > a > $o ) > a ).
thf(decl_35,type,
esk13_1: ( a > a > $o ) > a ).
thf(decl_36,type,
epred2_0: a > a > $o ).
thf(cTHM136_pme,conjecture,
! [X1: a > a > $o,X2: a,X3: a,X4: a] :
( ( ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a] :
( ( X1 @ X6 @ X7 )
=> ( X5 @ X6 @ X7 ) )
& ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) ) )
=> ( X5 @ X2 @ X3 ) )
& ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a] :
( ( X1 @ X6 @ X7 )
=> ( X5 @ X6 @ X7 ) )
& ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) ) )
=> ( X5 @ X3 @ X4 ) ) )
=> ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a] :
( ( X1 @ X6 @ X7 )
=> ( X5 @ X6 @ X7 ) )
& ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) ) )
=> ( X5 @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM136_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > $o,X2: a,X3: a,X4: a] :
( ( ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a] :
( ( X1 @ X6 @ X7 )
=> ( X5 @ X6 @ X7 ) )
& ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) ) )
=> ( X5 @ X2 @ X3 ) )
& ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a] :
( ( X1 @ X6 @ X7 )
=> ( X5 @ X6 @ X7 ) )
& ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) ) )
=> ( X5 @ X3 @ X4 ) ) )
=> ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a] :
( ( X1 @ X6 @ X7 )
=> ( X5 @ X6 @ X7 ) )
& ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) ) )
=> ( X5 @ X2 @ X4 ) ) ),
inference(assume_negation,[status(cth)],[cTHM136_pme]) ).
thf(c_0_2,negated_conjecture,
! [X35: a > a > $o,X41: a > a > $o,X48: a,X49: a,X50: a,X51: a,X52: a] :
( ( ( X35 @ ( esk6_1 @ X35 ) @ ( esk7_1 @ X35 ) )
| ( epred1_0 @ ( esk4_1 @ X35 ) @ ( esk5_1 @ X35 ) )
| ( X35 @ esk1_0 @ esk2_0 ) )
& ( ( X35 @ ( esk7_1 @ X35 ) @ ( esk8_1 @ X35 ) )
| ( epred1_0 @ ( esk4_1 @ X35 ) @ ( esk5_1 @ X35 ) )
| ( X35 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X35 @ ( esk6_1 @ X35 ) @ ( esk8_1 @ X35 ) )
| ( epred1_0 @ ( esk4_1 @ X35 ) @ ( esk5_1 @ X35 ) )
| ( X35 @ esk1_0 @ esk2_0 ) )
& ( ( X35 @ ( esk6_1 @ X35 ) @ ( esk7_1 @ X35 ) )
| ~ ( X35 @ ( esk4_1 @ X35 ) @ ( esk5_1 @ X35 ) )
| ( X35 @ esk1_0 @ esk2_0 ) )
& ( ( X35 @ ( esk7_1 @ X35 ) @ ( esk8_1 @ X35 ) )
| ~ ( X35 @ ( esk4_1 @ X35 ) @ ( esk5_1 @ X35 ) )
| ( X35 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X35 @ ( esk6_1 @ X35 ) @ ( esk8_1 @ X35 ) )
| ~ ( X35 @ ( esk4_1 @ X35 ) @ ( esk5_1 @ X35 ) )
| ( X35 @ esk1_0 @ esk2_0 ) )
& ( ( X41 @ ( esk11_1 @ X41 ) @ ( esk12_1 @ X41 ) )
| ( epred1_0 @ ( esk9_1 @ X41 ) @ ( esk10_1 @ X41 ) )
| ( X41 @ esk2_0 @ esk3_0 ) )
& ( ( X41 @ ( esk12_1 @ X41 ) @ ( esk13_1 @ X41 ) )
| ( epred1_0 @ ( esk9_1 @ X41 ) @ ( esk10_1 @ X41 ) )
| ( X41 @ esk2_0 @ esk3_0 ) )
& ( ~ ( X41 @ ( esk11_1 @ X41 ) @ ( esk13_1 @ X41 ) )
| ( epred1_0 @ ( esk9_1 @ X41 ) @ ( esk10_1 @ X41 ) )
| ( X41 @ esk2_0 @ esk3_0 ) )
& ( ( X41 @ ( esk11_1 @ X41 ) @ ( esk12_1 @ X41 ) )
| ~ ( X41 @ ( esk9_1 @ X41 ) @ ( esk10_1 @ X41 ) )
| ( X41 @ esk2_0 @ esk3_0 ) )
& ( ( X41 @ ( esk12_1 @ X41 ) @ ( esk13_1 @ X41 ) )
| ~ ( X41 @ ( esk9_1 @ X41 ) @ ( esk10_1 @ X41 ) )
| ( X41 @ esk2_0 @ esk3_0 ) )
& ( ~ ( X41 @ ( esk11_1 @ X41 ) @ ( esk13_1 @ X41 ) )
| ~ ( X41 @ ( esk9_1 @ X41 ) @ ( esk10_1 @ X41 ) )
| ( X41 @ esk2_0 @ esk3_0 ) )
& ( ~ ( epred1_0 @ X48 @ X49 )
| ( epred2_0 @ X48 @ X49 ) )
& ( ~ ( epred2_0 @ X50 @ X51 )
| ~ ( epred2_0 @ X51 @ X52 )
| ( epred2_0 @ X50 @ X52 ) )
& ~ ( epred2_0 @ esk1_0 @ esk3_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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X2: a,X3: a,X4: a] :
( ( epred2_0 @ X2 @ X4 )
| ~ ( epred2_0 @ X2 @ X3 )
| ~ ( epred2_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: a > a > $o] :
( ( X1 @ ( esk12_1 @ X1 ) @ ( esk13_1 @ X1 ) )
| ( epred1_0 @ ( esk9_1 @ X1 ) @ ( esk10_1 @ X1 ) )
| ( X1 @ esk2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: a > a > $o] :
( ( X1 @ ( esk12_1 @ X1 ) @ ( esk13_1 @ X1 ) )
| ( X1 @ esk2_0 @ esk3_0 )
| ~ ( X1 @ ( esk9_1 @ X1 ) @ ( esk10_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X2: a,X3: a] :
( ( epred2_0 @ X2 @ X3 )
| ~ ( epred1_0 @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X2: a] :
( ( epred1_0 @ ( esk9_1 @ epred2_0 ) @ ( esk10_1 @ epred2_0 ) )
| ( epred2_0 @ X2 @ ( esk13_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 )
| ~ ( epred2_0 @ X2 @ ( esk12_1 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: a > a > $o] :
( ( X1 @ ( esk11_1 @ X1 ) @ ( esk12_1 @ X1 ) )
| ( epred1_0 @ ( esk9_1 @ X1 ) @ ( esk10_1 @ X1 ) )
| ( X1 @ esk2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X1: a > a > $o] :
( ( epred1_0 @ ( esk9_1 @ X1 ) @ ( esk10_1 @ X1 ) )
| ( X1 @ esk2_0 @ esk3_0 )
| ~ ( X1 @ ( esk11_1 @ X1 ) @ ( esk13_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
( ( epred2_0 @ ( esk12_1 @ epred2_0 ) @ ( esk13_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ ( esk9_1 @ epred2_0 ) @ ( esk10_1 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_11,negated_conjecture,
( ( epred1_0 @ ( esk9_1 @ epred2_0 ) @ ( esk10_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X1: a > a > $o] :
( ( X1 @ ( esk11_1 @ X1 ) @ ( esk12_1 @ X1 ) )
| ( X1 @ esk2_0 @ esk3_0 )
| ~ ( X1 @ ( esk9_1 @ X1 ) @ ( esk10_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
! [X1: a > a > $o] :
( ( X1 @ ( esk7_1 @ X1 ) @ ( esk8_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
! [X1: a > a > $o] :
( ( X1 @ ( esk7_1 @ X1 ) @ ( esk8_1 @ X1 ) )
| ( epred1_0 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
( ( epred2_0 @ ( esk12_1 @ epred2_0 ) @ ( esk13_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_16,negated_conjecture,
( ( epred2_0 @ ( esk11_1 @ epred2_0 ) @ ( esk12_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ ( esk9_1 @ epred2_0 ) @ ( esk10_1 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
thf(c_0_17,negated_conjecture,
( ( epred2_0 @ ( esk7_1 @ epred2_0 ) @ ( esk8_1 @ epred2_0 ) )
| ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_6]),c_0_14]) ).
thf(c_0_18,negated_conjecture,
! [X1: a > a > $o] :
( ( X1 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_19,negated_conjecture,
! [X1: a > a > $o] :
( ( X1 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ( epred1_0 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_20,negated_conjecture,
! [X2: a] :
( ( epred2_0 @ X2 @ ( esk13_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 )
| ~ ( epred2_0 @ X2 @ ( esk12_1 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_3,c_0_15]) ).
thf(c_0_21,negated_conjecture,
( ( epred2_0 @ ( esk11_1 @ epred2_0 ) @ ( esk12_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
thf(c_0_22,negated_conjecture,
! [X2: a] :
( ( epred2_0 @ X2 @ ( esk8_1 @ epred2_0 ) )
| ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ X2 @ ( esk7_1 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_3,c_0_17]) ).
thf(c_0_23,negated_conjecture,
( ( epred2_0 @ ( esk6_1 @ epred2_0 ) @ ( esk7_1 @ epred2_0 ) )
| ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_6]),c_0_19]) ).
thf(c_0_24,negated_conjecture,
! [X1: a > a > $o] :
( ( X1 @ esk2_0 @ esk3_0 )
| ~ ( X1 @ ( esk11_1 @ X1 ) @ ( esk13_1 @ X1 ) )
| ~ ( X1 @ ( esk9_1 @ X1 ) @ ( esk10_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_25,negated_conjecture,
( ( epred2_0 @ ( esk11_1 @ epred2_0 ) @ ( esk13_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_26,negated_conjecture,
! [X1: a > a > $o] :
( ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk6_1 @ X1 ) @ ( esk8_1 @ X1 ) )
| ~ ( X1 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_27,negated_conjecture,
( ( epred2_0 @ ( esk6_1 @ epred2_0 ) @ ( esk8_1 @ epred2_0 ) )
| ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_28,negated_conjecture,
( ( epred2_0 @ esk2_0 @ esk3_0 )
| ~ ( epred2_0 @ ( esk9_1 @ epred2_0 ) @ ( esk10_1 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_29,negated_conjecture,
( ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ ( esk4_1 @ epred2_0 ) @ ( esk5_1 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_30,negated_conjecture,
epred2_0 @ esk2_0 @ esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_6]),c_0_11]) ).
thf(c_0_31,negated_conjecture,
! [X1: a > a > $o] :
( ( epred1_0 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk6_1 @ X1 ) @ ( esk8_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_32,negated_conjecture,
( ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ ( esk4_1 @ epred2_0 ) @ ( esk5_1 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_29,c_0_6]) ).
thf(c_0_33,negated_conjecture,
~ ( epred2_0 @ esk1_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_34,negated_conjecture,
! [X2: a] :
( ( epred2_0 @ X2 @ esk3_0 )
| ~ ( epred2_0 @ X2 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_30]) ).
thf(c_0_35,negated_conjecture,
epred2_0 @ esk1_0 @ esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_27]),c_0_32]) ).
thf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV063^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 19:11:52 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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: HSMSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho1 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_3 with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.49 # post_as_ho1 with pid 7605 completed with status 0
% 0.20/0.49 # Result found by post_as_ho1
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho1 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGUNF-FFSF11-SSSFFMBN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 811s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 151s (1) cores
% 0.20/0.49 # Starting sh2l with 136s (1) cores
% 0.20/0.49 # Starting lpo1_def_fix with 136s (1) cores
% 0.20/0.49 # Starting ehoh_best3_rw with 136s (1) cores
% 0.20/0.49 # post_as_ho1 with pid 7612 completed with status 0
% 0.20/0.49 # Result found by post_as_ho1
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho1 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGUNF-FFSF11-SSSFFMBN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 811s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 151s (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 : 2
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 16
% 0.20/0.49 # Removed in clause preprocessing : 1
% 0.20/0.49 # Initial clauses in saturation : 15
% 0.20/0.49 # Processed clauses : 92
% 0.20/0.49 # ...of these trivial : 3
% 0.20/0.49 # ...subsumed : 9
% 0.20/0.49 # ...remaining for further processing : 80
% 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 : 11
% 0.20/0.49 # Backward-rewritten : 23
% 0.20/0.49 # Generated clauses : 99
% 0.20/0.49 # ...of the previous two non-redundant : 91
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 6
% 0.20/0.49 # Paramodulations : 96
% 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 : 32
% 0.20/0.49 # ...of those cached : 30
% 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 : 31
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 3
% 0.20/0.49 # Non-unit-clauses : 26
% 0.20/0.49 # Current number of unprocessed clauses: 15
% 0.20/0.49 # ...number of literals in the above : 58
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 49
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 920
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 797
% 0.20/0.49 # Non-unit clause-clause subsumptions : 25
% 0.20/0.49 # Unit Clause-clause subsumption calls : 35
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 2
% 0.20/0.49 # BW rewrite match successes : 2
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3979
% 0.20/0.49 # Search garbage collected termcells : 444
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.011 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.014 s
% 0.20/0.49 # Maximum resident set size: 1832 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.049 s
% 0.20/0.49 # System time : 0.010 s
% 0.20/0.49 # Total time : 0.059 s
% 0.20/0.49 # Maximum resident set size: 1716 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------