TSTP Solution File: RNG108+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG108+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 19:15:47 EDT 2023
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 221 ( 63 equ)
% Maximal formula atoms : 96 ( 7 avg)
% Number of connectives : 328 ( 137 ~; 124 |; 59 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn; 27 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2174,hypothesis,
( aSet0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xb,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,xI)
<=> ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 ) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox/tmp/tmp.siLckQgilI/E---3.1_3549.p',m__2174) ).
fof(m__,conjecture,
( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = sz00 )
| aElementOf0(sz00,slsdtgt0(xa)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = xa )
| aElementOf0(xa,slsdtgt0(xa)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = sz00 )
| aElementOf0(sz00,slsdtgt0(xb)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = xb )
| aElementOf0(xb,slsdtgt0(xb)) ) ),
file('/export/starexec/sandbox/tmp/tmp.siLckQgilI/E---3.1_3549.p',m__) ).
fof(mMulZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.siLckQgilI/E---3.1_3549.p',mMulZero) ).
fof(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox/tmp/tmp.siLckQgilI/E---3.1_3549.p',mSortsC) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/tmp/tmp.siLckQgilI/E---3.1_3549.p',m__2091) ).
fof(mMulUnit,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.siLckQgilI/E---3.1_3549.p',mMulUnit) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/tmp/tmp.siLckQgilI/E---3.1_3549.p',mSortsC_01) ).
fof(c_0_7,hypothesis,
! [X67,X68,X69,X70,X72,X73,X74,X76,X77,X78,X81,X82,X83] :
( aSet0(xI)
& ( ~ aElementOf0(X68,xI)
| aElementOf0(sdtpldt0(X67,X68),xI)
| ~ aElementOf0(X67,xI) )
& ( ~ aElement0(X69)
| aElementOf0(sdtasdt0(X69,X67),xI)
| ~ aElementOf0(X67,xI) )
& aIdeal0(xI)
& ( aElement0(esk17_1(X70))
| ~ aElementOf0(X70,slsdtgt0(xa)) )
& ( sdtasdt0(xa,esk17_1(X70)) = X70
| ~ aElementOf0(X70,slsdtgt0(xa)) )
& ( ~ aElement0(X73)
| sdtasdt0(xa,X73) != X72
| aElementOf0(X72,slsdtgt0(xa)) )
& ( aElement0(esk18_1(X74))
| ~ aElementOf0(X74,slsdtgt0(xb)) )
& ( sdtasdt0(xb,esk18_1(X74)) = X74
| ~ aElementOf0(X74,slsdtgt0(xb)) )
& ( ~ aElement0(X77)
| sdtasdt0(xb,X77) != X76
| aElementOf0(X76,slsdtgt0(xb)) )
& ( aElementOf0(esk19_1(X78),slsdtgt0(xa))
| ~ aElementOf0(X78,xI) )
& ( aElementOf0(esk20_1(X78),slsdtgt0(xb))
| ~ aElementOf0(X78,xI) )
& ( sdtpldt0(esk19_1(X78),esk20_1(X78)) = X78
| ~ aElementOf0(X78,xI) )
& ( ~ aElementOf0(X82,slsdtgt0(xa))
| ~ aElementOf0(X83,slsdtgt0(xb))
| sdtpldt0(X82,X83) != X81
| aElementOf0(X81,xI) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
inference(distribute,[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)],[m__2174])])])])])]) ).
fof(c_0_8,negated_conjecture,
~ ( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = sz00 )
| aElementOf0(sz00,slsdtgt0(xa)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = xa )
| aElementOf0(xa,slsdtgt0(xa)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = sz00 )
| aElementOf0(sz00,slsdtgt0(xb)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = xb )
| aElementOf0(xb,slsdtgt0(xb)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_9,hypothesis,
( aElementOf0(X2,slsdtgt0(xa))
| ~ aElement0(X1)
| sdtasdt0(xa,X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X102] :
( ( sdtasdt0(X102,sz00) = sz00
| ~ aElement0(X102) )
& ( sz00 = sdtasdt0(sz00,X102)
| ~ aElement0(X102) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulZero])])]) ).
fof(c_0_11,negated_conjecture,
! [X7,X8,X9,X10] :
( ( ~ aElement0(X10)
| sdtasdt0(xb,X10) != xb
| ~ aElement0(X9)
| sdtasdt0(xb,X9) != sz00
| ~ aElement0(X8)
| sdtasdt0(xa,X8) != xa
| ~ aElement0(X7)
| sdtasdt0(xa,X7) != sz00 )
& ( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElement0(X9)
| sdtasdt0(xb,X9) != sz00
| ~ aElement0(X8)
| sdtasdt0(xa,X8) != xa
| ~ aElement0(X7)
| sdtasdt0(xa,X7) != sz00 )
& ( ~ aElement0(X10)
| sdtasdt0(xb,X10) != xb
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElement0(X8)
| sdtasdt0(xa,X8) != xa
| ~ aElement0(X7)
| sdtasdt0(xa,X7) != sz00 )
& ( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElement0(X8)
| sdtasdt0(xa,X8) != xa
| ~ aElement0(X7)
| sdtasdt0(xa,X7) != sz00 )
& ( ~ aElement0(X10)
| sdtasdt0(xb,X10) != xb
| ~ aElement0(X9)
| sdtasdt0(xb,X9) != sz00
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElement0(X7)
| sdtasdt0(xa,X7) != sz00 )
& ( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElement0(X9)
| sdtasdt0(xb,X9) != sz00
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElement0(X7)
| sdtasdt0(xa,X7) != sz00 )
& ( ~ aElement0(X10)
| sdtasdt0(xb,X10) != xb
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElement0(X7)
| sdtasdt0(xa,X7) != sz00 )
& ( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElement0(X7)
| sdtasdt0(xa,X7) != sz00 )
& ( ~ aElement0(X10)
| sdtasdt0(xb,X10) != xb
| ~ aElement0(X9)
| sdtasdt0(xb,X9) != sz00
| ~ aElement0(X8)
| sdtasdt0(xa,X8) != xa
| ~ aElementOf0(sz00,slsdtgt0(xa)) )
& ( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElement0(X9)
| sdtasdt0(xb,X9) != sz00
| ~ aElement0(X8)
| sdtasdt0(xa,X8) != xa
| ~ aElementOf0(sz00,slsdtgt0(xa)) )
& ( ~ aElement0(X10)
| sdtasdt0(xb,X10) != xb
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElement0(X8)
| sdtasdt0(xa,X8) != xa
| ~ aElementOf0(sz00,slsdtgt0(xa)) )
& ( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElement0(X8)
| sdtasdt0(xa,X8) != xa
| ~ aElementOf0(sz00,slsdtgt0(xa)) )
& ( ~ aElement0(X10)
| sdtasdt0(xb,X10) != xb
| ~ aElement0(X9)
| sdtasdt0(xb,X9) != sz00
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xa)) )
& ( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElement0(X9)
| sdtasdt0(xb,X9) != sz00
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xa)) )
& ( ~ aElement0(X10)
| sdtasdt0(xb,X10) != xb
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xa)) )
& ( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xa)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_12,hypothesis,
( aElementOf0(sdtasdt0(xa,X1),slsdtgt0(xa))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_15,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_16,hypothesis,
( aElementOf0(X2,slsdtgt0(xb))
| ~ aElement0(X1)
| sdtasdt0(xb,X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,hypothesis,
aElementOf0(sz00,slsdtgt0(xa)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_19,hypothesis,
( aElementOf0(sdtasdt0(xb,X1),slsdtgt0(xb))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_20,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
fof(c_0_21,plain,
! [X97] :
( ( sdtasdt0(X97,sz10) = X97
| ~ aElement0(X97) )
& ( X97 = sdtasdt0(sz10,X97)
| ~ aElement0(X97) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulUnit])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_23,hypothesis,
aElementOf0(sz00,slsdtgt0(xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_14]),c_0_20])]) ).
cnf(c_0_24,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_26,negated_conjecture,
( ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_27,hypothesis,
aElementOf0(xb,slsdtgt0(xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_24]),c_0_25]),c_0_20])]) ).
cnf(c_0_28,negated_conjecture,
~ aElementOf0(xa,slsdtgt0(xa)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_29,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_24]),c_0_25]),c_0_15])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : RNG108+4 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 19:56:07 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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/tmp/tmp.siLckQgilI/E---3.1_3549.p
% 0.15/0.45 # Version: 3.1pre001
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # sh5l with pid 3629 completed with status 0
% 0.15/0.45 # Result found by sh5l
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.15/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.15/0.45 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3636 completed with status 0
% 0.15/0.45 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.15/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.15/0.45 # Preprocessing time : 0.003 s
% 0.15/0.45 # Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 # Proof found!
% 0.15/0.45 # SZS status Theorem
% 0.15/0.45 # SZS output start CNFRefutation
% See solution above
% 0.15/0.45 # Parsed axioms : 43
% 0.15/0.45 # Removed by relevancy pruning/SinE : 0
% 0.15/0.45 # Initial clauses : 165
% 0.15/0.45 # Removed in clause preprocessing : 4
% 0.15/0.45 # Initial clauses in saturation : 161
% 0.15/0.45 # Processed clauses : 235
% 0.15/0.45 # ...of these trivial : 1
% 0.15/0.45 # ...subsumed : 4
% 0.15/0.45 # ...remaining for further processing : 229
% 0.15/0.45 # Other redundant clauses eliminated : 19
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 2
% 0.15/0.45 # Backward-rewritten : 4
% 0.15/0.45 # Generated clauses : 39
% 0.15/0.45 # ...of the previous two non-redundant : 29
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 1
% 0.15/0.45 # Paramodulations : 22
% 0.15/0.45 # Factorizations : 0
% 0.15/0.45 # NegExts : 0
% 0.15/0.45 # Equation resolutions : 19
% 0.15/0.45 # Total rewrite steps : 45
% 0.15/0.45 # Propositional unsat checks : 0
% 0.15/0.45 # Propositional check models : 0
% 0.15/0.45 # Propositional check unsatisfiable : 0
% 0.15/0.45 # Propositional clauses : 0
% 0.15/0.45 # Propositional clauses after purity: 0
% 0.15/0.45 # Propositional unsat core size : 0
% 0.15/0.45 # Propositional preprocessing time : 0.000
% 0.15/0.45 # Propositional encoding time : 0.000
% 0.15/0.45 # Propositional solver time : 0.000
% 0.15/0.45 # Success case prop preproc time : 0.000
% 0.15/0.45 # Success case prop encoding time : 0.000
% 0.15/0.45 # Success case prop solver time : 0.000
% 0.15/0.45 # Current number of processed clauses : 46
% 0.15/0.45 # Positive orientable unit clauses : 20
% 0.15/0.45 # Positive unorientable unit clauses: 0
% 0.15/0.45 # Negative unit clauses : 2
% 0.15/0.45 # Non-unit-clauses : 24
% 0.15/0.45 # Current number of unprocessed clauses: 115
% 0.15/0.45 # ...number of literals in the above : 509
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 166
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 5532
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 1529
% 0.15/0.45 # Non-unit clause-clause subsumptions : 6
% 0.15/0.45 # Unit Clause-clause subsumption calls : 8
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 3
% 0.15/0.45 # BW rewrite match successes : 3
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 11508
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.020 s
% 0.15/0.45 # System time : 0.004 s
% 0.15/0.45 # Total time : 0.024 s
% 0.15/0.45 # Maximum resident set size: 2228 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.022 s
% 0.15/0.45 # System time : 0.007 s
% 0.15/0.45 # Total time : 0.028 s
% 0.15/0.45 # Maximum resident set size: 1744 pages
% 0.15/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------