TSTP Solution File: GRA030^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRA030^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : Mon May 20 20:41:02 EDT 2024
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of formulae : 38 ( 7 unt; 18 typ; 0 def)
% Number of atoms : 179 ( 5 equ; 0 cnn)
% Maximal formula atoms : 90 ( 8 avg)
% Number of connectives : 651 ( 98 ~; 79 |; 97 &; 367 @)
% ( 1 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 36 ( 11 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 193 ( 193 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 18 usr; 5 con; 0-2 aty)
% Number of variables : 49 ( 0 ^ 47 !; 2 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epred1_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > $o ).
thf(decl_23,type,
epred2_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > $o > $o ).
thf(decl_24,type,
epred3_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > $o > $o ).
thf(decl_25,type,
epred4_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > $o > $o ).
thf(decl_26,type,
epred5_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > $o > $o ).
thf(decl_27,type,
epred6_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > ( $o > $o ) > $o ).
thf(decl_28,type,
epred7_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > $o > $o ).
thf(decl_29,type,
epred8_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > $o > $o ).
thf(decl_30,type,
epred9_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > $o > $o ).
thf(decl_31,type,
epred10_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > $o > $o ).
thf(decl_32,type,
epred11_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > $o > $o ).
thf(decl_33,type,
epred12_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > ( $o > $o ) > $o ).
thf(decl_34,type,
epred13_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > ( $o > $o ) > $o ).
thf(decl_35,type,
epred14_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > ( $o > $o ) > $o ).
thf(decl_36,type,
epred15_1: ( ( $o > $o ) > ( $o > $o ) > $o ) > ( $o > $o ) > $o ).
thf(decl_54,type,
esk17_0: $o ).
thf(decl_55,type,
epred17_0: $o ).
thf(decl_56,type,
epred18_0: $o ).
thf(ramsey_l_2_5_4,conjecture,
? [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X2: $o > $o,X3: $o > $o] :
( ( X1 @ X2 @ X3 )
=> ( X1 @ X3 @ X2 ) )
& ! [X4: $o > $o,X5: $o > $o,X6: ( $o > $o ) > $o] :
( ( ( X6 @ X4 )
& ~ ( X6 @ X5 ) )
=> ~ ( X1 @ X5 @ X4 ) )
& ! [X4: $o > $o,X5: $o > $o,X7: $o > $o,X8: $o > $o,X9: $o > $o,X6: ( $o > $o ) > $o,X10: ( $o > $o ) > $o,X11: ( $o > $o ) > $o,X12: ( $o > $o ) > $o] :
( ( ( X6 @ X4 )
& ~ ( X6 @ X5 )
& ~ ( X6 @ X7 )
& ~ ( X6 @ X8 )
& ~ ( X6 @ X9 )
& ~ ( X10 @ X4 )
& ( X10 @ X5 )
& ~ ( X10 @ X7 )
& ~ ( X10 @ X8 )
& ~ ( X10 @ X9 )
& ~ ( X11 @ X4 )
& ~ ( X11 @ X5 )
& ( X11 @ X7 )
& ~ ( X11 @ X8 )
& ~ ( X11 @ X9 )
& ~ ( X12 @ X4 )
& ~ ( X12 @ X5 )
& ~ ( X12 @ X7 )
& ( X12 @ X8 )
& ~ ( X12 @ X9 ) )
=> ( ( X1 @ X5 @ X4 )
| ( X1 @ X7 @ X4 )
| ( X1 @ X7 @ X5 )
| ( X1 @ X8 @ X4 )
| ( X1 @ X8 @ X5 )
| ( X1 @ X8 @ X7 )
| ( X1 @ X9 @ X4 )
| ( X1 @ X9 @ X5 )
| ( X1 @ X9 @ X7 )
| ( X1 @ X9 @ X8 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ramsey_l_2_5_4) ).
thf(c_0_1,plain,
! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ( epred1_1 @ X1 )
<=> ! [X4: $o > $o,X5: $o > $o,X7: $o > $o,X8: $o > $o,X9: $o > $o,X6: ( $o > $o ) > $o,X10: ( $o > $o ) > $o,X11: ( $o > $o ) > $o,X12: ( $o > $o ) > $o] :
( ( ( X6 @ X4 )
& ~ ( X6 @ X5 )
& ~ ( X6 @ X7 )
& ~ ( X6 @ X8 )
& ~ ( X6 @ X9 )
& ~ ( X10 @ X4 )
& ( X10 @ X5 )
& ~ ( X10 @ X7 )
& ~ ( X10 @ X8 )
& ~ ( X10 @ X9 )
& ~ ( X11 @ X4 )
& ~ ( X11 @ X5 )
& ( X11 @ X7 )
& ~ ( X11 @ X8 )
& ~ ( X11 @ X9 )
& ~ ( X12 @ X4 )
& ~ ( X12 @ X5 )
& ~ ( X12 @ X7 )
& ( X12 @ X8 )
& ~ ( X12 @ X9 ) )
=> ( ( X1 @ X5 @ X4 )
| ( X1 @ X7 @ X4 )
| ( X1 @ X7 @ X5 )
| ( X1 @ X8 @ X4 )
| ( X1 @ X8 @ X5 )
| ( X1 @ X8 @ X7 )
| ( X1 @ X9 @ X4 )
| ( X1 @ X9 @ X5 )
| ( X1 @ X9 @ X7 )
| ( X1 @ X9 @ X8 ) ) ) ),
introduced(definition) ).
thf(c_0_2,plain,
! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X4: $o > $o,X5: $o > $o,X7: $o > $o,X8: $o > $o,X9: $o > $o,X6: ( $o > $o ) > $o,X10: ( $o > $o ) > $o,X11: ( $o > $o ) > $o,X12: ( $o > $o ) > $o] :
( ( ( X6 @ X4 )
& ~ ( X6 @ X5 )
& ~ ( X6 @ X7 )
& ~ ( X6 @ X8 )
& ~ ( X6 @ X9 )
& ~ ( X10 @ X4 )
& ( X10 @ X5 )
& ~ ( X10 @ X7 )
& ~ ( X10 @ X8 )
& ~ ( X10 @ X9 )
& ~ ( X11 @ X4 )
& ~ ( X11 @ X5 )
& ( X11 @ X7 )
& ~ ( X11 @ X8 )
& ~ ( X11 @ X9 )
& ~ ( X12 @ X4 )
& ~ ( X12 @ X5 )
& ~ ( X12 @ X7 )
& ( X12 @ X8 )
& ~ ( X12 @ X9 ) )
=> ( ( X1 @ X5 @ X4 )
| ( X1 @ X7 @ X4 )
| ( X1 @ X7 @ X5 )
| ( X1 @ X8 @ X4 )
| ( X1 @ X8 @ X5 )
| ( X1 @ X8 @ X7 )
| ( X1 @ X9 @ X4 )
| ( X1 @ X9 @ X5 )
| ( X1 @ X9 @ X7 )
| ( X1 @ X9 @ X8 ) ) )
=> ( epred1_1 @ X1 ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
thf(c_0_3,plain,
! [X34: ( $o > $o ) > ( $o > $o ) > $o] :
( ( ( epred12_1 @ X34 @ ( epred7_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred12_1 @ X34 @ ( epred8_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred12_1 @ X34 @ ( epred9_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred12_1 @ X34 @ ( epred10_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred12_1 @ X34 @ ( epred11_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred13_1 @ X34 @ ( epred7_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ( epred13_1 @ X34 @ ( epred8_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred13_1 @ X34 @ ( epred9_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred13_1 @ X34 @ ( epred10_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred13_1 @ X34 @ ( epred11_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred14_1 @ X34 @ ( epred7_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred14_1 @ X34 @ ( epred8_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ( epred14_1 @ X34 @ ( epred9_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred14_1 @ X34 @ ( epred10_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred14_1 @ X34 @ ( epred11_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred15_1 @ X34 @ ( epred7_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred15_1 @ X34 @ ( epred8_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred15_1 @ X34 @ ( epred9_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ( epred15_1 @ X34 @ ( epred10_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( epred15_1 @ X34 @ ( epred11_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( X34 @ ( epred8_1 @ X34 ) @ ( epred7_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( X34 @ ( epred9_1 @ X34 ) @ ( epred7_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( X34 @ ( epred9_1 @ X34 ) @ ( epred8_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( X34 @ ( epred10_1 @ X34 ) @ ( epred7_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( X34 @ ( epred10_1 @ X34 ) @ ( epred8_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( X34 @ ( epred10_1 @ X34 ) @ ( epred9_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( X34 @ ( epred11_1 @ X34 ) @ ( epred7_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( X34 @ ( epred11_1 @ X34 ) @ ( epred8_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( X34 @ ( epred11_1 @ X34 ) @ ( epred9_1 @ X34 ) )
| ( epred1_1 @ X34 ) )
& ( ~ ( X34 @ ( epred11_1 @ X34 ) @ ( epred10_1 @ X34 ) )
| ( epred1_1 @ X34 ) ) ),
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_2])])])])]) ).
thf(c_0_4,negated_conjecture,
~ ? [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X2: $o > $o,X3: $o > $o] :
( ( X1 @ X2 @ X3 )
=> ( X1 @ X3 @ X2 ) )
& ! [X4: $o > $o,X5: $o > $o,X6: ( $o > $o ) > $o] :
( ( ( X6 @ X4 )
& ~ ( X6 @ X5 ) )
=> ~ ( X1 @ X5 @ X4 ) )
& ( epred1_1 @ X1 ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[ramsey_l_2_5_4]),c_0_1]) ).
thf(c_0_5,plain,
! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ( epred1_1 @ X1 )
| ~ ( epred12_1 @ X1 @ ( epred8_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ( epred12_1 @ X1 @ ( epred7_1 @ X1 ) )
| ( epred1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,plain,
! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ( epred1_1 @ X1 )
| ~ ( X1 @ ( epred8_1 @ X1 ) @ ( epred7_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
! [X28: ( $o > $o ) > ( $o > $o ) > $o] :
( ( ( epred6_1 @ X28 @ ( epred4_1 @ X28 ) )
| ( X28 @ ( epred2_1 @ X28 ) @ ( epred3_1 @ X28 ) )
| ~ ( epred1_1 @ X28 ) )
& ( ~ ( epred6_1 @ X28 @ ( epred5_1 @ X28 ) )
| ( X28 @ ( epred2_1 @ X28 ) @ ( epred3_1 @ X28 ) )
| ~ ( epred1_1 @ X28 ) )
& ( ( X28 @ ( epred5_1 @ X28 ) @ ( epred4_1 @ X28 ) )
| ( X28 @ ( epred2_1 @ X28 ) @ ( epred3_1 @ X28 ) )
| ~ ( epred1_1 @ X28 ) )
& ( ( epred6_1 @ X28 @ ( epred4_1 @ X28 ) )
| ~ ( X28 @ ( epred3_1 @ X28 ) @ ( epred2_1 @ X28 ) )
| ~ ( epred1_1 @ X28 ) )
& ( ~ ( epred6_1 @ X28 @ ( epred5_1 @ X28 ) )
| ~ ( X28 @ ( epred3_1 @ X28 ) @ ( epred2_1 @ X28 ) )
| ~ ( epred1_1 @ X28 ) )
& ( ( X28 @ ( epred5_1 @ X28 ) @ ( epred4_1 @ X28 ) )
| ~ ( X28 @ ( epred3_1 @ X28 ) @ ( epred2_1 @ X28 ) )
| ~ ( epred1_1 @ X28 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
thf(c_0_9,plain,
! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ( epred1_1 @ X1 )
| ( ( epred8_1 @ X1 )
!= ( epred7_1 @ X1 ) ) ),
inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_5,c_0_6])]) ).
thf(c_0_10,plain,
( ( ( epred8_1 @ $neq )
= ( epred7_1 @ $neq ) )
| ( epred1_1 @ $neq ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ( X1 @ ( epred5_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ~ ( X1 @ ( epred3_1 @ X1 ) @ ( epred2_1 @ X1 ) )
| ~ ( epred1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
epred1_1 @ $neq,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ( X1 @ ( epred5_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ( X1 @ ( epred2_1 @ X1 ) @ ( epred3_1 @ X1 ) )
| ~ ( epred1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,negated_conjecture,
( ( ( epred3_1 @ $neq )
= ( epred2_1 @ $neq ) )
| ( ( epred5_1 @ $neq )
!= ( epred4_1 @ $neq ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_11]),c_0_12])]) ).
thf(c_0_15,negated_conjecture,
( ( epred5_1 @ $neq )
!= ( epred4_1 @ $neq ) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_13]),c_0_12])]),c_0_14]) ).
thf(c_0_16,negated_conjecture,
( ( epred5_1 @ $neq @ esk17_0 )
<~> ( epred4_1 @ $neq @ esk17_0 ) ),
inference(neg_ext,[status(thm)],[c_0_15]) ).
thf(c_0_17,negated_conjecture,
epred17_0,
inference(dynamic_cnf,[status(thm)],[c_0_16]) ).
thf(c_0_18,negated_conjecture,
epred18_0,
inference(dynamic_cnf,[status(thm)],[c_0_16]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_16]),c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRA030^1 : TPTP v8.2.0. Released v3.6.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n018.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Sat May 18 12:34:52 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.15/0.42 Running higher-order theorem proving
% 0.15/0.42 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.15/0.45 # Version: 3.1.0-ho
% 0.15/0.45 # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.15/0.45 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting full_lambda_6 with 900s (3) cores
% 0.15/0.45 # Starting post_as_ho1 with 300s (1) cores
% 0.15/0.45 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.15/0.45 # Starting ho_unfolding_1 with 300s (1) cores
% 0.15/0.45 # Starting new_ho_10_unif with 300s (1) cores
% 0.15/0.45 # Starting ho_unfolding_2 with 300s (1) cores
% 0.15/0.45 # ho_unfolding_2 with pid 18222 completed with status 0
% 0.15/0.45 # Result found by ho_unfolding_2
% 0.15/0.45 # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.15/0.45 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting full_lambda_6 with 900s (3) cores
% 0.15/0.45 # Starting post_as_ho1 with 300s (1) cores
% 0.15/0.45 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.15/0.45 # Starting ho_unfolding_1 with 300s (1) cores
% 0.15/0.45 # Starting new_ho_10_unif with 300s (1) cores
% 0.15/0.45 # Starting ho_unfolding_2 with 300s (1) cores
% 0.15/0.45 # No SInE strategy applied
% 0.15/0.45 # Search class: HGHNF-FFMF00-SHHFFSBN
% 0.15/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting sh2lt with 62s (1) cores
% 0.15/0.45 # sh2lt with pid 18225 completed with status 0
% 0.15/0.45 # Result found by sh2lt
% 0.15/0.45 # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.15/0.45 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting full_lambda_6 with 900s (3) cores
% 0.15/0.45 # Starting post_as_ho1 with 300s (1) cores
% 0.15/0.45 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.15/0.45 # Starting ho_unfolding_1 with 300s (1) cores
% 0.15/0.45 # Starting new_ho_10_unif with 300s (1) cores
% 0.15/0.45 # Starting ho_unfolding_2 with 300s (1) cores
% 0.15/0.45 # No SInE strategy applied
% 0.15/0.45 # Search class: HGHNF-FFMF00-SHHFFSBN
% 0.15/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting sh2lt with 62s (1) cores
% 0.15/0.45 # Preprocessing time : 0.001 s
% 0.15/0.45 # Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 # Proof found!
% 0.15/0.45 # SZS status Theorem
% 0.15/0.45 # SZS output start CNFRefutation
% See solution above
% 0.15/0.45 # Parsed axioms : 1
% 0.15/0.45 # Removed by relevancy pruning/SinE : 0
% 0.15/0.45 # Initial clauses : 36
% 0.15/0.45 # Removed in clause preprocessing : 0
% 0.15/0.45 # Initial clauses in saturation : 36
% 0.15/0.45 # Processed clauses : 157
% 0.15/0.45 # ...of these trivial : 14
% 0.15/0.45 # ...subsumed : 36
% 0.15/0.45 # ...remaining for further processing : 106
% 0.15/0.45 # Other redundant clauses eliminated : 20
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 2
% 0.15/0.45 # Backward-rewritten : 1
% 0.15/0.45 # Generated clauses : 362
% 0.15/0.45 # ...of the previous two non-redundant : 267
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 2
% 0.15/0.45 # Paramodulations : 11
% 0.15/0.45 # Factorizations : 0
% 0.15/0.45 # NegExts : 17
% 0.15/0.45 # Equation resolutions : 20
% 0.15/0.45 # Disequality decompositions : 0
% 0.15/0.45 # Total rewrite steps : 47
% 0.15/0.45 # ...of those cached : 40
% 0.15/0.45 # Propositional unsat checks : 0
% 0.15/0.45 # Propositional check models : 0
% 0.15/0.45 # Propositional check unsatisfiable : 0
% 0.15/0.45 # Propositional clauses : 0
% 0.15/0.45 # Propositional clauses after purity: 0
% 0.15/0.45 # Propositional unsat core size : 0
% 0.15/0.45 # Propositional preprocessing time : 0.000
% 0.15/0.45 # Propositional encoding time : 0.000
% 0.15/0.45 # Propositional solver time : 0.000
% 0.15/0.45 # Success case prop preproc time : 0.000
% 0.15/0.45 # Success case prop encoding time : 0.000
% 0.15/0.45 # Success case prop solver time : 0.000
% 0.15/0.45 # Current number of processed clauses : 62
% 0.15/0.45 # Positive orientable unit clauses : 7
% 0.15/0.45 # Positive unorientable unit clauses: 0
% 0.15/0.45 # Negative unit clauses : 3
% 0.15/0.45 # Non-unit-clauses : 52
% 0.15/0.45 # Current number of unprocessed clauses: 182
% 0.15/0.45 # ...number of literals in the above : 534
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 44
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 283
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 238
% 0.15/0.45 # Non-unit clause-clause subsumptions : 14
% 0.15/0.45 # Unit Clause-clause subsumption calls : 229
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 1
% 0.15/0.45 # BW rewrite match successes : 1
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 21472
% 0.15/0.45 # Search garbage collected termcells : 853
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.013 s
% 0.15/0.45 # System time : 0.003 s
% 0.15/0.45 # Total time : 0.017 s
% 0.15/0.45 # Maximum resident set size: 1904 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.014 s
% 0.15/0.45 # System time : 0.007 s
% 0.15/0.45 # Total time : 0.021 s
% 0.15/0.45 # Maximum resident set size: 1724 pages
% 0.15/0.45 % E---3.1 exiting
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------