TSTP Solution File: COM008+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : COM008+1 : TPTP v8.1.2. Released v3.2.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:22:16 EDT 2023
% Result : Theorem 0.34s 0.55s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 15 unt; 0 def)
% Number of atoms : 170 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 198 ( 88 ~; 91 |; 12 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 94 ( 0 sgn; 34 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(found,axiom,
! [X1] :
( ( transitive_reflexive_rewrite(b,X1)
& transitive_reflexive_rewrite(c,X1) )
=> goal ),
file('/export/starexec/sandbox2/tmp/tmp.atqoUkoeeq/E---3.1_31312.p',found) ).
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox2/tmp/tmp.atqoUkoeeq/E---3.1_31312.p',goal_to_be_proved) ).
fof(ih_cfl,axiom,
! [X1,X2,X3] :
( ( rewrite(a,X1)
& transitive_reflexive_rewrite(X1,X2)
& transitive_reflexive_rewrite(X1,X3) )
=> ? [X4] :
( transitive_reflexive_rewrite(X2,X4)
& transitive_reflexive_rewrite(X3,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.atqoUkoeeq/E---3.1_31312.p',ih_cfl) ).
fof(transitivity_of_transitive_reflexive_rewrite,axiom,
! [X1,X2,X3] :
( ( transitive_reflexive_rewrite(X1,X2)
& transitive_reflexive_rewrite(X2,X3) )
=> transitive_reflexive_rewrite(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.atqoUkoeeq/E---3.1_31312.p',transitivity_of_transitive_reflexive_rewrite) ).
fof(equalish_or_rewrite,axiom,
! [X1,X2] :
( transitive_reflexive_rewrite(X1,X2)
=> ( equalish(X1,X2)
| ? [X3] :
( rewrite(X1,X3)
& transitive_reflexive_rewrite(X3,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.atqoUkoeeq/E---3.1_31312.p',equalish_or_rewrite) ).
fof(assumption,axiom,
( transitive_reflexive_rewrite(a,b)
& transitive_reflexive_rewrite(a,c) ),
file('/export/starexec/sandbox2/tmp/tmp.atqoUkoeeq/E---3.1_31312.p',assumption) ).
fof(lo_cfl,axiom,
! [X1,X2,X3] :
( ( rewrite(X1,X2)
& rewrite(X1,X3) )
=> ? [X4] :
( transitive_reflexive_rewrite(X2,X4)
& transitive_reflexive_rewrite(X3,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.atqoUkoeeq/E---3.1_31312.p',lo_cfl) ).
fof(equality_in_transitive_reflexive_rewrite,axiom,
! [X1,X2] :
( equalish(X1,X2)
=> transitive_reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.atqoUkoeeq/E---3.1_31312.p',equality_in_transitive_reflexive_rewrite) ).
fof(reflexivity,axiom,
! [X1] : equalish(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.atqoUkoeeq/E---3.1_31312.p',reflexivity) ).
fof(symmetry,axiom,
! [X1,X2] :
( equalish(X1,X2)
=> equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.atqoUkoeeq/E---3.1_31312.p',symmetry) ).
fof(c_0_10,plain,
! [X5] :
( ~ transitive_reflexive_rewrite(b,X5)
| ~ transitive_reflexive_rewrite(c,X5)
| goal ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[found])]) ).
fof(c_0_11,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goal_to_be_proved])]) ).
cnf(c_0_12,plain,
( goal
| ~ transitive_reflexive_rewrite(b,X1)
| ~ transitive_reflexive_rewrite(c,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X20,X21,X22] :
( ( transitive_reflexive_rewrite(X21,esk2_3(X20,X21,X22))
| ~ rewrite(a,X20)
| ~ transitive_reflexive_rewrite(X20,X21)
| ~ transitive_reflexive_rewrite(X20,X22) )
& ( transitive_reflexive_rewrite(X22,esk2_3(X20,X21,X22))
| ~ rewrite(a,X20)
| ~ transitive_reflexive_rewrite(X20,X21)
| ~ transitive_reflexive_rewrite(X20,X22) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ih_cfl])])])]) ).
fof(c_0_15,plain,
! [X13,X14,X15] :
( ~ transitive_reflexive_rewrite(X13,X14)
| ~ transitive_reflexive_rewrite(X14,X15)
| transitive_reflexive_rewrite(X13,X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_of_transitive_reflexive_rewrite])]) ).
cnf(c_0_16,plain,
( ~ transitive_reflexive_rewrite(b,X1)
| ~ transitive_reflexive_rewrite(c,X1) ),
inference(sr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( transitive_reflexive_rewrite(X1,esk2_3(X2,X1,X3))
| ~ rewrite(a,X2)
| ~ transitive_reflexive_rewrite(X2,X1)
| ~ transitive_reflexive_rewrite(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( transitive_reflexive_rewrite(X1,X3)
| ~ transitive_reflexive_rewrite(X1,X2)
| ~ transitive_reflexive_rewrite(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( transitive_reflexive_rewrite(X1,esk2_3(X2,X3,X1))
| ~ rewrite(a,X2)
| ~ transitive_reflexive_rewrite(X2,X3)
| ~ transitive_reflexive_rewrite(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X24,X25] :
( ( rewrite(X24,esk3_2(X24,X25))
| equalish(X24,X25)
| ~ transitive_reflexive_rewrite(X24,X25) )
& ( transitive_reflexive_rewrite(esk3_2(X24,X25),X25)
| equalish(X24,X25)
| ~ transitive_reflexive_rewrite(X24,X25) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equalish_or_rewrite])])])]) ).
cnf(c_0_21,plain,
( ~ rewrite(a,X1)
| ~ transitive_reflexive_rewrite(b,esk2_3(X1,c,X2))
| ~ transitive_reflexive_rewrite(X1,c)
| ~ transitive_reflexive_rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( transitive_reflexive_rewrite(X1,esk2_3(X2,X3,X4))
| ~ rewrite(a,X2)
| ~ transitive_reflexive_rewrite(X1,X4)
| ~ transitive_reflexive_rewrite(X2,X3)
| ~ transitive_reflexive_rewrite(X2,X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( rewrite(X1,esk3_2(X1,X2))
| equalish(X1,X2)
| ~ transitive_reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
transitive_reflexive_rewrite(a,c),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_25,plain,
( transitive_reflexive_rewrite(esk3_2(X1,X2),X2)
| equalish(X1,X2)
| ~ transitive_reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( ~ rewrite(a,X1)
| ~ transitive_reflexive_rewrite(X1,c)
| ~ transitive_reflexive_rewrite(b,X2)
| ~ transitive_reflexive_rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( rewrite(a,esk3_2(a,c))
| equalish(a,c) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( equalish(a,c)
| transitive_reflexive_rewrite(esk3_2(a,c),c) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_29,plain,
( equalish(a,c)
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X1)
| ~ transitive_reflexive_rewrite(b,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
fof(c_0_30,plain,
! [X16,X17,X18] :
( ( transitive_reflexive_rewrite(X17,esk1_3(X16,X17,X18))
| ~ rewrite(X16,X17)
| ~ rewrite(X16,X18) )
& ( transitive_reflexive_rewrite(X18,esk1_3(X16,X17,X18))
| ~ rewrite(X16,X17)
| ~ rewrite(X16,X18) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lo_cfl])])])]) ).
cnf(c_0_31,plain,
( equalish(a,c)
| ~ rewrite(a,X1)
| ~ transitive_reflexive_rewrite(b,esk2_3(X1,X2,X3))
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X3)
| ~ transitive_reflexive_rewrite(X1,X2)
| ~ transitive_reflexive_rewrite(X1,X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_32,plain,
( transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,plain,
( equalish(a,c)
| ~ rewrite(a,X1)
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X2)
| ~ transitive_reflexive_rewrite(X1,b)
| ~ transitive_reflexive_rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_34,plain,
( transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X4))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X4)
| ~ transitive_reflexive_rewrite(X1,X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
fof(c_0_35,plain,
! [X9,X10] :
( ~ equalish(X9,X10)
| transitive_reflexive_rewrite(X9,X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equality_in_transitive_reflexive_rewrite])]) ).
fof(c_0_36,plain,
! [X6] : equalish(X6,X6),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_37,plain,
( equalish(a,c)
| ~ rewrite(a,X1)
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X4)
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X4)
| ~ transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X4))
| ~ transitive_reflexive_rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( transitive_reflexive_rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X1)
| ~ rewrite(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
( transitive_reflexive_rewrite(X1,X2)
| ~ equalish(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
equalish(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
( equalish(a,c)
| ~ rewrite(a,X1)
| ~ rewrite(X2,X1)
| ~ rewrite(X2,X3)
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X3)
| ~ transitive_reflexive_rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
transitive_reflexive_rewrite(X1,X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( equalish(a,c)
| ~ rewrite(X1,esk3_2(a,c))
| ~ rewrite(a,X2)
| ~ rewrite(X1,X2)
| ~ transitive_reflexive_rewrite(X2,b) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,plain,
transitive_reflexive_rewrite(a,b),
inference(split_conjunct,[status(thm)],[assumption]) ).
fof(c_0_45,plain,
! [X7,X8] :
( ~ equalish(X7,X8)
| equalish(X8,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry])]) ).
cnf(c_0_46,plain,
( equalish(a,c)
| ~ rewrite(a,X1)
| ~ transitive_reflexive_rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_43,c_0_27]) ).
cnf(c_0_47,plain,
( rewrite(a,esk3_2(a,b))
| equalish(a,b) ),
inference(spm,[status(thm)],[c_0_23,c_0_44]) ).
cnf(c_0_48,plain,
( equalish(a,b)
| transitive_reflexive_rewrite(esk3_2(a,b),b) ),
inference(spm,[status(thm)],[c_0_25,c_0_44]) ).
cnf(c_0_49,plain,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_50,plain,
( equalish(a,b)
| equalish(a,c) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_51,plain,
( transitive_reflexive_rewrite(X1,b)
| ~ transitive_reflexive_rewrite(X1,a) ),
inference(spm,[status(thm)],[c_0_18,c_0_44]) ).
cnf(c_0_52,plain,
( equalish(a,b)
| equalish(c,a) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
~ transitive_reflexive_rewrite(c,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_51]),c_0_42])]) ).
cnf(c_0_54,plain,
equalish(a,b),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_52]),c_0_53]) ).
cnf(c_0_55,plain,
~ transitive_reflexive_rewrite(b,c),
inference(spm,[status(thm)],[c_0_16,c_0_42]) ).
cnf(c_0_56,plain,
( transitive_reflexive_rewrite(X1,c)
| ~ transitive_reflexive_rewrite(X1,a) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_57,plain,
equalish(b,a),
inference(spm,[status(thm)],[c_0_49,c_0_54]) ).
cnf(c_0_58,plain,
~ transitive_reflexive_rewrite(b,a),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COM008+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 04:58:21 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.atqoUkoeeq/E---3.1_31312.p
% 0.34/0.55 # Version: 3.1pre001
% 0.34/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.34/0.55 # Starting sh5l with 300s (1) cores
% 0.34/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31389 completed with status 0
% 0.34/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.34/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/0.55 # No SInE strategy applied
% 0.34/0.55 # Search class: FGUNF-FFSF32-SFFFFFNN
% 0.34/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.34/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.34/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.34/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.34/0.55 # Starting new_bool_1 with 136s (1) cores
% 0.34/0.55 # Starting sh5l with 136s (1) cores
% 0.34/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31396 completed with status 0
% 0.34/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.34/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/0.55 # No SInE strategy applied
% 0.34/0.55 # Search class: FGUNF-FFSF32-SFFFFFNN
% 0.34/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.34/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.34/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.34/0.55 # Preprocessing time : 0.001 s
% 0.34/0.55 # Presaturation interreduction done
% 0.34/0.55
% 0.34/0.55 # Proof found!
% 0.34/0.55 # SZS status Theorem
% 0.34/0.55 # SZS output start CNFRefutation
% See solution above
% 0.34/0.55 # Parsed axioms : 11
% 0.34/0.55 # Removed by relevancy pruning/SinE : 0
% 0.34/0.55 # Initial clauses : 15
% 0.34/0.55 # Removed in clause preprocessing : 0
% 0.34/0.55 # Initial clauses in saturation : 15
% 0.34/0.55 # Processed clauses : 386
% 0.34/0.55 # ...of these trivial : 0
% 0.34/0.55 # ...subsumed : 150
% 0.34/0.55 # ...remaining for further processing : 236
% 0.34/0.55 # Other redundant clauses eliminated : 0
% 0.34/0.55 # Clauses deleted for lack of memory : 0
% 0.34/0.55 # Backward-subsumed : 22
% 0.34/0.55 # Backward-rewritten : 61
% 0.34/0.55 # Generated clauses : 677
% 0.34/0.55 # ...of the previous two non-redundant : 659
% 0.34/0.55 # ...aggressively subsumed : 0
% 0.34/0.55 # Contextual simplify-reflections : 5
% 0.34/0.55 # Paramodulations : 677
% 0.34/0.55 # Factorizations : 0
% 0.34/0.55 # NegExts : 0
% 0.34/0.55 # Equation resolutions : 0
% 0.34/0.55 # Total rewrite steps : 84
% 0.34/0.55 # Propositional unsat checks : 0
% 0.34/0.55 # Propositional check models : 0
% 0.34/0.55 # Propositional check unsatisfiable : 0
% 0.34/0.55 # Propositional clauses : 0
% 0.34/0.55 # Propositional clauses after purity: 0
% 0.34/0.55 # Propositional unsat core size : 0
% 0.34/0.55 # Propositional preprocessing time : 0.000
% 0.34/0.55 # Propositional encoding time : 0.000
% 0.34/0.55 # Propositional solver time : 0.000
% 0.34/0.55 # Success case prop preproc time : 0.000
% 0.34/0.55 # Success case prop encoding time : 0.000
% 0.34/0.55 # Success case prop solver time : 0.000
% 0.34/0.55 # Current number of processed clauses : 138
% 0.34/0.55 # Positive orientable unit clauses : 6
% 0.34/0.55 # Positive unorientable unit clauses: 0
% 0.34/0.55 # Negative unit clauses : 8
% 0.34/0.55 # Non-unit-clauses : 124
% 0.34/0.55 # Current number of unprocessed clauses: 300
% 0.34/0.55 # ...number of literals in the above : 1805
% 0.34/0.55 # Current number of archived formulas : 0
% 0.34/0.55 # Current number of archived clauses : 98
% 0.34/0.55 # Clause-clause subsumption calls (NU) : 9407
% 0.34/0.55 # Rec. Clause-clause subsumption calls : 2217
% 0.34/0.55 # Non-unit clause-clause subsumptions : 145
% 0.34/0.55 # Unit Clause-clause subsumption calls : 130
% 0.34/0.55 # Rewrite failures with RHS unbound : 0
% 0.34/0.55 # BW rewrite match attempts : 4
% 0.34/0.55 # BW rewrite match successes : 1
% 0.34/0.55 # Condensation attempts : 0
% 0.34/0.55 # Condensation successes : 0
% 0.34/0.55 # Termbank termtop insertions : 17620
% 0.34/0.55
% 0.34/0.55 # -------------------------------------------------
% 0.34/0.55 # User time : 0.029 s
% 0.34/0.55 # System time : 0.007 s
% 0.34/0.55 # Total time : 0.036 s
% 0.34/0.55 # Maximum resident set size: 1712 pages
% 0.34/0.55
% 0.34/0.55 # -------------------------------------------------
% 0.34/0.55 # User time : 0.155 s
% 0.34/0.55 # System time : 0.012 s
% 0.34/0.55 # Total time : 0.167 s
% 0.34/0.55 # Maximum resident set size: 1688 pages
% 0.34/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------