TSTP Solution File: SEU493^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU493^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 03:27:34 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of formulae : 56 ( 18 unt; 12 typ; 0 def)
% Number of atoms : 134 ( 30 equ; 0 cnn)
% Maximal formula atoms : 34 ( 3 avg)
% Number of connectives : 410 ( 51 ~; 58 |; 33 &; 254 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 45 ( 45 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 68 ( 15 ^ 53 !; 0 ?; 68 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
inv: ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_27,type,
refl: ( $i > $i > $o ) > $o ).
thf(decl_31,type,
antisymm: ( $i > $i > $o ) > $o ).
thf(decl_34,type,
trans: ( $i > $i > $o ) > $o ).
thf(decl_38,type,
po: ( $i > $i > $o ) > $o ).
thf(decl_51,type,
epred1_0: $i > $i > $o ).
thf(decl_52,type,
esk1_0: $i ).
thf(decl_53,type,
esk2_0: $i ).
thf(decl_54,type,
esk3_0: $i ).
thf(decl_55,type,
esk4_0: $i ).
thf(decl_56,type,
esk5_0: $i ).
thf(decl_57,type,
esk6_0: $i ).
thf(partial_order,axiom,
( po
= ( ^ [X1: $i > $i > $o] :
( ( refl @ X1 )
& ( antisymm @ X1 )
& ( trans @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',partial_order) ).
thf(reflexive,axiom,
( refl
= ( ^ [X1: $i > $i > $o] :
! [X3: $i] : ( X1 @ X3 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',reflexive) ).
thf(antisymmetric,axiom,
( antisymm
= ( ^ [X1: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X3 ) )
=> ( X3 = X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',antisymmetric) ).
thf(transitive,axiom,
( trans
= ( ^ [X1: $i > $i > $o] :
! [X3: $i,X4: $i,X6: $i] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X6 ) )
=> ( X1 @ X3 @ X6 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',transitive) ).
thf(inverse,axiom,
( inv
= ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] : ( X1 @ X4 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',inverse) ).
thf(inverse_of_partial_order_is_partial_order,conjecture,
! [X1: $i > $i > $o] :
( ( po @ X1 )
=> ( po @ ( inv @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_of_partial_order_is_partial_order) ).
thf(c_0_6,plain,
( po
= ( ^ [Z0: $i > $i > $o] :
( ! [X33: $i] : ( Z0 @ X33 @ X33 )
& ! [X34: $i,X35: $i] :
( ( ( Z0 @ X34 @ X35 )
& ( Z0 @ X35 @ X34 ) )
=> ( X34 = X35 ) )
& ! [X36: $i,X37: $i,X38: $i] :
( ( ( Z0 @ X36 @ X37 )
& ( Z0 @ X37 @ X38 ) )
=> ( Z0 @ X36 @ X38 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[partial_order]) ).
thf(c_0_7,plain,
( refl
= ( ^ [Z0: $i > $i > $o] :
! [X3: $i] : ( Z0 @ X3 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[reflexive]) ).
thf(c_0_8,plain,
( antisymm
= ( ^ [Z0: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( ( Z0 @ X3 @ X4 )
& ( Z0 @ X4 @ X3 ) )
=> ( X3 = X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[antisymmetric]) ).
thf(c_0_9,plain,
( trans
= ( ^ [Z0: $i > $i > $o] :
! [X3: $i,X4: $i,X6: $i] :
( ( ( Z0 @ X3 @ X4 )
& ( Z0 @ X4 @ X6 ) )
=> ( Z0 @ X3 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitive]) ).
thf(c_0_10,plain,
( inv
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] : ( Z0 @ Z2 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[inverse]) ).
thf(c_0_11,plain,
( po
= ( ^ [Z0: $i > $i > $o] :
( ! [X33: $i] : ( Z0 @ X33 @ X33 )
& ! [X34: $i,X35: $i] :
( ( ( Z0 @ X34 @ X35 )
& ( Z0 @ X35 @ X34 ) )
=> ( X34 = X35 ) )
& ! [X36: $i,X37: $i,X38: $i] :
( ( ( Z0 @ X36 @ X37 )
& ( Z0 @ X37 @ X38 ) )
=> ( Z0 @ X36 @ X38 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
~ ! [X1: $i > $i > $o] :
( ( ! [X158: $i] : ( X1 @ X158 @ X158 )
& ! [X159: $i,X160: $i] :
( ( ( X1 @ X159 @ X160 )
& ( X1 @ X160 @ X159 ) )
=> ( X159 = X160 ) )
& ! [X161: $i,X162: $i,X163: $i] :
( ( ( X1 @ X161 @ X162 )
& ( X1 @ X162 @ X163 ) )
=> ( X1 @ X161 @ X163 ) ) )
=> ( ! [X164: $i] : ( X1 @ X164 @ X164 )
& ! [X165: $i,X166: $i] :
( ( ( X1 @ X166 @ X165 )
& ( X1 @ X165 @ X166 ) )
=> ( X165 = X166 ) )
& ! [X167: $i,X168: $i,X169: $i] :
( ( ( X1 @ X168 @ X167 )
& ( X1 @ X169 @ X168 ) )
=> ( X1 @ X169 @ X167 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[inverse_of_partial_order_is_partial_order]),c_0_10]),c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X171: $i,X172: $i,X173: $i,X174: $i,X175: $i,X176: $i] :
( ( epred1_0 @ X171 @ X171 )
& ( ~ ( epred1_0 @ X172 @ X173 )
| ~ ( epred1_0 @ X173 @ X172 )
| ( X172 = X173 ) )
& ( ~ ( epred1_0 @ X174 @ X175 )
| ~ ( epred1_0 @ X175 @ X176 )
| ( epred1_0 @ X174 @ X176 ) )
& ( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_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_12])])])])])]) ).
thf(c_0_14,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X3: $i] : ( epred1_0 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i,X4: $i,X6: $i] :
( ( epred1_0 @ X3 @ X6 )
| ~ ( epred1_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X4 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_18,negated_conjecture,
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ( epred1_0 @ esk5_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
thf(c_0_19,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_20,negated_conjecture,
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_21,negated_conjecture,
( ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_22,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( esk3_0 != esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15])]) ).
thf(c_0_23,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ( epred1_0 @ X3 @ esk4_0 )
| ~ ( epred1_0 @ X3 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_25,negated_conjecture,
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ( epred1_0 @ esk6_0 @ esk5_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_15])]) ).
thf(c_0_26,negated_conjecture,
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk6_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_15])]) ).
thf(c_0_27,negated_conjecture,
( ( esk3_0 != esk2_0 )
| ~ ( epred1_0 @ esk6_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_15])]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ X3 @ esk4_0 )
| ( esk3_0 != esk2_0 )
| ~ ( epred1_0 @ X3 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
thf(c_0_29,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( esk3_0 != esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_15])]) ).
thf(c_0_30,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_31,negated_conjecture,
! [X4: $i,X3: $i] :
( ( X3 = X4 )
| ~ ( epred1_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_32,negated_conjecture,
epred1_0 @ esk2_0 @ esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
thf(c_0_33,negated_conjecture,
esk3_0 != esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
thf(c_0_34,negated_conjecture,
( ( epred1_0 @ esk3_0 @ esk2_0 )
| ( epred1_0 @ esk5_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_15])]) ).
thf(c_0_35,negated_conjecture,
~ ( epred1_0 @ esk3_0 @ esk2_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
thf(c_0_36,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_37,negated_conjecture,
( ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_38,negated_conjecture,
epred1_0 @ esk5_0 @ esk4_0,
inference(sr,[status(thm)],[c_0_34,c_0_35]) ).
thf(c_0_39,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_15])]) ).
thf(c_0_40,negated_conjecture,
( ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk6_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_15])]) ).
thf(c_0_41,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ X3 @ esk4_0 )
| ~ ( epred1_0 @ X3 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_38]) ).
thf(c_0_42,negated_conjecture,
epred1_0 @ esk6_0 @ esk5_0,
inference(sr,[status(thm)],[c_0_39,c_0_35]) ).
thf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU493^1 : TPTP v8.2.0. Released v3.6.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n025.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 18:15:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting sh1l with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.49 # sh1l with pid 14559 completed with status 0
% 0.20/0.49 # Result found by sh1l
% 0.20/0.49 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting sh1l with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHSF-FFSF00-SHSSMFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # new_ho_10 with pid 14563 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting sh1l with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHSF-FFSF00-SHSSMFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (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 : 59
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 41
% 0.20/0.49 # Removed in clause preprocessing : 29
% 0.20/0.49 # Initial clauses in saturation : 12
% 0.20/0.49 # Processed clauses : 56
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 3
% 0.20/0.49 # ...remaining for further processing : 53
% 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 : 15
% 0.20/0.49 # Generated clauses : 42
% 0.20/0.49 # ...of the previous two non-redundant : 45
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 2
% 0.20/0.49 # Paramodulations : 40
% 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 : 18
% 0.20/0.49 # ...of those cached : 15
% 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 : 13
% 0.20/0.49 # Positive orientable unit clauses : 4
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 7
% 0.20/0.49 # Current number of unprocessed clauses: 9
% 0.20/0.49 # ...number of literals in the above : 21
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 40
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 105
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 87
% 0.20/0.49 # Non-unit clause-clause subsumptions : 9
% 0.20/0.49 # Unit Clause-clause subsumption calls : 16
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 7
% 0.20/0.49 # BW rewrite match successes : 2
% 0.20/0.49 # Condensation attempts : 56
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 4152
% 0.20/0.49 # Search garbage collected termcells : 1025
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 2152 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.006 s
% 0.20/0.49 # Total time : 0.012 s
% 0.20/0.49 # Maximum resident set size: 1788 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------