TSTP Solution File: SYO248^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO248^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 08:45:15 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 42 ( 10 unt; 14 typ; 0 def)
% Number of atoms : 237 ( 167 equ; 0 cnn)
% Maximal formula atoms : 32 ( 8 avg)
% Number of connectives : 598 ( 90 ~; 67 |; 68 &; 351 @)
% ( 1 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 13 con; 0-2 aty)
% Number of variables : 11 ( 0 ^ 11 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
hh: $i ).
thf(decl_23,type,
h: $i ).
thf(decl_24,type,
ee: $i ).
thf(decl_25,type,
e: $i ).
thf(decl_26,type,
dd: $i ).
thf(decl_27,type,
d: $i ).
thf(decl_28,type,
cc: $i ).
thf(decl_29,type,
c: $i ).
thf(decl_30,type,
bb: $i ).
thf(decl_31,type,
b: $i ).
thf(decl_32,type,
aa: $i ).
thf(decl_33,type,
a: $i ).
thf(decl_34,type,
epred1_1: ( $i > $i > $o ) > $o ).
thf(decl_35,type,
epred2_0: $i > $i > $o ).
thf(cSIXFRIENDS_AGAIN,conjecture,
! [X1: $i > $i > $o] :
( ( ( ( ( ( X1 @ a )
= ( X1 @ aa ) )
& ( ( X1 @ b )
= ( X1 @ bb ) )
& ( ( X1 @ e )
= ( X1 @ hh ) ) )
=> ( ( X1 @ c )
= ( X1 @ dd ) ) )
& ( ( ( ( X1 @ a )
= ( X1 @ aa ) )
& ( ( X1 @ h )
= ( X1 @ hh ) )
& ( ( X1 @ b )
= ( X1 @ cc ) ) )
=> ( ( X1 @ d )
!= ( X1 @ ee ) ) )
& ( ( ( ( X1 @ c )
= ( X1 @ cc ) )
& ( ( X1 @ cc )
= ( X1 @ d ) )
& ( ( X1 @ d )
= ( X1 @ dd ) )
& ( ( X1 @ a )
!= ( X1 @ bb ) ) )
=> ( ( X1 @ e )
!= ( X1 @ hh ) ) )
& ( ( ( ( X1 @ a )
= ( X1 @ aa ) )
& ( ( X1 @ d )
= ( X1 @ dd ) )
& ( ( X1 @ b )
!= ( X1 @ cc ) ) )
=> ( ( X1 @ e )
= ( X1 @ hh ) ) )
& ( ( ( ( X1 @ e )
= ( X1 @ ee ) )
& ( ( X1 @ h )
= ( X1 @ hh ) )
& ( ( X1 @ c )
= ( X1 @ dd ) ) )
=> ( ( X1 @ a )
!= ( X1 @ bb ) ) )
& ( ( ( ( X1 @ b )
= ( X1 @ bb ) )
& ( ( X1 @ bb )
= ( X1 @ c ) )
& ( ( X1 @ c )
= ( X1 @ cc ) )
& ( ( X1 @ e )
!= ( X1 @ hh ) ) )
=> ( ( X1 @ d )
= ( X1 @ ee ) ) ) )
=> ( ( ( X1 @ a )
!= ( X1 @ aa ) )
| ( ( X1 @ b )
!= ( X1 @ bb ) )
| ( ( X1 @ c )
!= ( X1 @ cc ) )
| ( ( X1 @ d )
!= ( X1 @ dd ) )
| ( ( X1 @ e )
!= ( X1 @ ee ) )
| ( ( X1 @ h )
!= ( X1 @ hh ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSIXFRIENDS_AGAIN) ).
thf(c_0_1,plain,
! [X1: $i > $i > $o] :
( ( epred1_1 @ X1 )
<=> ( ( ( ( ( X1 @ a )
= ( X1 @ aa ) )
& ( ( X1 @ b )
= ( X1 @ bb ) )
& ( ( X1 @ e )
= ( X1 @ hh ) ) )
=> ( ( X1 @ c )
= ( X1 @ dd ) ) )
& ( ( ( ( X1 @ a )
= ( X1 @ aa ) )
& ( ( X1 @ h )
= ( X1 @ hh ) )
& ( ( X1 @ b )
= ( X1 @ cc ) ) )
=> ( ( X1 @ d )
!= ( X1 @ ee ) ) )
& ( ( ( ( X1 @ c )
= ( X1 @ cc ) )
& ( ( X1 @ cc )
= ( X1 @ d ) )
& ( ( X1 @ d )
= ( X1 @ dd ) )
& ( ( X1 @ a )
!= ( X1 @ bb ) ) )
=> ( ( X1 @ e )
!= ( X1 @ hh ) ) )
& ( ( ( ( X1 @ a )
= ( X1 @ aa ) )
& ( ( X1 @ d )
= ( X1 @ dd ) )
& ( ( X1 @ b )
!= ( X1 @ cc ) ) )
=> ( ( X1 @ e )
= ( X1 @ hh ) ) )
& ( ( ( ( X1 @ e )
= ( X1 @ ee ) )
& ( ( X1 @ h )
= ( X1 @ hh ) )
& ( ( X1 @ c )
= ( X1 @ dd ) ) )
=> ( ( X1 @ a )
!= ( X1 @ bb ) ) )
& ( ( ( ( X1 @ b )
= ( X1 @ bb ) )
& ( ( X1 @ bb )
= ( X1 @ c ) )
& ( ( X1 @ c )
= ( X1 @ cc ) )
& ( ( X1 @ e )
!= ( X1 @ hh ) ) )
=> ( ( X1 @ d )
= ( X1 @ ee ) ) ) ) ),
introduced(definition) ).
thf(c_0_2,plain,
! [X1: $i > $i > $o] :
( ( epred1_1 @ X1 )
=> ( ( ( ( ( X1 @ a )
= ( X1 @ aa ) )
& ( ( X1 @ b )
= ( X1 @ bb ) )
& ( ( X1 @ e )
= ( X1 @ hh ) ) )
=> ( ( X1 @ c )
= ( X1 @ dd ) ) )
& ( ( ( ( X1 @ a )
= ( X1 @ aa ) )
& ( ( X1 @ h )
= ( X1 @ hh ) )
& ( ( X1 @ b )
= ( X1 @ cc ) ) )
=> ( ( X1 @ d )
!= ( X1 @ ee ) ) )
& ( ( ( ( X1 @ c )
= ( X1 @ cc ) )
& ( ( X1 @ cc )
= ( X1 @ d ) )
& ( ( X1 @ d )
= ( X1 @ dd ) )
& ( ( X1 @ a )
!= ( X1 @ bb ) ) )
=> ( ( X1 @ e )
!= ( X1 @ hh ) ) )
& ( ( ( ( X1 @ a )
= ( X1 @ aa ) )
& ( ( X1 @ d )
= ( X1 @ dd ) )
& ( ( X1 @ b )
!= ( X1 @ cc ) ) )
=> ( ( X1 @ e )
= ( X1 @ hh ) ) )
& ( ( ( ( X1 @ e )
= ( X1 @ ee ) )
& ( ( X1 @ h )
= ( X1 @ hh ) )
& ( ( X1 @ c )
= ( X1 @ dd ) ) )
=> ( ( X1 @ a )
!= ( X1 @ bb ) ) )
& ( ( ( ( X1 @ b )
= ( X1 @ bb ) )
& ( ( X1 @ bb )
= ( X1 @ c ) )
& ( ( X1 @ c )
= ( X1 @ cc ) )
& ( ( X1 @ e )
!= ( X1 @ hh ) ) )
=> ( ( X1 @ d )
= ( X1 @ ee ) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
~ ! [X1: $i > $i > $o] :
( ( epred1_1 @ X1 )
=> ( ( ( X1 @ a )
!= ( X1 @ aa ) )
| ( ( X1 @ b )
!= ( X1 @ bb ) )
| ( ( X1 @ c )
!= ( X1 @ cc ) )
| ( ( X1 @ d )
!= ( X1 @ dd ) )
| ( ( X1 @ e )
!= ( X1 @ ee ) )
| ( ( X1 @ h )
!= ( X1 @ hh ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cSIXFRIENDS_AGAIN])]),c_0_1]) ).
thf(c_0_4,plain,
! [X4: $i > $i > $o] :
( ( ( ( X4 @ a )
!= ( X4 @ aa ) )
| ( ( X4 @ b )
!= ( X4 @ bb ) )
| ( ( X4 @ e )
!= ( X4 @ hh ) )
| ( ( X4 @ c )
= ( X4 @ dd ) )
| ~ ( epred1_1 @ X4 ) )
& ( ( ( X4 @ a )
!= ( X4 @ aa ) )
| ( ( X4 @ h )
!= ( X4 @ hh ) )
| ( ( X4 @ b )
!= ( X4 @ cc ) )
| ( ( X4 @ d )
!= ( X4 @ ee ) )
| ~ ( epred1_1 @ X4 ) )
& ( ( ( X4 @ c )
!= ( X4 @ cc ) )
| ( ( X4 @ cc )
!= ( X4 @ d ) )
| ( ( X4 @ d )
!= ( X4 @ dd ) )
| ( ( X4 @ a )
= ( X4 @ bb ) )
| ( ( X4 @ e )
!= ( X4 @ hh ) )
| ~ ( epred1_1 @ X4 ) )
& ( ( ( X4 @ a )
!= ( X4 @ aa ) )
| ( ( X4 @ d )
!= ( X4 @ dd ) )
| ( ( X4 @ b )
= ( X4 @ cc ) )
| ( ( X4 @ e )
= ( X4 @ hh ) )
| ~ ( epred1_1 @ X4 ) )
& ( ( ( X4 @ e )
!= ( X4 @ ee ) )
| ( ( X4 @ h )
!= ( X4 @ hh ) )
| ( ( X4 @ c )
!= ( X4 @ dd ) )
| ( ( X4 @ a )
!= ( X4 @ bb ) )
| ~ ( epred1_1 @ X4 ) )
& ( ( ( X4 @ b )
!= ( X4 @ bb ) )
| ( ( X4 @ bb )
!= ( X4 @ c ) )
| ( ( X4 @ c )
!= ( X4 @ cc ) )
| ( ( X4 @ e )
= ( X4 @ hh ) )
| ( ( X4 @ d )
= ( X4 @ ee ) )
| ~ ( epred1_1 @ X4 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
thf(c_0_5,negated_conjecture,
( ( epred1_1 @ epred2_0 )
& ( ( epred2_0 @ a )
= ( epred2_0 @ aa ) )
& ( ( epred2_0 @ b )
= ( epred2_0 @ bb ) )
& ( ( epred2_0 @ c )
= ( epred2_0 @ cc ) )
& ( ( epred2_0 @ d )
= ( epred2_0 @ dd ) )
& ( ( epred2_0 @ e )
= ( epred2_0 @ ee ) )
& ( ( epred2_0 @ h )
= ( epred2_0 @ hh ) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(c_0_6,plain,
! [X1: $i > $i > $o] :
( ( ( X1 @ a )
!= ( X1 @ aa ) )
| ( ( X1 @ h )
!= ( X1 @ hh ) )
| ( ( X1 @ b )
!= ( X1 @ cc ) )
| ( ( X1 @ d )
!= ( X1 @ ee ) )
| ~ ( epred1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
epred1_1 @ epred2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
( ( epred2_0 @ h )
= ( epred2_0 @ hh ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( epred2_0 @ e )
= ( epred2_0 @ ee ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
( ( epred2_0 @ b )
= ( epred2_0 @ bb ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_11,negated_conjecture,
( ( epred2_0 @ c )
= ( epred2_0 @ cc ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_12,negated_conjecture,
( ( epred2_0 @ a )
= ( epred2_0 @ aa ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_13,plain,
! [X1: $i > $i > $o] :
( ( ( X1 @ b )
= ( X1 @ cc ) )
| ( ( X1 @ e )
= ( X1 @ hh ) )
| ( ( X1 @ a )
!= ( X1 @ aa ) )
| ( ( X1 @ d )
!= ( X1 @ dd ) )
| ~ ( epred1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_14,negated_conjecture,
( ( epred2_0 @ d )
= ( epred2_0 @ dd ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_15,negated_conjecture,
( ( ( epred2_0 @ d )
!= ( epred2_0 @ e ) )
| ( ( epred2_0 @ bb )
!= ( epred2_0 @ c ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_10]),c_0_11]),c_0_12])]) ).
thf(c_0_16,negated_conjecture,
( ( ( epred2_0 @ bb )
= ( epred2_0 @ c ) )
| ( ( epred2_0 @ e )
= ( epred2_0 @ hh ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_7]),c_0_10]),c_0_11]),c_0_14]),c_0_12])]) ).
thf(c_0_17,plain,
! [X1: $i > $i > $o] :
( ( ( X1 @ c )
= ( X1 @ dd ) )
| ( ( X1 @ a )
!= ( X1 @ aa ) )
| ( ( X1 @ b )
!= ( X1 @ bb ) )
| ( ( X1 @ e )
!= ( X1 @ hh ) )
| ~ ( epred1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_18,plain,
! [X1: $i > $i > $o] :
( ( ( X1 @ e )
= ( X1 @ hh ) )
| ( ( X1 @ d )
= ( X1 @ ee ) )
| ( ( X1 @ b )
!= ( X1 @ bb ) )
| ( ( X1 @ bb )
!= ( X1 @ c ) )
| ( ( X1 @ c )
!= ( X1 @ cc ) )
| ~ ( epred1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_19,negated_conjecture,
( ( ( epred2_0 @ e )
= ( epred2_0 @ hh ) )
| ( ( epred2_0 @ d )
!= ( epred2_0 @ e ) ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_20,plain,
! [X1: $i > $i > $o] :
( ( ( X1 @ e )
!= ( X1 @ ee ) )
| ( ( X1 @ h )
!= ( X1 @ hh ) )
| ( ( X1 @ c )
!= ( X1 @ dd ) )
| ( ( X1 @ a )
!= ( X1 @ bb ) )
| ~ ( epred1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_21,negated_conjecture,
( ( ( epred2_0 @ c )
= ( epred2_0 @ d ) )
| ( ( epred2_0 @ e )
!= ( epred2_0 @ hh ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_7]),c_0_14]),c_0_10]),c_0_12])]) ).
thf(c_0_22,negated_conjecture,
( ( epred2_0 @ e )
= ( epred2_0 @ hh ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_7]),c_0_9]),c_0_11]),c_0_10])]),c_0_16]),c_0_19]) ).
thf(c_0_23,negated_conjecture,
( ( ( epred2_0 @ c )
!= ( epred2_0 @ d ) )
| ( ( epred2_0 @ a )
!= ( epred2_0 @ bb ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_7]),c_0_8]),c_0_9]),c_0_14])]) ).
thf(c_0_24,negated_conjecture,
( ( epred2_0 @ c )
= ( epred2_0 @ d ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
thf(c_0_25,plain,
! [X1: $i > $i > $o] :
( ( ( X1 @ a )
= ( X1 @ bb ) )
| ( ( X1 @ c )
!= ( X1 @ cc ) )
| ( ( X1 @ cc )
!= ( X1 @ d ) )
| ( ( X1 @ d )
!= ( X1 @ dd ) )
| ( ( X1 @ e )
!= ( X1 @ hh ) )
| ~ ( epred1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_26,negated_conjecture,
( ( epred2_0 @ a )
!= ( epred2_0 @ bb ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_7]),c_0_22]),c_0_14]),c_0_11]),c_0_24]),c_0_24]),c_0_11]),c_0_24])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO248^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n004.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.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 09:09:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSMSSMSMSSSNSSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 23847 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: HSMSSMSMSSSNSSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: HGHSF-FFSM00-SSSFFSBN
% 0.20/0.50 # partial match(1): HGHSF-FFSF00-SSSFFSBN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 181s (1) cores
% 0.20/0.50 # ho_unfolding_3 with pid 23855 completed with status 0
% 0.20/0.50 # Result found by ho_unfolding_3
% 0.20/0.50 # Preprocessing class: HSMSSMSMSSSNSSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: HGHSF-FFSM00-SSSFFSBN
% 0.20/0.50 # partial match(1): HGHSF-FFSF00-SSSFFSBN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 13
% 0.20/0.50 # Removed by relevancy pruning/SinE : 12
% 0.20/0.50 # Initial clauses : 13
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 13
% 0.20/0.50 # Processed clauses : 72
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 72
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 3
% 0.20/0.50 # Backward-rewritten : 19
% 0.20/0.50 # Generated clauses : 106
% 0.20/0.50 # ...of the previous two non-redundant : 117
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 2
% 0.20/0.50 # Paramodulations : 13
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 38
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 45
% 0.20/0.50 # ...of those cached : 37
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 21
% 0.20/0.50 # Positive orientable unit clauses : 8
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 12
% 0.20/0.50 # Current number of unprocessed clauses: 66
% 0.20/0.50 # ...number of literals in the above : 227
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 51
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 135
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 86
% 0.20/0.50 # Non-unit clause-clause subsumptions : 2
% 0.20/0.50 # Unit Clause-clause subsumption calls : 10
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 2
% 0.20/0.50 # BW rewrite match successes : 2
% 0.20/0.50 # Condensation attempts : 72
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 5754
% 0.20/0.50 # Search garbage collected termcells : 305
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.011 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.013 s
% 0.20/0.50 # Maximum resident set size: 1804 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.013 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.016 s
% 0.20/0.50 # Maximum resident set size: 1732 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------