TSTP Solution File: LCL672+1.001 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL672+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 18:21:23 EDT 2023
% Result : Theorem 1.37s 0.68s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 285 ( 0 equ)
% Maximal formula atoms : 90 ( 8 avg)
% Number of connectives : 480 ( 229 ~; 210 |; 40 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 138 ( 0 sgn; 88 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ $true ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oOvPKYe7wZ/E---3.1_10807.p',main) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( r1(X1,X2)
& r1(X2,X3) )
=> r1(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.oOvPKYe7wZ/E---3.1_10807.p',transitivity) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.oOvPKYe7wZ/E---3.1_10807.p',reflexivity) ).
fof(c_0_3,negated_conjecture,
~ ~ ? [X1] :
~ ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] : ~ r1(X2,X1) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).
fof(c_0_4,plain,
! [X5,X6,X7] :
( ~ r1(X5,X6)
| ~ r1(X6,X7)
| r1(X5,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])]) ).
fof(c_0_5,negated_conjecture,
! [X9,X10,X11,X13,X14,X15,X16,X17,X19,X20,X21,X22,X23,X25,X26,X28,X29,X30,X32,X36] :
( ( r1(X11,esk2_2(X10,X11))
| ~ r1(X10,X11)
| ~ p1(X10)
| ~ r1(esk1_0,X10)
| ~ r1(esk1_0,X9)
| p2(X9)
| ~ r1(esk1_0,X13)
| p1(X13) )
& ( p1(esk2_2(X10,X11))
| ~ r1(X10,X11)
| ~ p1(X10)
| ~ r1(esk1_0,X10)
| ~ r1(esk1_0,X9)
| p2(X9)
| ~ r1(esk1_0,X13)
| p1(X13) )
& ( r1(X17,esk3_3(X15,X16,X17))
| ~ r1(X16,X17)
| ~ r1(X16,X19)
| p1(X19)
| ~ r1(X15,X16)
| ~ r1(esk1_0,X15)
| ~ r1(esk1_0,X14)
| p2(X14)
| ~ r1(esk1_0,X20)
| p1(X20) )
& ( ~ p1(esk3_3(X15,X16,X17))
| ~ r1(X16,X17)
| ~ r1(X16,X19)
| p1(X19)
| ~ r1(X15,X16)
| ~ r1(esk1_0,X15)
| ~ r1(esk1_0,X14)
| p2(X14)
| ~ r1(esk1_0,X20)
| p1(X20) )
& ( r1(X26,esk5_2(X22,X26))
| ~ r1(X22,X26)
| r1(X23,esk4_2(X22,X23))
| ~ r1(X22,X23)
| ~ r1(esk1_0,X22)
| ~ r1(esk1_0,X21)
| p2(X21)
| ~ r1(esk1_0,X28)
| p1(X28) )
& ( ~ p1(esk5_2(X22,X26))
| ~ r1(X22,X26)
| r1(X23,esk4_2(X22,X23))
| ~ r1(X22,X23)
| ~ r1(esk1_0,X22)
| ~ r1(esk1_0,X21)
| p2(X21)
| ~ r1(esk1_0,X28)
| p1(X28) )
& ( r1(X26,esk5_2(X22,X26))
| ~ r1(X22,X26)
| ~ r1(esk4_2(X22,X23),X25)
| p1(X25)
| ~ r1(X22,X23)
| ~ r1(esk1_0,X22)
| ~ r1(esk1_0,X21)
| p2(X21)
| ~ r1(esk1_0,X28)
| p1(X28) )
& ( ~ p1(esk5_2(X22,X26))
| ~ r1(X22,X26)
| ~ r1(esk4_2(X22,X23),X25)
| p1(X25)
| ~ r1(X22,X23)
| ~ r1(esk1_0,X22)
| ~ r1(esk1_0,X21)
| p2(X21)
| ~ r1(esk1_0,X28)
| p1(X28) )
& ( ~ r1(esk1_0,X29)
| p2(X29)
| ~ r1(esk1_0,X30)
| r1(X30,esk6_1(X30))
| ~ r1(esk1_0,X32)
| p1(X32) )
& r1(esk1_0,esk7_0)
& ~ p2(esk7_0)
& r1(esk1_0,esk8_0)
& r1(esk8_0,esk9_0)
& ( ~ r1(esk9_0,X36)
| p1(X36) )
& r1(esk8_0,esk10_0)
& ~ p1(esk10_0)
& r1(esk1_0,esk11_0)
& ~ p1(esk11_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_6,plain,
( r1(X1,X3)
| ~ r1(X1,X2)
| ~ r1(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
r1(esk8_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( r1(X1,esk3_3(X2,X3,X1))
| p1(X4)
| p2(X5)
| p1(X6)
| ~ r1(X3,X1)
| ~ r1(X3,X4)
| ~ r1(X2,X3)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X5)
| ~ r1(esk1_0,X6) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( r1(X1,esk10_0)
| ~ r1(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
r1(esk1_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
~ p1(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
r1(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_13,plain,
! [X4] : r1(X4,X4),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_14,negated_conjecture,
( p1(X1)
| p2(X2)
| r1(X3,esk3_3(X4,X5,X3))
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X4)
| ~ r1(X5,X1)
| ~ r1(X5,X3)
| ~ r1(X4,X5) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( r1(X1,esk7_0)
| ~ r1(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_16,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ p2(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( p1(X1)
| r1(X2,esk3_3(X3,X4,X2))
| ~ r1(esk1_0,X3)
| ~ r1(X4,X1)
| ~ r1(X4,X2)
| ~ r1(X3,X4) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( r1(X1,esk8_0)
| ~ r1(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_20,negated_conjecture,
( p1(X1)
| r1(X2,esk3_3(esk8_0,X3,X2))
| ~ r1(esk8_0,X3)
| ~ r1(X3,X1)
| ~ r1(X3,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16])]) ).
cnf(c_0_21,negated_conjecture,
( p1(X4)
| p2(X5)
| p1(X6)
| ~ p1(esk3_3(X1,X2,X3))
| ~ r1(X2,X3)
| ~ r1(X2,X4)
| ~ r1(X1,X2)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X5)
| ~ r1(esk1_0,X6) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
( p1(X1)
| ~ r1(esk9_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,negated_conjecture,
( p1(X1)
| r1(X2,esk3_3(esk8_0,esk8_0,X2))
| ~ r1(esk8_0,X1)
| ~ r1(esk8_0,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( p1(X1)
| p1(X2)
| p2(X3)
| ~ r1(esk9_0,esk3_3(X4,X5,X6))
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(esk1_0,X4)
| ~ r1(X5,X1)
| ~ r1(X5,X6)
| ~ r1(X4,X5) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( r1(X1,esk3_3(esk8_0,esk8_0,X1))
| ~ r1(esk8_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_9]),c_0_16])]),c_0_11]) ).
cnf(c_0_26,negated_conjecture,
r1(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_27,negated_conjecture,
r1(esk1_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_28,negated_conjecture,
( p1(X1)
| p1(X2)
| p2(X3)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X3)
| ~ r1(esk8_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_10]),c_0_26]),c_0_16])]) ).
cnf(c_0_29,negated_conjecture,
( r1(X1,esk11_0)
| ~ r1(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
~ p1(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_31,negated_conjecture,
( p1(X1)
| p2(X2)
| ~ r1(esk1_0,X2)
| ~ r1(esk8_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_16])]),c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( p1(X1)
| ~ r1(esk8_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_32]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : LCL672+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n014.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 : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 13:06:35 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.oOvPKYe7wZ/E---3.1_10807.p
% 1.37/0.68 # Version: 3.1pre001
% 1.37/0.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.37/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.37/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.37/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.37/0.68 # Starting sh5l with 300s (1) cores
% 1.37/0.68 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10885 completed with status 0
% 1.37/0.68 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.37/0.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.37/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.37/0.68 # No SInE strategy applied
% 1.37/0.68 # Search class: FGUNF-FFMS32-SFFFFFNN
% 1.37/0.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.37/0.68 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.37/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.37/0.68 # Starting new_bool_3 with 136s (1) cores
% 1.37/0.68 # Starting new_bool_1 with 136s (1) cores
% 1.37/0.68 # Starting sh5l with 136s (1) cores
% 1.37/0.68 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10892 completed with status 0
% 1.37/0.68 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.37/0.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.37/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.37/0.68 # No SInE strategy applied
% 1.37/0.68 # Search class: FGUNF-FFMS32-SFFFFFNN
% 1.37/0.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.37/0.68 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.37/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.37/0.68 # Preprocessing time : 0.001 s
% 1.37/0.68 # Presaturation interreduction done
% 1.37/0.68
% 1.37/0.68 # Proof found!
% 1.37/0.68 # SZS status Theorem
% 1.37/0.68 # SZS output start CNFRefutation
% See solution above
% 1.37/0.68 # Parsed axioms : 3
% 1.37/0.68 # Removed by relevancy pruning/SinE : 0
% 1.37/0.68 # Initial clauses : 20
% 1.37/0.68 # Removed in clause preprocessing : 0
% 1.37/0.68 # Initial clauses in saturation : 20
% 1.37/0.68 # Processed clauses : 1013
% 1.37/0.68 # ...of these trivial : 65
% 1.37/0.68 # ...subsumed : 371
% 1.37/0.68 # ...remaining for further processing : 577
% 1.37/0.68 # Other redundant clauses eliminated : 0
% 1.37/0.68 # Clauses deleted for lack of memory : 0
% 1.37/0.68 # Backward-subsumed : 71
% 1.37/0.68 # Backward-rewritten : 54
% 1.37/0.68 # Generated clauses : 9910
% 1.37/0.68 # ...of the previous two non-redundant : 9891
% 1.37/0.68 # ...aggressively subsumed : 0
% 1.37/0.68 # Contextual simplify-reflections : 0
% 1.37/0.68 # Paramodulations : 9910
% 1.37/0.68 # Factorizations : 0
% 1.37/0.68 # NegExts : 0
% 1.37/0.68 # Equation resolutions : 0
% 1.37/0.68 # Total rewrite steps : 3727
% 1.37/0.68 # Propositional unsat checks : 0
% 1.37/0.68 # Propositional check models : 0
% 1.37/0.68 # Propositional check unsatisfiable : 0
% 1.37/0.68 # Propositional clauses : 0
% 1.37/0.68 # Propositional clauses after purity: 0
% 1.37/0.68 # Propositional unsat core size : 0
% 1.37/0.68 # Propositional preprocessing time : 0.000
% 1.37/0.68 # Propositional encoding time : 0.000
% 1.37/0.68 # Propositional solver time : 0.000
% 1.37/0.68 # Success case prop preproc time : 0.000
% 1.37/0.68 # Success case prop encoding time : 0.000
% 1.37/0.68 # Success case prop solver time : 0.000
% 1.37/0.68 # Current number of processed clauses : 432
% 1.37/0.68 # Positive orientable unit clauses : 60
% 1.37/0.68 # Positive unorientable unit clauses: 0
% 1.37/0.68 # Negative unit clauses : 7
% 1.37/0.68 # Non-unit-clauses : 365
% 1.37/0.68 # Current number of unprocessed clauses: 3928
% 1.37/0.68 # ...number of literals in the above : 21348
% 1.37/0.68 # Current number of archived formulas : 0
% 1.37/0.68 # Current number of archived clauses : 145
% 1.37/0.68 # Clause-clause subsumption calls (NU) : 126454
% 1.37/0.68 # Rec. Clause-clause subsumption calls : 52834
% 1.37/0.68 # Non-unit clause-clause subsumptions : 413
% 1.37/0.68 # Unit Clause-clause subsumption calls : 3075
% 1.37/0.68 # Rewrite failures with RHS unbound : 0
% 1.37/0.68 # BW rewrite match attempts : 362
% 1.37/0.68 # BW rewrite match successes : 54
% 1.37/0.68 # Condensation attempts : 0
% 1.37/0.68 # Condensation successes : 0
% 1.37/0.68 # Termbank termtop insertions : 220749
% 1.37/0.68
% 1.37/0.68 # -------------------------------------------------
% 1.37/0.68 # User time : 0.162 s
% 1.37/0.68 # System time : 0.006 s
% 1.37/0.68 # Total time : 0.168 s
% 1.37/0.68 # Maximum resident set size: 1808 pages
% 1.37/0.68
% 1.37/0.68 # -------------------------------------------------
% 1.37/0.68 # User time : 0.740 s
% 1.37/0.68 # System time : 0.018 s
% 1.37/0.68 # Total time : 0.758 s
% 1.37/0.68 # Maximum resident set size: 1680 pages
% 1.37/0.68 % E---3.1 exiting
% 1.37/0.68 % E---3.1 exiting
%------------------------------------------------------------------------------