TSTP Solution File: TOP028+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : TOP028+3 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Tue May 21 09:16:53 EDT 2024
% Result : Theorem 19.13s 3.35s
% Output : CNFRefutation 19.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 54 ( 24 unt; 0 def)
% Number of atoms : 170 ( 17 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 194 ( 78 ~; 60 |; 41 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 107 ( 12 sgn 65 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+9.ax',t3_subset) ).
fof(t36_xboole_1,axiom,
! [X1,X2] : r1_tarski(k4_xboole_0(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t36_xboole_1) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( r2_hidden(X1,X2)
& m1_subset_1(X2,k1_zfmisc_1(X3))
& v1_xboole_0(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+9.ax',t5_subset) ).
fof(t6_mcart_1,axiom,
! [X1] :
~ ( X1 != k1_xboole_0
& ! [X2] :
~ ( r2_hidden(X2,X1)
& ! [X3,X4,X5,X6,X7] :
( ( r2_hidden(X3,X4)
& r2_hidden(X4,X5)
& r2_hidden(X5,X6)
& r2_hidden(X6,X7)
& r2_hidden(X7,X2) )
=> r1_xboole_0(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+18.ax',t6_mcart_1) ).
fof(t10_tsp_2,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ? [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v1_tsp_2(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_tsp_2) ).
fof(t9_tsp_2,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( v1_tsp_1(X2,X1)
& ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( r1_tarski(X2,X3)
& v1_tsp_2(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_tsp_2) ).
fof(t48_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t48_xboole_1) ).
fof(t3_boole,axiom,
! [X1] : k4_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+3.ax',t3_boole) ).
fof(t17_xboole_1,axiom,
! [X1,X2] : r1_tarski(k3_xboole_0(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t17_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k3_xboole_0) ).
fof(t13_tsp_1,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( ( v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> v1_tsp_1(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+406.ax',t13_tsp_1) ).
fof(fc1_xboole_0,axiom,
v1_xboole_0(k1_xboole_0),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',fc1_xboole_0) ).
fof(c_0_12,plain,
! [X89,X90] :
( ( ~ m1_subset_1(X89,k1_zfmisc_1(X90))
| r1_tarski(X89,X90) )
& ( ~ r1_tarski(X89,X90)
| m1_subset_1(X89,k1_zfmisc_1(X90)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_13,plain,
! [X2324,X2325] : r1_tarski(k4_xboole_0(X2324,X2325),X2324),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
fof(c_0_14,plain,
! [X94,X95,X96] :
( ~ r2_hidden(X94,X95)
| ~ m1_subset_1(X95,k1_zfmisc_1(X96))
| ~ v1_xboole_0(X96) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])])]) ).
cnf(c_0_15,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
r1_tarski(k4_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X1] :
~ ( X1 != k1_xboole_0
& ! [X2] :
~ ( r2_hidden(X2,X1)
& ! [X3,X4,X5,X6,X7] :
( ( r2_hidden(X3,X4)
& r2_hidden(X4,X5)
& r2_hidden(X5,X6)
& r2_hidden(X6,X7)
& r2_hidden(X7,X2) )
=> r1_xboole_0(X3,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t6_mcart_1]) ).
cnf(c_0_18,plain,
( ~ r2_hidden(X1,X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(X3))
| ~ v1_xboole_0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
m1_subset_1(k4_xboole_0(X1,X2),k1_zfmisc_1(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,plain,
! [X2758,X2760,X2761,X2762,X2763,X2764] :
( ( r2_hidden(esk337_1(X2758),X2758)
| X2758 = k1_xboole_0 )
& ( ~ r2_hidden(X2760,X2761)
| ~ r2_hidden(X2761,X2762)
| ~ r2_hidden(X2762,X2763)
| ~ r2_hidden(X2763,X2764)
| ~ r2_hidden(X2764,esk337_1(X2758))
| r1_xboole_0(X2760,X2758)
| X2758 = k1_xboole_0 ) ),
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)],[c_0_17])])])])])])]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ? [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v1_tsp_2(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t10_tsp_2])]) ).
fof(c_0_22,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( v1_tsp_1(X2,X1)
& ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( r1_tarski(X2,X3)
& v1_tsp_2(X3,X1) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[t9_tsp_2]) ).
fof(c_0_23,plain,
! [X1999,X2000] : k4_xboole_0(X1999,k4_xboole_0(X1999,X2000)) = k3_xboole_0(X1999,X2000),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
cnf(c_0_24,plain,
( ~ v1_xboole_0(X1)
| ~ r2_hidden(X2,k4_xboole_0(X1,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( r2_hidden(esk337_1(X1),X1)
| X1 = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_26,plain,
! [X2310] : k4_xboole_0(X2310,k1_xboole_0) = X2310,
inference(variable_rename,[status(thm)],[t3_boole]) ).
fof(c_0_27,negated_conjecture,
! [X16] :
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& ( ~ m1_subset_1(X16,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ v1_tsp_2(X16,esk1_0) ) ),
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_21])])])])]) ).
fof(c_0_28,plain,
! [X51,X52] :
( ( m1_subset_1(esk5_2(X51,X52),k1_zfmisc_1(u1_struct_0(X51)))
| ~ v1_tsp_1(X52,X51)
| ~ m1_subset_1(X52,k1_zfmisc_1(u1_struct_0(X51)))
| v3_struct_0(X51)
| ~ v2_pre_topc(X51)
| ~ l1_pre_topc(X51) )
& ( r1_tarski(X52,esk5_2(X51,X52))
| ~ v1_tsp_1(X52,X51)
| ~ m1_subset_1(X52,k1_zfmisc_1(u1_struct_0(X51)))
| v3_struct_0(X51)
| ~ v2_pre_topc(X51)
| ~ l1_pre_topc(X51) )
& ( v1_tsp_2(esk5_2(X51,X52),X51)
| ~ v1_tsp_1(X52,X51)
| ~ m1_subset_1(X52,k1_zfmisc_1(u1_struct_0(X51)))
| v3_struct_0(X51)
| ~ v2_pre_topc(X51)
| ~ l1_pre_topc(X51) ) ),
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_22])])])])])]) ).
fof(c_0_29,plain,
! [X1954,X1955] : r1_tarski(k3_xboole_0(X1954,X1955),X1954),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_30,plain,
! [X1947,X1948] : k3_xboole_0(X1947,X1948) = k3_xboole_0(X1948,X1947),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_31,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( k4_xboole_0(X1,X2) = k1_xboole_0
| ~ v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
k4_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,negated_conjecture,
( ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ v1_tsp_2(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
( v1_tsp_2(esk5_2(X1,X2),X1)
| v3_struct_0(X1)
| ~ v1_tsp_1(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_39,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( ( v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> v1_tsp_1(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[t13_tsp_1]) ).
cnf(c_0_40,plain,
r1_tarski(k3_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,plain,
k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
( k3_xboole_0(X1,X2) = X1
| ~ v1_xboole_0(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_43,negated_conjecture,
( ~ v1_tsp_1(X1,esk1_0)
| ~ m1_subset_1(esk5_2(esk1_0,X1),k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_44,plain,
( m1_subset_1(esk5_2(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
| v3_struct_0(X1)
| ~ v1_tsp_1(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_45,plain,
! [X214,X215] :
( v3_struct_0(X214)
| ~ v2_pre_topc(X214)
| ~ l1_pre_topc(X214)
| ~ v1_xboole_0(X215)
| ~ m1_subset_1(X215,k1_zfmisc_1(u1_struct_0(X214)))
| v1_tsp_1(X215,X214) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])])]) ).
cnf(c_0_46,plain,
m1_subset_1(k3_xboole_0(X1,X2),k1_zfmisc_1(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_40]) ).
cnf(c_0_47,plain,
( k3_xboole_0(X1,X2) = X2
| ~ v1_xboole_0(X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( ~ v1_tsp_1(X1,esk1_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_49,plain,
( v3_struct_0(X1)
| v1_tsp_1(X2,X1)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ v1_xboole_0(X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_50,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_52,negated_conjecture,
~ v1_xboole_0(X1),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_36]),c_0_37])]),c_0_38]),c_0_50]) ).
cnf(c_0_53,plain,
$false,
inference(sr,[status(thm)],[c_0_51,c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : TOP028+3 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat May 18 11:22:09 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/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/benchmark/theBenchmark.p
% 19.13/3.35 # Version: 3.1.0
% 19.13/3.35 # Preprocessing class: FMLLSMLLSSSNFFN.
% 19.13/3.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.13/3.35 # Starting new_bool_3 with 900s (3) cores
% 19.13/3.35 # Starting new_bool_1 with 900s (3) cores
% 19.13/3.35 # Starting sh5l with 300s (1) cores
% 19.13/3.35 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 19.13/3.35 # new_bool_1 with pid 10571 completed with status 0
% 19.13/3.35 # Result found by new_bool_1
% 19.13/3.35 # Preprocessing class: FMLLSMLLSSSNFFN.
% 19.13/3.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.13/3.35 # Starting new_bool_3 with 900s (3) cores
% 19.13/3.35 # Starting new_bool_1 with 900s (3) cores
% 19.13/3.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 19.13/3.35 # Search class: FGHSM-SMLM31-MFFFFFNN
% 19.13/3.35 # Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 19.13/3.35 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 541s (1) cores
% 19.13/3.35 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 19.13/3.35 # Starting new_bool_3 with 91s (1) cores
% 19.13/3.35 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 10575 completed with status 0
% 19.13/3.35 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 19.13/3.35 # Preprocessing class: FMLLSMLLSSSNFFN.
% 19.13/3.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.13/3.35 # Starting new_bool_3 with 900s (3) cores
% 19.13/3.35 # Starting new_bool_1 with 900s (3) cores
% 19.13/3.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 19.13/3.35 # Search class: FGHSM-SMLM31-MFFFFFNN
% 19.13/3.35 # Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 19.13/3.35 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 541s (1) cores
% 19.13/3.35 # Preprocessing time : 0.057 s
% 19.13/3.35 # Presaturation interreduction done
% 19.13/3.35
% 19.13/3.35 # Proof found!
% 19.13/3.35 # SZS status Theorem
% 19.13/3.35 # SZS output start CNFRefutation
% See solution above
% 19.13/3.35 # Parsed axioms : 13486
% 19.13/3.35 # Removed by relevancy pruning/SinE : 12283
% 19.13/3.35 # Initial clauses : 3081
% 19.13/3.35 # Removed in clause preprocessing : 99
% 19.13/3.35 # Initial clauses in saturation : 2982
% 19.13/3.35 # Processed clauses : 16503
% 19.13/3.35 # ...of these trivial : 210
% 19.13/3.35 # ...subsumed : 9182
% 19.13/3.35 # ...remaining for further processing : 7111
% 19.13/3.35 # Other redundant clauses eliminated : 287
% 19.13/3.35 # Clauses deleted for lack of memory : 0
% 19.13/3.35 # Backward-subsumed : 351
% 19.13/3.35 # Backward-rewritten : 124
% 19.13/3.35 # Generated clauses : 40321
% 19.13/3.35 # ...of the previous two non-redundant : 36338
% 19.13/3.35 # ...aggressively subsumed : 0
% 19.13/3.35 # Contextual simplify-reflections : 426
% 19.13/3.35 # Paramodulations : 39935
% 19.13/3.35 # Factorizations : 2
% 19.13/3.35 # NegExts : 0
% 19.13/3.35 # Equation resolutions : 298
% 19.13/3.35 # Disequality decompositions : 0
% 19.13/3.35 # Total rewrite steps : 7448
% 19.13/3.35 # ...of those cached : 6261
% 19.13/3.35 # Propositional unsat checks : 1
% 19.13/3.35 # Propositional check models : 1
% 19.13/3.35 # Propositional check unsatisfiable : 0
% 19.13/3.35 # Propositional clauses : 0
% 19.13/3.35 # Propositional clauses after purity: 0
% 19.13/3.35 # Propositional unsat core size : 0
% 19.13/3.35 # Propositional preprocessing time : 0.000
% 19.13/3.35 # Propositional encoding time : 0.018
% 19.13/3.35 # Propositional solver time : 0.012
% 19.13/3.35 # Success case prop preproc time : 0.000
% 19.13/3.35 # Success case prop encoding time : 0.000
% 19.13/3.35 # Success case prop solver time : 0.000
% 19.13/3.35 # Current number of processed clauses : 3660
% 19.13/3.35 # Positive orientable unit clauses : 607
% 19.13/3.35 # Positive unorientable unit clauses: 2
% 19.13/3.35 # Negative unit clauses : 802
% 19.13/3.35 # Non-unit-clauses : 2249
% 19.13/3.35 # Current number of unprocessed clauses: 25294
% 19.13/3.35 # ...number of literals in the above : 87331
% 19.13/3.35 # Current number of archived formulas : 0
% 19.13/3.35 # Current number of archived clauses : 3273
% 19.13/3.35 # Clause-clause subsumption calls (NU) : 6754037
% 19.13/3.35 # Rec. Clause-clause subsumption calls : 966869
% 19.13/3.35 # Non-unit clause-clause subsumptions : 3273
% 19.13/3.35 # Unit Clause-clause subsumption calls : 318926
% 19.13/3.35 # Rewrite failures with RHS unbound : 0
% 19.13/3.35 # BW rewrite match attempts : 585
% 19.13/3.35 # BW rewrite match successes : 169
% 19.13/3.35 # Condensation attempts : 0
% 19.13/3.35 # Condensation successes : 0
% 19.13/3.35 # Termbank termtop insertions : 1063014
% 19.13/3.35 # Search garbage collected termcells : 162553
% 19.13/3.35
% 19.13/3.35 # -------------------------------------------------
% 19.13/3.35 # User time : 2.356 s
% 19.13/3.35 # System time : 0.082 s
% 19.13/3.35 # Total time : 2.439 s
% 19.13/3.35 # Maximum resident set size: 29132 pages
% 19.13/3.35
% 19.13/3.35 # -------------------------------------------------
% 19.13/3.35 # User time : 7.043 s
% 19.13/3.35 # System time : 0.158 s
% 19.13/3.35 # Total time : 7.202 s
% 19.13/3.35 # Maximum resident set size: 19860 pages
% 19.13/3.35 % E---3.1 exiting
%------------------------------------------------------------------------------