TSTP Solution File: SET693+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET693+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:23:23 EDT 2023
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 65 ( 7 unt; 0 def)
% Number of atoms : 166 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 189 ( 88 ~; 85 |; 9 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 63 ( 2 sgn; 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI20,conjecture,
! [X1,X2] :
( equal_set(X1,union(X1,X2))
<=> subset(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.w52P6pFdwN/E---3.1_18603.p',thI20) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.w52P6pFdwN/E---3.1_18603.p',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.w52P6pFdwN/E---3.1_18603.p',subset) ).
fof(power_set,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.w52P6pFdwN/E---3.1_18603.p',power_set) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.w52P6pFdwN/E---3.1_18603.p',union) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( equal_set(X1,union(X1,X2))
<=> subset(X2,X1) ),
inference(assume_negation,[status(cth)],[thI20]) ).
fof(c_0_6,plain,
! [X12,X13] :
( ( subset(X12,X13)
| ~ equal_set(X12,X13) )
& ( subset(X13,X12)
| ~ equal_set(X12,X13) )
& ( ~ subset(X12,X13)
| ~ subset(X13,X12)
| equal_set(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
fof(c_0_7,negated_conjecture,
( ( ~ equal_set(esk4_0,union(esk4_0,esk5_0))
| ~ subset(esk5_0,esk4_0) )
& ( equal_set(esk4_0,union(esk4_0,esk5_0))
| subset(esk5_0,esk4_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ subset(X6,X7)
| ~ member(X8,X6)
| member(X8,X7) )
& ( member(esk1_2(X9,X10),X9)
| subset(X9,X10) )
& ( ~ member(esk1_2(X9,X10),X10)
| subset(X9,X10) ) ),
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)],[subset])])])])])]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| ~ equal_set(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( equal_set(esk4_0,union(esk4_0,esk5_0))
| subset(esk5_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( ~ equal_set(esk4_0,union(esk4_0,esk5_0))
| ~ subset(esk5_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X14,X15] :
( ( ~ member(X14,power_set(X15))
| subset(X14,X15) )
& ( ~ subset(X14,X15)
| member(X14,power_set(X15)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])]) ).
cnf(c_0_14,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( subset(union(esk4_0,esk5_0),esk4_0)
| subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ subset(union(esk4_0,esk5_0),esk4_0)
| ~ subset(esk4_0,union(esk4_0,esk5_0))
| ~ subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( member(X1,esk4_0)
| subset(esk5_0,esk4_0)
| ~ member(X1,union(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_20,plain,
! [X19,X20,X21] :
( ( ~ member(X19,union(X20,X21))
| member(X19,X20)
| member(X19,X21) )
& ( ~ member(X19,X20)
| member(X19,union(X20,X21)) )
& ( ~ member(X19,X21)
| member(X19,union(X20,X21)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ member(union(esk4_0,esk5_0),power_set(esk4_0))
| ~ subset(esk4_0,union(esk4_0,esk5_0))
| ~ subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,plain,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( member(esk5_0,power_set(esk4_0))
| member(X1,esk4_0)
| ~ member(X1,union(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( member(X1,X2)
| ~ member(X3,power_set(X2))
| ~ member(X1,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_27,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(esk1_2(esk4_0,union(esk4_0,esk5_0)),union(esk4_0,esk5_0))
| ~ member(union(esk4_0,esk5_0),power_set(esk4_0))
| ~ subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( subset(esk4_0,union(esk4_0,esk5_0))
| subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_30,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
( member(esk1_2(X1,X2),X1)
| member(X1,power_set(X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(esk1_2(esk4_0,union(esk4_0,esk5_0)),union(esk4_0,esk5_0))
| ~ member(union(esk4_0,esk5_0),power_set(esk4_0))
| ~ member(esk5_0,power_set(esk4_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_17]) ).
cnf(c_0_33,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_34,negated_conjecture,
( member(esk4_0,power_set(union(esk4_0,esk5_0)))
| subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)
| ~ subset(esk4_0,union(esk4_0,esk5_0))
| ~ subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_36,negated_conjecture,
( ~ member(union(esk4_0,esk5_0),power_set(esk4_0))
| ~ member(esk4_0,power_set(union(esk4_0,esk5_0)))
| ~ subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_37,plain,
( member(X1,power_set(X2))
| ~ member(esk1_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_38,negated_conjecture,
( member(esk1_2(esk5_0,X1),esk4_0)
| member(esk5_0,power_set(X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
( ~ member(esk1_2(esk4_0,union(esk4_0,esk5_0)),esk4_0)
| ~ member(union(esk4_0,esk5_0),power_set(esk4_0))
| ~ member(esk5_0,power_set(esk4_0)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( member(esk4_0,power_set(union(esk4_0,esk5_0)))
| member(esk5_0,power_set(esk4_0)) ),
inference(spm,[status(thm)],[c_0_18,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( ~ member(esk1_2(esk4_0,union(esk4_0,esk5_0)),union(esk4_0,esk5_0))
| ~ member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)
| ~ subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_22]) ).
cnf(c_0_42,negated_conjecture,
( ~ member(union(esk4_0,esk5_0),power_set(esk4_0))
| ~ member(esk4_0,power_set(union(esk4_0,esk5_0)))
| ~ member(esk5_0,power_set(esk4_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_17]) ).
cnf(c_0_43,negated_conjecture,
member(esk5_0,power_set(esk4_0)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( member(esk4_0,power_set(union(esk4_0,esk5_0)))
| ~ member(union(esk4_0,esk5_0),power_set(esk4_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_31]),c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( ~ member(esk1_2(esk4_0,union(esk4_0,esk5_0)),union(esk4_0,esk5_0))
| ~ member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)
| ~ member(esk5_0,power_set(esk4_0)) ),
inference(spm,[status(thm)],[c_0_41,c_0_17]) ).
cnf(c_0_46,negated_conjecture,
( member(esk1_2(union(esk4_0,esk5_0),esk4_0),union(esk4_0,esk5_0))
| ~ subset(esk4_0,union(esk4_0,esk5_0))
| ~ subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_47,negated_conjecture,
( member(union(esk4_0,esk5_0),power_set(esk4_0))
| subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_48,negated_conjecture,
~ member(union(esk4_0,esk5_0),power_set(esk4_0)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( member(esk1_2(esk4_0,union(esk4_0,esk5_0)),esk4_0)
| ~ member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)
| ~ subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_27]) ).
cnf(c_0_50,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)
| ~ member(esk1_2(esk4_0,union(esk4_0,esk5_0)),esk4_0)
| ~ member(esk5_0,power_set(esk4_0)) ),
inference(spm,[status(thm)],[c_0_45,c_0_33]) ).
cnf(c_0_51,negated_conjecture,
( member(esk1_2(union(esk4_0,esk5_0),esk4_0),union(esk4_0,esk5_0))
| ~ member(esk1_2(esk4_0,union(esk4_0,esk5_0)),union(esk4_0,esk5_0))
| ~ subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_22]) ).
cnf(c_0_52,negated_conjecture,
subset(esk5_0,esk4_0),
inference(sr,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)
| ~ member(esk5_0,power_set(esk4_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_17]),c_0_50]) ).
cnf(c_0_54,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_55,negated_conjecture,
( member(esk1_2(union(esk4_0,esk5_0),esk4_0),union(esk4_0,esk5_0))
| ~ member(esk1_2(esk4_0,union(esk4_0,esk5_0)),union(esk4_0,esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_56,negated_conjecture,
~ member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_43])]) ).
cnf(c_0_57,negated_conjecture,
( member(esk1_2(union(esk4_0,esk5_0),esk4_0),union(esk4_0,esk5_0))
| ~ member(esk4_0,power_set(union(esk4_0,esk5_0)))
| ~ subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_17]) ).
cnf(c_0_58,negated_conjecture,
( member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk5_0)
| ~ member(esk1_2(esk4_0,union(esk4_0,esk5_0)),union(esk4_0,esk5_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_59,negated_conjecture,
( member(esk1_2(union(esk4_0,esk5_0),esk4_0),union(esk4_0,esk5_0))
| ~ member(esk4_0,power_set(union(esk4_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_52])]) ).
cnf(c_0_60,negated_conjecture,
( member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk5_0)
| ~ member(esk1_2(esk4_0,union(esk4_0,esk5_0)),esk4_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_33]) ).
cnf(c_0_61,negated_conjecture,
( member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk5_0)
| ~ member(esk4_0,power_set(union(esk4_0,esk5_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_59]),c_0_56]) ).
cnf(c_0_62,negated_conjecture,
~ member(esk1_2(esk4_0,union(esk4_0,esk5_0)),esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_60]),c_0_56]) ).
cnf(c_0_63,negated_conjecture,
~ member(esk4_0,power_set(union(esk4_0,esk5_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_61]),c_0_56]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_31]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET693+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n025.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 17:59:06 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.w52P6pFdwN/E---3.1_18603.p
% 0.15/0.45 # Version: 3.1pre001
% 0.15/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18727 completed with status 0
% 0.15/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 # No SInE strategy applied
% 0.15/0.45 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.15/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 811s (1) cores
% 0.15/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.45 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.45 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 0.15/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S05BI with 136s (1) cores
% 0.15/0.45 # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 18734 completed with status 0
% 0.15/0.45 # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.15/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 # No SInE strategy applied
% 0.15/0.45 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.15/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 811s (1) cores
% 0.15/0.45 # Preprocessing time : 0.001 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 : 12
% 0.15/0.45 # Removed by relevancy pruning/SinE : 0
% 0.15/0.45 # Initial clauses : 31
% 0.15/0.45 # Removed in clause preprocessing : 0
% 0.15/0.45 # Initial clauses in saturation : 31
% 0.15/0.45 # Processed clauses : 206
% 0.15/0.45 # ...of these trivial : 0
% 0.15/0.45 # ...subsumed : 18
% 0.15/0.45 # ...remaining for further processing : 188
% 0.15/0.45 # Other redundant clauses eliminated : 3
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 34
% 0.15/0.45 # Backward-rewritten : 17
% 0.15/0.45 # Generated clauses : 683
% 0.15/0.45 # ...of the previous two non-redundant : 668
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 7
% 0.15/0.45 # Paramodulations : 678
% 0.15/0.45 # Factorizations : 0
% 0.15/0.45 # NegExts : 0
% 0.15/0.45 # Equation resolutions : 3
% 0.15/0.45 # Total rewrite steps : 19
% 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 : 101
% 0.15/0.45 # Positive orientable unit clauses : 18
% 0.15/0.45 # Positive unorientable unit clauses: 0
% 0.15/0.45 # Negative unit clauses : 7
% 0.15/0.45 # Non-unit-clauses : 76
% 0.15/0.45 # Current number of unprocessed clauses: 522
% 0.15/0.45 # ...number of literals in the above : 1095
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 84
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 4977
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 3988
% 0.15/0.45 # Non-unit clause-clause subsumptions : 30
% 0.15/0.45 # Unit Clause-clause subsumption calls : 347
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 36
% 0.15/0.45 # BW rewrite match successes : 2
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 11191
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.021 s
% 0.15/0.45 # System time : 0.001 s
% 0.15/0.45 # Total time : 0.022 s
% 0.15/0.45 # Maximum resident set size: 1768 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.091 s
% 0.15/0.45 # System time : 0.009 s
% 0.15/0.45 # Total time : 0.100 s
% 0.15/0.45 # Maximum resident set size: 1684 pages
% 0.15/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------