TSTP Solution File: COM022+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COM022+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 : Mon May 20 19:08:19 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 16 unt; 0 def)
% Number of atoms : 197 ( 7 equ)
% Maximal formula atoms : 41 ( 4 avg)
% Number of connectives : 246 ( 91 ~; 89 |; 56 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-3 aty)
% Number of variables : 39 ( 0 sgn 15 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ( sdtmndtplgtdt0(xa,xR,xb)
& sdtmndtplgtdt0(xa,xR,xc) )
=> ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& sdtmndtasgtdt0(X1,xR,xb)
& ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,xa,xR)
& sdtmndtasgtdt0(X2,xR,xc)
& ? [X3] :
( aElement0(X3)
& sdtmndtasgtdt0(X1,xR,X3)
& sdtmndtasgtdt0(X2,xR,X3)
& ? [X4] :
( aNormalFormOfIn0(X4,X3,xR)
& sdtmndtasgtdt0(xb,xR,X4)
& sdtmndtasgtdt0(xc,xR,X4) ) ) ) ) )
=> ( ( sdtmndtasgtdt0(xa,xR,xb)
& sdtmndtasgtdt0(xa,xR,xc) )
=> ? [X1] :
( aElement0(X1)
& sdtmndtasgtdt0(xb,xR,X1)
& sdtmndtasgtdt0(xc,xR,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mTCRDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtasgtdt0(X1,X2,X3)
<=> ( X1 = X3
| sdtmndtplgtdt0(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCRDef) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
fof(m__731,hypothesis,
( aElement0(xa)
& aElement0(xb)
& aElement0(xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731) ).
fof(mNFRDef,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aRewritingSystem0(X2) )
=> ! [X3] :
( aNormalFormOfIn0(X3,X1,X2)
<=> ( aElement0(X3)
& sdtmndtasgtdt0(X1,X2,X3)
& ~ ? [X4] : aReductOfIn0(X4,X3,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNFRDef) ).
fof(c_0_5,negated_conjecture,
~ ( ( ( sdtmndtplgtdt0(xa,xR,xb)
& sdtmndtplgtdt0(xa,xR,xc) )
=> ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& sdtmndtasgtdt0(X1,xR,xb)
& ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,xa,xR)
& sdtmndtasgtdt0(X2,xR,xc)
& ? [X3] :
( aElement0(X3)
& sdtmndtasgtdt0(X1,xR,X3)
& sdtmndtasgtdt0(X2,xR,X3)
& ? [X4] :
( aNormalFormOfIn0(X4,X3,xR)
& sdtmndtasgtdt0(xb,xR,X4)
& sdtmndtasgtdt0(xc,xR,X4) ) ) ) ) )
=> ( ( sdtmndtasgtdt0(xa,xR,xb)
& sdtmndtasgtdt0(xa,xR,xc) )
=> ? [X1] :
( aElement0(X1)
& sdtmndtasgtdt0(xb,xR,X1)
& sdtmndtasgtdt0(xc,xR,X1) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X34,X35,X36] :
( ( ~ sdtmndtasgtdt0(X34,X35,X36)
| X34 = X36
| sdtmndtplgtdt0(X34,X35,X36)
| ~ aElement0(X34)
| ~ aRewritingSystem0(X35)
| ~ aElement0(X36) )
& ( X34 != X36
| sdtmndtasgtdt0(X34,X35,X36)
| ~ aElement0(X34)
| ~ aRewritingSystem0(X35)
| ~ aElement0(X36) )
& ( ~ sdtmndtplgtdt0(X34,X35,X36)
| sdtmndtasgtdt0(X34,X35,X36)
| ~ aElement0(X34)
| ~ aRewritingSystem0(X35)
| ~ aElement0(X36) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])])]) ).
fof(c_0_7,negated_conjecture,
! [X14] :
( ( aElement0(esk2_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( aReductOfIn0(esk2_0,xa,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(esk2_0,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( aElement0(esk3_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( aReductOfIn0(esk3_0,xa,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(esk3_0,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( aElement0(esk4_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(esk2_0,xR,esk4_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(esk3_0,xR,esk4_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( aNormalFormOfIn0(esk5_0,esk4_0,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(xb,xR,esk5_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(xc,xR,esk5_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& sdtmndtasgtdt0(xa,xR,xb)
& sdtmndtasgtdt0(xa,xR,xc)
& ( ~ aElement0(X14)
| ~ sdtmndtasgtdt0(xb,xR,X14)
| ~ sdtmndtasgtdt0(xc,xR,X14) ) ),
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_5])])])])])]) ).
cnf(c_0_8,plain,
( sdtmndtasgtdt0(X1,X3,X2)
| X1 != X2
| ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X1 = X3
| sdtmndtplgtdt0(X1,X2,X3)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
sdtmndtasgtdt0(xa,xR,xb),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_12,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_13,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_14,negated_conjecture,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xb,xR,X1)
| ~ sdtmndtasgtdt0(xc,xR,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( sdtmndtasgtdt0(X1,X2,X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
sdtmndtasgtdt0(xa,xR,xc),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_18,negated_conjecture,
( xb = xa
| sdtmndtplgtdt0(xa,xR,xb) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
~ sdtmndtasgtdt0(xc,xR,xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_12]),c_0_11])]) ).
cnf(c_0_20,negated_conjecture,
( xc = xa
| sdtmndtplgtdt0(xa,xR,xc) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_16]),c_0_11]),c_0_17]),c_0_13])]) ).
cnf(c_0_21,negated_conjecture,
( sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtasgtdt0(xa,xR,X1)
| ~ sdtmndtasgtdt0(xc,xR,X1)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( sdtmndtasgtdt0(xb,xR,esk5_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
sdtmndtplgtdt0(xa,xR,xc),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10])]) ).
cnf(c_0_24,negated_conjecture,
( sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtasgtdt0(xc,xR,xc) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_16]),c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
( sdtmndtasgtdt0(xb,xR,esk5_0)
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
sdtmndtplgtdt0(xa,xR,xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_11]),c_0_17])]) ).
cnf(c_0_27,negated_conjecture,
( sdtmndtasgtdt0(xc,xR,esk5_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,negated_conjecture,
( aNormalFormOfIn0(esk5_0,esk4_0,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,negated_conjecture,
( aElement0(esk4_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,negated_conjecture,
sdtmndtasgtdt0(xb,xR,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
( sdtmndtasgtdt0(xc,xR,esk5_0)
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_23])]) ).
fof(c_0_32,plain,
! [X43,X44,X45,X46,X47] :
( ( aElement0(X45)
| ~ aNormalFormOfIn0(X45,X43,X44)
| ~ aElement0(X43)
| ~ aRewritingSystem0(X44) )
& ( sdtmndtasgtdt0(X43,X44,X45)
| ~ aNormalFormOfIn0(X45,X43,X44)
| ~ aElement0(X43)
| ~ aRewritingSystem0(X44) )
& ( ~ aReductOfIn0(X46,X45,X44)
| ~ aNormalFormOfIn0(X45,X43,X44)
| ~ aElement0(X43)
| ~ aRewritingSystem0(X44) )
& ( ~ aElement0(X47)
| ~ sdtmndtasgtdt0(X43,X44,X47)
| aReductOfIn0(esk13_3(X43,X44,X47),X47,X44)
| aNormalFormOfIn0(X47,X43,X44)
| ~ aElement0(X43)
| ~ aRewritingSystem0(X44) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mNFRDef])])])])])])]) ).
cnf(c_0_33,negated_conjecture,
( aNormalFormOfIn0(esk5_0,esk4_0,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_23])]) ).
cnf(c_0_34,negated_conjecture,
( aElement0(esk4_0)
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_23])]) ).
cnf(c_0_35,negated_conjecture,
( ~ sdtmndtasgtdt0(xc,xR,esk5_0)
| ~ aElement0(esk5_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
sdtmndtasgtdt0(xc,xR,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_26])]) ).
cnf(c_0_37,plain,
( aElement0(X1)
| ~ aNormalFormOfIn0(X1,X2,X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,negated_conjecture,
aNormalFormOfIn0(esk5_0,esk4_0,xR),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_26])]) ).
cnf(c_0_39,negated_conjecture,
aElement0(esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_26])]) ).
cnf(c_0_40,negated_conjecture,
~ aElement0(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_11]),c_0_39])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM022+1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 10:35:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_3 with pid 19044 completed with status 0
% 0.21/0.50 # Result found by new_bool_3
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.21/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 19047 completed with status 0
% 0.21/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.21/0.50 # Preprocessing time : 0.002 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 19
% 0.21/0.50 # Removed by relevancy pruning/SinE : 1
% 0.21/0.50 # Initial clauses : 58
% 0.21/0.50 # Removed in clause preprocessing : 4
% 0.21/0.50 # Initial clauses in saturation : 54
% 0.21/0.50 # Processed clauses : 159
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 2
% 0.21/0.50 # ...remaining for further processing : 157
% 0.21/0.50 # Other redundant clauses eliminated : 1
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 37
% 0.21/0.50 # Generated clauses : 114
% 0.21/0.50 # ...of the previous two non-redundant : 125
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 15
% 0.21/0.50 # Paramodulations : 113
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 1
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 226
% 0.21/0.50 # ...of those cached : 209
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 65
% 0.21/0.50 # Positive orientable unit clauses : 24
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 39
% 0.21/0.50 # Current number of unprocessed clauses: 72
% 0.21/0.50 # ...number of literals in the above : 220
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 91
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 830
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 268
% 0.21/0.50 # Non-unit clause-clause subsumptions : 16
% 0.21/0.50 # Unit Clause-clause subsumption calls : 206
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 20
% 0.21/0.50 # BW rewrite match successes : 9
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 7395
% 0.21/0.50 # Search garbage collected termcells : 1167
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.017 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.018 s
% 0.21/0.50 # Maximum resident set size: 1868 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.018 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.022 s
% 0.21/0.50 # Maximum resident set size: 1716 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------