%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : TOP028+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:53:53 PM UTC 2026
% Result : Theorem 36.57s 6.43s
% Output : CNFRefutation 36.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 24 unt; 0 def)
% Number of atoms : 175 ( 17 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 200 ( 80 ~; 60 |; 44 &)
% ( 1 <=>; 15 =>; 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 : 109 ( 12 sgn 66 !; 3 ?)
% 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] :
~ ( v1_xboole_0(X3)
& m1_subset_1(X2,k1_zfmisc_1(X3))
& r2_hidden(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+9.ax',t5_subset) ).
fof(t6_mcart_1,axiom,
! [X1] :
~ ( ! [X2] :
~ ( ! [X3,X4,X5,X6,X7] :
( ( r2_hidden(X7,X2)
& r2_hidden(X6,X7)
& r2_hidden(X5,X6)
& r2_hidden(X4,X5)
& r2_hidden(X3,X4) )
=> r1_xboole_0(X3,X1) )
& r2_hidden(X2,X1) )
& X1 != k1_xboole_0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+18.ax',t6_mcart_1) ).
fof(t10_tsp_2,conjecture,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ? [X2] :
( v1_tsp_2(X2,X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_tsp_2) ).
fof(t9_tsp_2,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( v1_tsp_2(X3,X1)
& r1_tarski(X2,X3) ) )
& v1_tsp_1(X2,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] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v1_xboole_0(X2) )
=> 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] :
( ~ v1_xboole_0(X96)
| ~ m1_subset_1(X95,k1_zfmisc_1(X96))
| ~ r2_hidden(X94,X95) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])])]) ).
cnf(c_0_15,plain,
( ~ r1_tarski(X1,X2)
| m1_subset_1(X1,k1_zfmisc_1(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] :
~ ( ! [X2] :
~ ( ! [X3,X4,X5,X6,X7] :
( ( r2_hidden(X7,X2)
& r2_hidden(X6,X7)
& r2_hidden(X5,X6)
& r2_hidden(X4,X5)
& r2_hidden(X3,X4) )
=> r1_xboole_0(X3,X1) )
& r2_hidden(X2,X1) )
& X1 != k1_xboole_0 ),
inference(fof_simplification,[status(thm)],[t6_mcart_1]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ? [X2] :
( v1_tsp_2(X2,X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
inference(assume_negation,[status(cth)],[t10_tsp_2]) ).
cnf(c_0_19,plain,
( ~ v1_xboole_0(X3)
| ~ m1_subset_1(X2,k1_zfmisc_1(X3))
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,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_21,plain,
! [X2758,X2760,X2761,X2762,X2763,X2764] :
( ( X2758 = k1_xboole_0
| r1_xboole_0(X2760,X2758)
| ~ r2_hidden(X2764,esk337_1(X2758))
| ~ r2_hidden(X2763,X2764)
| ~ r2_hidden(X2762,X2763)
| ~ r2_hidden(X2761,X2762)
| ~ r2_hidden(X2760,X2761) )
& ( X2758 = k1_xboole_0
| r2_hidden(esk337_1(X2758),X2758) ) ),
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_22,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ? [X2] :
( v1_tsp_2(X2,X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( v1_tsp_2(X3,X1)
& r1_tarski(X2,X3) ) )
& v1_tsp_1(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t9_tsp_2]) ).
fof(c_0_24,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_25,plain,
( ~ r2_hidden(X2,k4_xboole_0(X1,X3))
| ~ v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( X1 = k1_xboole_0
| r2_hidden(esk337_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,plain,
! [X2310] : k4_xboole_0(X2310,k1_xboole_0) = X2310,
inference(variable_rename,[status(thm)],[t3_boole]) ).
fof(c_0_28,negated_conjecture,
! [X16] :
( ( ~ v1_tsp_2(X16,esk1_0)
| ~ m1_subset_1(X16,k1_zfmisc_1(u1_struct_0(esk1_0))) )
& l1_pre_topc(esk1_0)
& v2_pre_topc(esk1_0)
& ~ v3_struct_0(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_22])])])])]) ).
fof(c_0_29,plain,
! [X51,X52] :
( ( ~ l1_pre_topc(X51)
| ~ v2_pre_topc(X51)
| v3_struct_0(X51)
| ~ m1_subset_1(X52,k1_zfmisc_1(u1_struct_0(X51)))
| ~ v1_tsp_1(X52,X51)
| v1_tsp_2(esk5_2(X51,X52),X51) )
& ( ~ l1_pre_topc(X51)
| ~ v2_pre_topc(X51)
| v3_struct_0(X51)
| ~ m1_subset_1(X52,k1_zfmisc_1(u1_struct_0(X51)))
| ~ v1_tsp_1(X52,X51)
| r1_tarski(X52,esk5_2(X51,X52)) )
& ( ~ l1_pre_topc(X51)
| ~ v2_pre_topc(X51)
| v3_struct_0(X51)
| ~ m1_subset_1(X52,k1_zfmisc_1(u1_struct_0(X51)))
| ~ v1_tsp_1(X52,X51)
| m1_subset_1(esk5_2(X51,X52),k1_zfmisc_1(u1_struct_0(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_23])])])])])]) ).
fof(c_0_30,plain,
! [X1954,X1955] : r1_tarski(k3_xboole_0(X1954,X1955),X1954),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_31,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_32,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
( ~ v1_xboole_0(X1)
| k4_xboole_0(X1,X2) = k1_xboole_0 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
k4_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( ~ v1_tsp_2(X1,esk1_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_1(X2,X1)
| v3_struct_0(X1)
| v1_tsp_2(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_40,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v1_xboole_0(X2) )
=> v1_tsp_1(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[t13_tsp_1]) ).
cnf(c_0_41,plain,
r1_tarski(k3_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
( ~ v1_xboole_0(X1)
| k3_xboole_0(X1,X2) = X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_44,negated_conjecture,
( ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ m1_subset_1(esk5_2(esk1_0,X1),k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ v1_tsp_1(X1,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]),c_0_39]) ).
cnf(c_0_45,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_1(X2,X1)
| v3_struct_0(X1)
| m1_subset_1(esk5_2(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_46,plain,
! [X214,X215] :
( v1_tsp_1(X215,X214)
| ~ m1_subset_1(X215,k1_zfmisc_1(u1_struct_0(X214)))
| ~ v1_xboole_0(X215)
| ~ l1_pre_topc(X214)
| ~ v2_pre_topc(X214)
| v3_struct_0(X214) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])]) ).
cnf(c_0_47,plain,
m1_subset_1(k3_xboole_0(X1,X2),k1_zfmisc_1(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_41]) ).
cnf(c_0_48,plain,
( ~ v1_xboole_0(X2)
| k3_xboole_0(X1,X2) = X2 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ v1_tsp_1(X1,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_37]),c_0_38])]),c_0_39]) ).
cnf(c_0_50,plain,
( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_xboole_0(X2)
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| v1_tsp_1(X2,X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,plain,
( ~ v1_xboole_0(X1)
| m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_53,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_49,c_0_50]),c_0_37]),c_0_38])]),c_0_39]),c_0_51]) ).
cnf(c_0_54,plain,
$false,
inference(sr,[status(thm)],[c_0_52,c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : TOP028+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n016.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 12:45:25 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 36.57/6.43 % Version: 3.5.1
% 36.57/6.43 % Preprocessing class: FMLLSMLLSSSNFFN.
% 36.57/6.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.57/6.43 % Starting new_bool_3 with 900s (3) cores
% 36.57/6.43 % Starting new_bool_1 with 900s (3) cores
% 36.57/6.43 % Starting sh5l with 300s (1) cores
% 36.57/6.43 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 36.57/6.43 % new_bool_3 with pid 2428757 completed with status 0
% 36.57/6.43 % Result found by new_bool_3
% 36.57/6.43 % Preprocessing class: FMLLSMLLSSSNFFN.
% 36.57/6.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.57/6.43 % Starting new_bool_3 with 900s (3) cores
% 36.57/6.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 36.57/6.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 36.57/6.43 % Search class: FGHSM-SMLM31-MFFFFFNN
% 36.57/6.43 % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 36.57/6.43 % Starting SubtermCWHack with 91s (1) cores
% 36.57/6.43 % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 541s (1) cores
% 36.57/6.43 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 36.57/6.43 % C07_19_nc_SAT001_MinMin_p005000_rr with pid 2428772 completed with status 0
% 36.57/6.43 % Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 36.57/6.43 % Preprocessing class: FMLLSMLLSSSNFFN.
% 36.57/6.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.57/6.43 % Starting new_bool_3 with 900s (3) cores
% 36.57/6.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 36.57/6.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 36.57/6.43 % Search class: FGHSM-SMLM31-MFFFFFNN
% 36.57/6.43 % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 36.57/6.43 % Starting SubtermCWHack with 91s (1) cores
% 36.57/6.43 % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 541s (1) cores
% 36.57/6.43 % Preprocessing time : 0.115 s
% 36.57/6.43 % Presaturation interreduction done
% 36.57/6.43
% 36.57/6.43 % Proof found!
% 36.57/6.43 % SZS status Theorem
% 36.57/6.43 % SZS output start CNFRefutation
% See solution above
% 36.57/6.43 % Parsed axioms : 13486
% 36.57/6.43 % Removed by relevancy pruning/SinE : 12283
% 36.57/6.43 % Initial clauses : 3081
% 36.57/6.43 % Removed in clause preprocessing : 99
% 36.57/6.43 % Initial clauses in saturation : 2982
% 36.57/6.43 % Processed clauses : 16502
% 36.57/6.43 % ...of these trivial : 210
% 36.57/6.43 % ...subsumed : 9174
% 36.57/6.43 % ...remaining for further processing : 7118
% 36.57/6.43 % Other redundant clauses eliminated : 287
% 36.57/6.43 % Clauses deleted for lack of memory : 0
% 36.57/6.43 % Backward-subsumed : 352
% 36.57/6.43 % Backward-rewritten : 125
% 36.57/6.43 % Generated clauses : 40267
% 36.57/6.43 % ...of the previous two non-redundant : 36285
% 36.57/6.43 % ...aggressively subsumed : 0
% 36.57/6.43 % Contextual simplify-reflections : 420
% 36.57/6.43 % Paramodulations : 39880
% 36.57/6.43 % Factorizations : 2
% 36.57/6.43 % NegExts : 0
% 36.57/6.43 % Equation resolutions : 298
% 36.57/6.43 % Disequality decompositions : 0
% 36.57/6.43 % Total rewrite steps : 7451
% 36.57/6.43 % ...of those cached : 6264
% 36.57/6.43 % Propositional unsat checks : 1
% 36.57/6.43 % Propositional check models : 1
% 36.57/6.43 % Propositional check unsatisfiable : 0
% 36.57/6.43 % Propositional clauses : 0
% 36.57/6.43 % Propositional clauses after purity: 0
% 36.57/6.43 % Propositional unsat core size : 0
% 36.57/6.43 % Propositional preprocessing time : 0.000
% 36.57/6.43 % Propositional encoding time : 0.028
% 36.57/6.43 % Propositional solver time : 0.023
% 36.57/6.43 % Success case prop preproc time : 0.000
% 36.57/6.43 % Success case prop encoding time : 0.000
% 36.57/6.43 % Success case prop solver time : 0.000
% 36.57/6.43 % Current number of processed clauses : 3664
% 36.57/6.43 % Positive orientable unit clauses : 607
% 36.57/6.43 % Positive unorientable unit clauses: 2
% 36.57/6.43 % Negative unit clauses : 806
% 36.57/6.43 % Non-unit-clauses : 2249
% 36.57/6.43 % Current number of unprocessed clauses: 25239
% 36.57/6.43 % ...number of literals in the above : 87186
% 36.57/6.43 % Current number of archived formulas : 0
% 36.57/6.43 % Current number of archived clauses : 3276
% 36.57/6.43 % Clause-clause subsumption calls (NU) : 6833486
% 36.57/6.43 % Rec. Clause-clause subsumption calls : 1037336
% 36.57/6.43 % Non-unit clause-clause subsumptions : 3238
% 36.57/6.43 % Unit Clause-clause subsumption calls : 292251
% 36.57/6.43 % Rewrite failures with RHS unbound : 0
% 36.57/6.43 % BW rewrite match attempts : 585
% 36.57/6.43 % BW rewrite match successes : 169
% 36.57/6.43 % Condensation attempts : 0
% 36.57/6.43 % Condensation successes : 0
% 36.57/6.43 % Termbank termtop insertions : 1079943
% 36.57/6.43 % Search garbage collected termcells : 162552
% 36.57/6.43
% 36.57/6.43 % -------------------------------------------------
% 36.57/6.43 % User time : 5.197 s
% 36.57/6.43 % System time : 0.141 s
% 36.57/6.43 % Total time : 5.338 s
% 36.57/6.43 % Maximum resident set size: 30856 pages
% 36.57/6.43
% 36.57/6.43 % -------------------------------------------------
% 36.57/6.43 % User time : 15.145 s
% 36.57/6.43 % System time : 0.445 s
% 36.57/6.43 % Total time : 15.590 s
% 36.57/6.43 % Maximum resident set size: 23040 pages
% 36.57/6.43 % E exiting
%------------------------------------------------------------------------------