TSTP Solution File: RNG106+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG106+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 7 unt; 0 def)
% Number of atoms : 221 ( 33 equ)
% Maximal formula atoms : 33 ( 5 avg)
% Number of connectives : 300 ( 118 ~; 125 |; 45 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 2 con; 0-3 aty)
% Number of variables : 63 ( 2 sgn; 30 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1,X2,X3] :
( ( aElementOf0(X1,slsdtgt0(xc))
& aElementOf0(X2,slsdtgt0(xc))
& aElement0(X3) )
=> ? [X4] :
( aElement0(X4)
& sdtasdt0(xc,X4) = X1
& ? [X5] :
( aElement0(X5)
& sdtasdt0(xc,X5) = X2
& sdtpldt0(X1,X2) = sdtasdt0(xc,sdtpldt0(X4,X5))
& sdtasdt0(X3,X1) = sdtasdt0(xc,sdtasdt0(X4,X3))
& aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
& aElementOf0(sdtasdt0(X3,X1),slsdtgt0(xc)) ) ) )
=> aIdeal0(slsdtgt0(xc)) ),
file('/export/starexec/sandbox/tmp/tmp.zecj96VPFO/E---3.1_21000.p',m__) ).
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zecj96VPFO/E---3.1_21000.p',mDefPrIdeal) ).
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zecj96VPFO/E---3.1_21000.p',mDefIdeal) ).
fof(m__1905,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox/tmp/tmp.zecj96VPFO/E---3.1_21000.p',m__1905) ).
fof(mMulZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.zecj96VPFO/E---3.1_21000.p',mMulZero) ).
fof(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox/tmp/tmp.zecj96VPFO/E---3.1_21000.p',mSortsC) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X1,X2,X3] :
( ( aElementOf0(X1,slsdtgt0(xc))
& aElementOf0(X2,slsdtgt0(xc))
& aElement0(X3) )
=> ? [X4] :
( aElement0(X4)
& sdtasdt0(xc,X4) = X1
& ? [X5] :
( aElement0(X5)
& sdtasdt0(xc,X5) = X2
& sdtpldt0(X1,X2) = sdtasdt0(xc,sdtpldt0(X4,X5))
& sdtasdt0(X3,X1) = sdtasdt0(xc,sdtasdt0(X4,X3))
& aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
& aElementOf0(sdtasdt0(X3,X1),slsdtgt0(xc)) ) ) )
=> aIdeal0(slsdtgt0(xc)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
! [X7,X8,X9] :
( ( aElement0(esk1_3(X7,X8,X9))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElementOf0(X8,slsdtgt0(xc))
| ~ aElement0(X9) )
& ( sdtasdt0(xc,esk1_3(X7,X8,X9)) = X7
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElementOf0(X8,slsdtgt0(xc))
| ~ aElement0(X9) )
& ( aElement0(esk2_3(X7,X8,X9))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElementOf0(X8,slsdtgt0(xc))
| ~ aElement0(X9) )
& ( sdtasdt0(xc,esk2_3(X7,X8,X9)) = X8
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElementOf0(X8,slsdtgt0(xc))
| ~ aElement0(X9) )
& ( sdtpldt0(X7,X8) = sdtasdt0(xc,sdtpldt0(esk1_3(X7,X8,X9),esk2_3(X7,X8,X9)))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElementOf0(X8,slsdtgt0(xc))
| ~ aElement0(X9) )
& ( sdtasdt0(X9,X7) = sdtasdt0(xc,sdtasdt0(esk1_3(X7,X8,X9),X9))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElementOf0(X8,slsdtgt0(xc))
| ~ aElement0(X9) )
& ( aElementOf0(sdtpldt0(X7,X8),slsdtgt0(xc))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElementOf0(X8,slsdtgt0(xc))
| ~ aElement0(X9) )
& ( aElementOf0(sdtasdt0(X9,X7),slsdtgt0(xc))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElementOf0(X8,slsdtgt0(xc))
| ~ aElement0(X9) )
& ~ aIdeal0(slsdtgt0(xc)) ),
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)],[c_0_6])])])])])]) ).
fof(c_0_8,plain,
! [X20,X21,X22,X24,X25,X26,X28] :
( ( aSet0(X21)
| X21 != slsdtgt0(X20)
| ~ aElement0(X20) )
& ( aElement0(esk6_3(X20,X21,X22))
| ~ aElementOf0(X22,X21)
| X21 != slsdtgt0(X20)
| ~ aElement0(X20) )
& ( sdtasdt0(X20,esk6_3(X20,X21,X22)) = X22
| ~ aElementOf0(X22,X21)
| X21 != slsdtgt0(X20)
| ~ aElement0(X20) )
& ( ~ aElement0(X25)
| sdtasdt0(X20,X25) != X24
| aElementOf0(X24,X21)
| X21 != slsdtgt0(X20)
| ~ aElement0(X20) )
& ( ~ aElementOf0(esk7_2(X20,X26),X26)
| ~ aElement0(X28)
| sdtasdt0(X20,X28) != esk7_2(X20,X26)
| ~ aSet0(X26)
| X26 = slsdtgt0(X20)
| ~ aElement0(X20) )
& ( aElement0(esk8_2(X20,X26))
| aElementOf0(esk7_2(X20,X26),X26)
| ~ aSet0(X26)
| X26 = slsdtgt0(X20)
| ~ aElement0(X20) )
& ( sdtasdt0(X20,esk8_2(X20,X26)) = esk7_2(X20,X26)
| aElementOf0(esk7_2(X20,X26),X26)
| ~ aSet0(X26)
| X26 = slsdtgt0(X20)
| ~ aElement0(X20) ) ),
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)],[mDefPrIdeal])])])])])]) ).
fof(c_0_9,plain,
! [X12,X13,X14,X15,X16] :
( ( aSet0(X12)
| ~ aIdeal0(X12) )
& ( ~ aElementOf0(X14,X12)
| aElementOf0(sdtpldt0(X13,X14),X12)
| ~ aElementOf0(X13,X12)
| ~ aIdeal0(X12) )
& ( ~ aElement0(X15)
| aElementOf0(sdtasdt0(X15,X13),X12)
| ~ aElementOf0(X13,X12)
| ~ aIdeal0(X12) )
& ( aElementOf0(esk3_1(X16),X16)
| ~ aSet0(X16)
| aIdeal0(X16) )
& ( aElement0(esk5_1(X16))
| aElementOf0(esk4_1(X16),X16)
| ~ aSet0(X16)
| aIdeal0(X16) )
& ( ~ aElementOf0(sdtasdt0(esk5_1(X16),esk3_1(X16)),X16)
| aElementOf0(esk4_1(X16),X16)
| ~ aSet0(X16)
| aIdeal0(X16) )
& ( aElement0(esk5_1(X16))
| ~ aElementOf0(sdtpldt0(esk3_1(X16),esk4_1(X16)),X16)
| ~ aSet0(X16)
| aIdeal0(X16) )
& ( ~ aElementOf0(sdtasdt0(esk5_1(X16),esk3_1(X16)),X16)
| ~ aElementOf0(sdtpldt0(esk3_1(X16),esk4_1(X16)),X16)
| ~ aSet0(X16)
| aIdeal0(X16) ) ),
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)],[mDefIdeal])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
| ~ aElementOf0(X1,slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__1905]) ).
cnf(c_0_12,plain,
( aElementOf0(X3,X4)
| ~ aElement0(X1)
| sdtasdt0(X2,X1) != X3
| X4 != slsdtgt0(X2)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X54] :
( ( sdtasdt0(X54,sz00) = sz00
| ~ aElement0(X54) )
& ( sz00 = sdtasdt0(sz00,X54)
| ~ aElement0(X54) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulZero])])]) ).
cnf(c_0_14,plain,
( aElement0(esk5_1(X1))
| aIdeal0(X1)
| ~ aElementOf0(sdtpldt0(esk3_1(X1),esk4_1(X1)),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
( aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aElementOf0(X1,slsdtgt0(xc)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ aIdeal0(slsdtgt0(xc)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(X1))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])]) ).
cnf(c_0_18,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_20,hypothesis,
( aElement0(esk5_1(slsdtgt0(xc)))
| ~ aElementOf0(esk4_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aElementOf0(esk3_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,plain,
( aElement0(esk5_1(X1))
| aElementOf0(esk4_1(X1),X1)
| aIdeal0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( aIdeal0(X1)
| ~ aElementOf0(sdtasdt0(esk5_1(X1),esk3_1(X1)),X1)
| ~ aElementOf0(sdtpldt0(esk3_1(X1),esk4_1(X1)),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aElementOf0(X3,slsdtgt0(xc))
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,plain,
( aElementOf0(sz00,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_25,hypothesis,
( aElement0(esk5_1(slsdtgt0(xc)))
| ~ aElementOf0(esk3_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_16]) ).
cnf(c_0_26,plain,
( aElementOf0(esk3_1(X1),X1)
| aIdeal0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,hypothesis,
( ~ aElementOf0(sdtasdt0(esk5_1(slsdtgt0(xc)),esk3_1(slsdtgt0(xc))),slsdtgt0(xc))
| ~ aElementOf0(esk4_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aElementOf0(esk3_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_16]) ).
cnf(c_0_28,negated_conjecture,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_11])]) ).
cnf(c_0_29,hypothesis,
( aElement0(esk5_1(slsdtgt0(xc)))
| ~ aSet0(slsdtgt0(xc)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_16]) ).
cnf(c_0_30,plain,
( aElementOf0(esk4_1(X1),X1)
| aIdeal0(X1)
| ~ aElementOf0(sdtasdt0(esk5_1(X1),esk3_1(X1)),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,negated_conjecture,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc))
| ~ aElement0(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_26]),c_0_16]) ).
cnf(c_0_32,negated_conjecture,
( ~ aElementOf0(esk4_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aElementOf0(esk3_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( aElementOf0(esk4_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aElementOf0(esk3_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc))
| ~ aElement0(esk5_1(slsdtgt0(xc))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16]) ).
cnf(c_0_34,negated_conjecture,
( ~ aElementOf0(esk3_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_29]) ).
cnf(c_0_35,plain,
( aSet0(X1)
| X1 != slsdtgt0(X2)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_36,negated_conjecture,
~ aSet0(slsdtgt0(xc)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_26]),c_0_16]) ).
cnf(c_0_37,plain,
( aSet0(slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG106+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n031.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 20:13:43 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.zecj96VPFO/E---3.1_21000.p
% 0.19/0.51 # Version: 3.1pre001
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # new_bool_1 with pid 21079 completed with status 0
% 0.19/0.51 # Result found by new_bool_1
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGUSF-FFMF31-MFFFFFNN
% 0.19/0.51 # partial match(1): FGUSM-FFMF31-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 75s (1) cores
% 0.19/0.51 # SAT001_MinMin_p005000_rr_RG with pid 21081 completed with status 0
% 0.19/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGUSF-FFMF31-MFFFFFNN
% 0.19/0.51 # partial match(1): FGUSM-FFMF31-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 75s (1) cores
% 0.19/0.51 # Preprocessing time : 0.001 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 39
% 0.19/0.51 # Removed by relevancy pruning/SinE : 20
% 0.19/0.51 # Initial clauses : 46
% 0.19/0.51 # Removed in clause preprocessing : 2
% 0.19/0.51 # Initial clauses in saturation : 44
% 0.19/0.51 # Processed clauses : 191
% 0.19/0.51 # ...of these trivial : 2
% 0.19/0.51 # ...subsumed : 52
% 0.19/0.51 # ...remaining for further processing : 137
% 0.19/0.51 # Other redundant clauses eliminated : 7
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 25
% 0.19/0.51 # Backward-rewritten : 2
% 0.19/0.51 # Generated clauses : 358
% 0.19/0.51 # ...of the previous two non-redundant : 310
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 5
% 0.19/0.51 # Paramodulations : 352
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 7
% 0.19/0.51 # Total rewrite steps : 178
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 62
% 0.19/0.51 # Positive orientable unit clauses : 6
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 2
% 0.19/0.51 # Non-unit-clauses : 54
% 0.19/0.51 # Current number of unprocessed clauses: 179
% 0.19/0.51 # ...number of literals in the above : 884
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 71
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 722
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 543
% 0.19/0.51 # Non-unit clause-clause subsumptions : 75
% 0.19/0.51 # Unit Clause-clause subsumption calls : 6
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 2
% 0.19/0.51 # BW rewrite match successes : 2
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 9450
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.017 s
% 0.19/0.51 # System time : 0.002 s
% 0.19/0.51 # Total time : 0.019 s
% 0.19/0.51 # Maximum resident set size: 1832 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.019 s
% 0.19/0.51 # System time : 0.004 s
% 0.19/0.51 # Total time : 0.023 s
% 0.19/0.51 # Maximum resident set size: 1728 pages
% 0.19/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------