TSTP Solution File: SYO499^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO499^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:46:25 EDT 2024
% Result : Theorem 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 34 ( 4 unt; 9 typ; 0 def)
% Number of atoms : 772 ( 174 equ; 0 cnn)
% Maximal formula atoms : 306 ( 30 avg)
% Number of connectives : 1017 ( 270 ~; 295 |; 104 &; 348 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 89 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
a: $o ).
thf(decl_23,type,
b: $o ).
thf(decl_24,type,
c: $o ).
thf(decl_25,type,
f: $o > $i ).
thf(decl_26,type,
f1: $o > $i ).
thf(decl_27,type,
f2: $o > $i ).
thf(decl_28,type,
g: $o > $i ).
thf(decl_29,type,
g1: $o > $i ).
thf(decl_30,type,
g2: $o > $i ).
thf(con,conjecture,
( ( ( f @ a )
= ( g @ b ) )
| ( ( f @ b )
!= ( g @ a ) )
| ( ( f1 @ a )
= ( g1 @ c ) )
| ( ( f1 @ c )
!= ( g1 @ a ) )
| ( ( f2 @ b )
= ( g2 @ c ) )
| ( ( f2 @ c )
!= ( g2 @ b ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(c_0_1,negated_conjecture,
~ ( ( ( ~ a
| ( ( ~ b
| ( ( f @ $true )
= ( g @ $true ) ) )
& ( b
| ( ( f @ $true )
= ( g @ $false ) ) ) ) )
& ( a
| ( ( ~ b
| ( ( f @ $false )
= ( g @ $true ) ) )
& ( b
| ( ( f @ $false )
= ( g @ $false ) ) ) ) ) )
| ~ ( ( ~ b
| ( ( ~ a
| ( ( f @ $true )
= ( g @ $true ) ) )
& ( a
| ( ( f @ $true )
= ( g @ $false ) ) ) ) )
& ( b
| ( ( ~ a
| ( ( f @ $false )
= ( g @ $true ) ) )
& ( a
| ( ( f @ $false )
= ( g @ $false ) ) ) ) ) )
| ( ( ~ a
| ( ( ~ c
| ( ( f1 @ $true )
= ( g1 @ $true ) ) )
& ( c
| ( ( f1 @ $true )
= ( g1 @ $false ) ) ) ) )
& ( a
| ( ( ~ c
| ( ( f1 @ $false )
= ( g1 @ $true ) ) )
& ( c
| ( ( f1 @ $false )
= ( g1 @ $false ) ) ) ) ) )
| ~ ( ( ~ c
| ( ( ~ a
| ( ( f1 @ $true )
= ( g1 @ $true ) ) )
& ( a
| ( ( f1 @ $true )
= ( g1 @ $false ) ) ) ) )
& ( c
| ( ( ~ a
| ( ( f1 @ $false )
= ( g1 @ $true ) ) )
& ( a
| ( ( f1 @ $false )
= ( g1 @ $false ) ) ) ) ) )
| ( ( ~ b
| ( ( ~ c
| ( ( f2 @ $true )
= ( g2 @ $true ) ) )
& ( c
| ( ( f2 @ $true )
= ( g2 @ $false ) ) ) ) )
& ( b
| ( ( ~ c
| ( ( f2 @ $false )
= ( g2 @ $true ) ) )
& ( c
| ( ( f2 @ $false )
= ( g2 @ $false ) ) ) ) ) )
| ~ ( ( ~ c
| ( ( ~ b
| ( ( f2 @ $true )
= ( g2 @ $true ) ) )
& ( b
| ( ( f2 @ $true )
= ( g2 @ $false ) ) ) ) )
& ( c
| ( ( ~ b
| ( ( f2 @ $false )
= ( g2 @ $true ) ) )
& ( b
| ( ( f2 @ $false )
= ( g2 @ $false ) ) ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_2,negated_conjecture,
( ( ~ a
| a )
& ( ~ b
| b
| a )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| b
| a )
& ( ~ b
| ( ( f @ $false )
!= ( g @ $true ) )
| a )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| ( ( f @ $false )
!= ( g @ $true ) )
| a )
& ( ~ a
| ~ b
| b )
& ( ~ b
| b
| ~ b
| b )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| b
| ~ b
| b )
& ( ~ b
| ( ( f @ $false )
!= ( g @ $true ) )
| ~ b
| b )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| ( ( f @ $false )
!= ( g @ $true ) )
| ~ b
| b )
& ( ~ a
| ( ( f @ $true )
!= ( g @ $false ) )
| b )
& ( ~ b
| b
| ( ( f @ $true )
!= ( g @ $false ) )
| b )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| b
| ( ( f @ $true )
!= ( g @ $false ) )
| b )
& ( ~ b
| ( ( f @ $false )
!= ( g @ $true ) )
| ( ( f @ $true )
!= ( g @ $false ) )
| b )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| ( ( f @ $false )
!= ( g @ $true ) )
| ( ( f @ $true )
!= ( g @ $false ) )
| b )
& ( ~ a
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ b
| b
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| b
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ b
| ( ( f @ $false )
!= ( g @ $true ) )
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| ( ( f @ $false )
!= ( g @ $true ) )
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ a
| ( ( f @ $true )
!= ( g @ $false ) )
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ b
| b
| ( ( f @ $true )
!= ( g @ $false ) )
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| b
| ( ( f @ $true )
!= ( g @ $false ) )
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ b
| ( ( f @ $false )
!= ( g @ $true ) )
| ( ( f @ $true )
!= ( g @ $false ) )
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| ( ( f @ $false )
!= ( g @ $true ) )
| ( ( f @ $true )
!= ( g @ $false ) )
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ a
| ( ( f @ $true )
= ( g @ $true ) )
| ~ b )
& ( a
| ( ( f @ $true )
= ( g @ $false ) )
| ~ b )
& ( ~ a
| ( ( f @ $false )
= ( g @ $true ) )
| b )
& ( a
| ( ( f @ $false )
= ( g @ $false ) )
| b )
& ( ~ a
| a )
& ( ~ c
| c
| a )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| c
| a )
& ( ~ c
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| a )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| a )
& ( ~ a
| ~ c
| c )
& ( ~ c
| c
| ~ c
| c )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| c
| ~ c
| c )
& ( ~ c
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ~ c
| c )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ~ c
| c )
& ( ~ a
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| c )
& ( ~ c
| c
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| c )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| c
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| c )
& ( ~ c
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| c )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| c )
& ( ~ a
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ c
| c
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| c
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ c
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ a
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ c
| c
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| c
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ c
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ a
| ( ( f1 @ $true )
= ( g1 @ $true ) )
| ~ c )
& ( a
| ( ( f1 @ $true )
= ( g1 @ $false ) )
| ~ c )
& ( ~ a
| ( ( f1 @ $false )
= ( g1 @ $true ) )
| c )
& ( a
| ( ( f1 @ $false )
= ( g1 @ $false ) )
| c )
& ( ~ b
| b )
& ( ~ c
| c
| b )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| c
| b )
& ( ~ c
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| b )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| b )
& ( ~ b
| ~ c
| c )
& ( ~ c
| c
| ~ c
| c )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| c
| ~ c
| c )
& ( ~ c
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ~ c
| c )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ~ c
| c )
& ( ~ b
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| c )
& ( ~ c
| c
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| c )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| c
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| c )
& ( ~ c
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| c )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| c )
& ( ~ b
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ c
| c
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| c
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ c
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ b
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ c
| c
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| c
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ c
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ b
| ( ( f2 @ $true )
= ( g2 @ $true ) )
| ~ c )
& ( b
| ( ( f2 @ $true )
= ( g2 @ $false ) )
| ~ c )
& ( ~ b
| ( ( f2 @ $false )
= ( g2 @ $true ) )
| c )
& ( b
| ( ( f2 @ $false )
= ( g2 @ $false ) )
| c ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
thf(c_0_3,negated_conjecture,
( ( ( f1 @ $true )
= ( g1 @ $true ) )
| ~ a
| ~ c ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ~ a
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( b
| a
| ( ( f @ ~ $true )
!= ( g @ ~ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( a
| ( ( f @ ~ $true )
= ( g @ ~ $true ) )
| b ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( c
| b
| ( ( f2 @ ~ $true )
!= ( g2 @ ~ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( b
| ( ( f2 @ ~ $true )
= ( g2 @ ~ $true ) )
| c ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
( ( ( f @ $true )
= ( g @ $true ) )
| ~ a
| ~ b ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
( ~ a
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
( ~ a
| ~ c ),
inference(csr,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_12,negated_conjecture,
( b
| a ),
inference(csr,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_13,negated_conjecture,
( c
| b ),
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_14,negated_conjecture,
( ( ( f2 @ $true )
= ( g2 @ $true ) )
| ~ b
| ~ c ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
( ~ b
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_16,negated_conjecture,
( c
| a
| ( ( f1 @ ~ $true )
!= ( g1 @ ~ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_17,negated_conjecture,
( a
| ( ( f1 @ ~ $true )
= ( g1 @ ~ $true ) )
| c ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_18,negated_conjecture,
( ~ a
| ~ b ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_19,negated_conjecture,
b,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_20,negated_conjecture,
( ~ b
| ~ c ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_21,negated_conjecture,
( c
| a ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,negated_conjecture,
~ a,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
thf(c_0_23,negated_conjecture,
~ c,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19])]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO499^1 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 10:15:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.48 Running higher-order theorem proving
% 0.22/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.22/0.50 # Version: 3.1.0-ho
% 0.22/0.50 # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.50 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.22/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.50 # Starting sh4l with 300s (1) cores
% 0.22/0.50 # ho_unfolding_6 with pid 1828 completed with status 0
% 0.22/0.50 # Result found by ho_unfolding_6
% 0.22/0.50 # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.50 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.22/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.50 # No SInE strategy applied
% 0.22/0.50 # Search class: HGHSF-FFMS11-SFFFFFNN
% 0.22/0.50 # partial match(1): HGHSF-FFMM11-SFFFFFNN
% 0.22/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.50 # new_ho_10 with pid 1832 completed with status 0
% 0.22/0.50 # Result found by new_ho_10
% 0.22/0.50 # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.50 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.22/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.50 # No SInE strategy applied
% 0.22/0.50 # Search class: HGHSF-FFMS11-SFFFFFNN
% 0.22/0.50 # partial match(1): HGHSF-FFMM11-SFFFFFNN
% 0.22/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Theorem
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 10
% 0.22/0.50 # Removed by relevancy pruning/SinE : 0
% 0.22/0.50 # Initial clauses : 96
% 0.22/0.50 # Removed in clause preprocessing : 45
% 0.22/0.50 # Initial clauses in saturation : 51
% 0.22/0.50 # Processed clauses : 64
% 0.22/0.50 # ...of these trivial : 0
% 0.22/0.50 # ...subsumed : 12
% 0.22/0.50 # ...remaining for further processing : 51
% 0.22/0.50 # Other redundant clauses eliminated : 0
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 10
% 0.22/0.50 # Backward-rewritten : 4
% 0.22/0.50 # Generated clauses : 6
% 0.22/0.50 # ...of the previous two non-redundant : 5
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 11
% 0.22/0.50 # Paramodulations : 5
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 0
% 0.22/0.50 # Disequality decompositions : 0
% 0.22/0.50 # Total rewrite steps : 4
% 0.22/0.50 # ...of those cached : 3
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 3
% 0.22/0.50 # Positive orientable unit clauses : 1
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 2
% 0.22/0.50 # Non-unit-clauses : 0
% 0.22/0.50 # Current number of unprocessed clauses: 25
% 0.22/0.50 # ...number of literals in the above : 74
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 48
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 88
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 52
% 0.22/0.50 # Non-unit clause-clause subsumptions : 29
% 0.22/0.50 # Unit Clause-clause subsumption calls : 4
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 1
% 0.22/0.50 # BW rewrite match successes : 1
% 0.22/0.50 # Condensation attempts : 64
% 0.22/0.50 # Condensation successes : 0
% 0.22/0.50 # Termbank termtop insertions : 3160
% 0.22/0.50 # Search garbage collected termcells : 362
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.004 s
% 0.22/0.50 # System time : 0.002 s
% 0.22/0.50 # Total time : 0.006 s
% 0.22/0.50 # Maximum resident set size: 1744 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.005 s
% 0.22/0.50 # System time : 0.003 s
% 0.22/0.50 # Total time : 0.008 s
% 0.22/0.50 # Maximum resident set size: 1692 pages
% 0.22/0.50 % E---3.1 exiting
% 0.22/0.50 % E exiting
%------------------------------------------------------------------------------