%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : TOP025+2 : 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 : n026.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:51 PM UTC 2026
% Result : Theorem 22.32s 4.64s
% Output : CNFRefutation 22.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 16 unt; 0 def)
% Number of atoms : 202 ( 28 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 236 ( 83 ~; 77 |; 40 &)
% ( 6 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 63 ( 1 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t3_tsp_2,conjecture,
! [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_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v1_tsp_2(X2,X1)
& ( v4_pre_topc(X2,X1)
| v3_pre_topc(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_tsp_2) ).
fof(t2_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)))
=> ( v1_tsp_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tsp_2) ).
fof(d5_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)))
=> ( v1_tsp_2(X2,X1)
<=> ( k3_tex_4(X1,X2) = u1_struct_0(X1)
& v1_tsp_1(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tsp_2) ).
fof(t52_pre_topc,axiom,
! [X1] :
( l1_pre_topc(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( ( ( k6_pre_topc(X1,X2) = X2
& v2_pre_topc(X1) )
=> v4_pre_topc(X2,X1) )
& ( v4_pre_topc(X2,X1)
=> k6_pre_topc(X1,X2) = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+206.ax',t52_pre_topc) ).
fof(d2_tops_3,axiom,
! [X1] :
( l1_pre_topc(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tops_1(X2,X1)
<=> k6_pre_topc(X1,X2) = u1_struct_0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+370.ax',d2_tops_3) ).
fof(t5_tex_2,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> ( v1_tex_2(X2,k1_zfmisc_1(X1))
<=> X2 != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+387.ax',t5_tex_2) ).
fof(t58_tex_4,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)))
=> ( v3_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+405.ax',t58_tex_4) ).
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(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+1.ax',reflexivity_r1_tarski) ).
fof(c_0_9,negated_conjecture,
~ ! [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_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v1_tsp_2(X2,X1)
& ( v4_pre_topc(X2,X1)
| v3_pre_topc(X2,X1) ) ) ) ),
inference(assume_negation,[status(cth)],[t3_tsp_2]) ).
fof(c_0_10,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_tsp_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t2_tsp_2]) ).
fof(c_0_11,negated_conjecture,
~ ! [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_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v1_tsp_2(X2,X1)
& ( v4_pre_topc(X2,X1)
| v3_pre_topc(X2,X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X75,X76] :
( v1_tops_1(X76,X75)
| ~ v1_tsp_2(X76,X75)
| ~ m1_subset_1(X76,k1_zfmisc_1(u1_struct_0(X75)))
| ~ l1_pre_topc(X75)
| ~ v2_pre_topc(X75)
| v3_struct_0(X75) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_13,negated_conjecture,
( v1_tex_2(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& v1_tsp_2(esk2_0,esk1_0)
& ( v4_pre_topc(esk2_0,esk1_0)
| v3_pre_topc(esk2_0,esk1_0) )
& m1_subset_1(esk2_0,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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_14,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_tsp_2(X2,X1)
<=> ( k3_tex_4(X1,X2) = u1_struct_0(X1)
& v1_tsp_1(X2,X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[d5_tsp_2]) ).
fof(c_0_15,plain,
! [X86,X87] :
( ( ~ l1_pre_topc(X86)
| ~ m1_subset_1(X87,k1_zfmisc_1(u1_struct_0(X86)))
| v4_pre_topc(X87,X86)
| k6_pre_topc(X86,X87) != X87
| ~ v2_pre_topc(X86) )
& ( ~ l1_pre_topc(X86)
| ~ m1_subset_1(X87,k1_zfmisc_1(u1_struct_0(X86)))
| k6_pre_topc(X86,X87) = X87
| ~ v4_pre_topc(X87,X86) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t52_pre_topc])])])])]) ).
fof(c_0_16,plain,
! [X525,X526] :
( ( ~ l1_pre_topc(X525)
| ~ m1_subset_1(X526,k1_zfmisc_1(u1_struct_0(X525)))
| v1_tops_1(X526,X525)
| k6_pre_topc(X525,X526) != u1_struct_0(X525) )
& ( ~ l1_pre_topc(X525)
| ~ m1_subset_1(X526,k1_zfmisc_1(u1_struct_0(X525)))
| k6_pre_topc(X525,X526) = u1_struct_0(X525)
| ~ v1_tops_1(X526,X525) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tops_3])])])])]) ).
cnf(c_0_17,plain,
( ~ v1_tsp_2(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| v1_tops_1(X2,X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_23,plain,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> ( v1_tex_2(X2,k1_zfmisc_1(X1))
<=> X2 != X1 ) ),
inference(fof_simplification,[status(thm)],[t5_tex_2]) ).
fof(c_0_24,plain,
! [X73,X74] :
( ( ~ l1_pre_topc(X73)
| ~ v2_pre_topc(X73)
| v3_struct_0(X73)
| ~ m1_subset_1(X74,k1_zfmisc_1(u1_struct_0(X73)))
| v1_tsp_2(X74,X73)
| k3_tex_4(X73,X74) != u1_struct_0(X73)
| ~ v1_tsp_1(X74,X73) )
& ( ~ l1_pre_topc(X73)
| ~ v2_pre_topc(X73)
| v3_struct_0(X73)
| ~ m1_subset_1(X74,k1_zfmisc_1(u1_struct_0(X73)))
| ~ v1_tsp_2(X74,X73)
| k3_tex_4(X73,X74) = u1_struct_0(X73) )
& ( ~ l1_pre_topc(X73)
| ~ v2_pre_topc(X73)
| v3_struct_0(X73)
| ~ m1_subset_1(X74,k1_zfmisc_1(u1_struct_0(X73)))
| ~ v1_tsp_2(X74,X73)
| v1_tsp_1(X74,X73) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
fof(c_0_25,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)))
=> ( v3_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
inference(fof_simplification,[status(thm)],[t58_tex_4]) ).
cnf(c_0_26,plain,
( ~ l1_pre_topc(X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ v4_pre_topc(X1,X2)
| k6_pre_topc(X2,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,negated_conjecture,
( v4_pre_topc(esk2_0,esk1_0)
| v3_pre_topc(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,plain,
( ~ l1_pre_topc(X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ v1_tops_1(X1,X2)
| k6_pre_topc(X2,X1) = u1_struct_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,negated_conjecture,
v1_tops_1(esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
fof(c_0_30,plain,
! [X26,X27] :
( ( ~ m1_subset_1(X27,k1_zfmisc_1(X26))
| v1_tex_2(X27,k1_zfmisc_1(X26))
| X27 = X26 )
& ( ~ m1_subset_1(X27,k1_zfmisc_1(X26))
| X27 != X26
| ~ v1_tex_2(X27,k1_zfmisc_1(X26)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
fof(c_0_31,plain,
! [X1211,X1212] :
( ( m1_subset_1(X1211,k1_zfmisc_1(X1212))
| ~ r1_tarski(X1211,X1212) )
& ( r1_tarski(X1211,X1212)
| ~ m1_subset_1(X1211,k1_zfmisc_1(X1212)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_32,plain,
! [X1188] : r1_tarski(X1188,X1188),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_33,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_2(X2,X1)
| v3_struct_0(X1)
| k3_tex_4(X1,X2) = u1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_34,plain,
! [X1159,X1160] :
( k3_tex_4(X1159,X1160) = X1160
| ~ v3_pre_topc(X1160,X1159)
| ~ m1_subset_1(X1160,k1_zfmisc_1(u1_struct_0(X1159)))
| ~ l1_pre_topc(X1159)
| ~ v2_pre_topc(X1159)
| v3_struct_0(X1159) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
cnf(c_0_35,negated_conjecture,
( v3_pre_topc(esk2_0,esk1_0)
| k6_pre_topc(esk1_0,esk2_0) = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20]),c_0_21])]) ).
cnf(c_0_36,negated_conjecture,
k6_pre_topc(esk1_0,esk2_0) = u1_struct_0(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20]),c_0_21])]) ).
cnf(c_0_37,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| X1 != X2
| ~ v1_tex_2(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( ~ r1_tarski(X1,X2)
| m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
k3_tex_4(esk1_0,esk2_0) = u1_struct_0(esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_18]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_41,plain,
( ~ v3_pre_topc(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| k3_tex_4(X1,X2) = X2
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( v3_pre_topc(esk2_0,esk1_0)
| esk2_0 = u1_struct_0(esk1_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X1))
| ~ v1_tex_2(X1,k1_zfmisc_1(X1)) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
m1_subset_1(X1,k1_zfmisc_1(X1)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
v1_tex_2(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_46,negated_conjecture,
esk2_0 = u1_struct_0(esk1_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]),c_0_42]) ).
cnf(c_0_47,plain,
~ v1_tex_2(X1,k1_zfmisc_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : TOP025+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n026.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 12:43:07 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.52 Running first-order theorem proving
% 0.19/0.52 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
% 22.32/4.64 % Version: 3.5.1
% 22.32/4.64 % Preprocessing class: FMLMSMSLSSSNFFN.
% 22.32/4.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.32/4.64 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 22.32/4.64 % Starting new_bool_3 with 600s (2) cores
% 22.32/4.64 % Starting new_bool_1 with 600s (2) cores
% 22.32/4.64 % Starting sh5l with 300s (1) cores
% 22.32/4.64 % new_bool_1 with pid 2279326 completed with status 0
% 22.32/4.64 % Result found by new_bool_1
% 22.32/4.64 % Preprocessing class: FMLMSMSLSSSNFFN.
% 22.32/4.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.32/4.64 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 22.32/4.64 % Starting new_bool_3 with 600s (2) cores
% 22.32/4.64 % Starting new_bool_1 with 600s (2) cores
% 22.32/4.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 22.32/4.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 22.32/4.64 % Search class: FGHSM-SMLM31-MFFFFFNN
% 22.32/4.64 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 22.32/4.64 % Starting SubtermCWHack with 61s (1) cores
% 22.32/4.64 % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 361s (1) cores
% 22.32/4.64 % C07_19_nc_SAT001_MinMin_p005000_rr with pid 2279329 completed with status 0
% 22.32/4.64 % Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 22.32/4.64 % Preprocessing class: FMLMSMSLSSSNFFN.
% 22.32/4.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.32/4.64 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 22.32/4.64 % Starting new_bool_3 with 600s (2) cores
% 22.32/4.64 % Starting new_bool_1 with 600s (2) cores
% 22.32/4.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 22.32/4.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 22.32/4.64 % Search class: FGHSM-SMLM31-MFFFFFNN
% 22.32/4.64 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 22.32/4.64 % Starting SubtermCWHack with 61s (1) cores
% 22.32/4.64 % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 361s (1) cores
% 22.32/4.64 % Preprocessing time : 0.083 s
% 22.32/4.64 % Presaturation interreduction done
% 22.32/4.64
% 22.32/4.64 % Proof found!
% 22.32/4.64 % SZS status Theorem
% 22.32/4.64 % SZS output start CNFRefutation
% See solution above
% 22.32/4.64 % Parsed axioms : 3584
% 22.32/4.64 % Removed by relevancy pruning/SinE : 2456
% 22.32/4.64 % Initial clauses : 2639
% 22.32/4.64 % Removed in clause preprocessing : 100
% 22.32/4.64 % Initial clauses in saturation : 2539
% 22.32/4.64 % Processed clauses : 12481
% 22.32/4.64 % ...of these trivial : 50
% 22.32/4.64 % ...subsumed : 6972
% 22.32/4.64 % ...remaining for further processing : 5459
% 22.32/4.64 % Other redundant clauses eliminated : 277
% 22.32/4.64 % Clauses deleted for lack of memory : 0
% 22.32/4.64 % Backward-subsumed : 247
% 22.32/4.64 % Backward-rewritten : 254
% 22.32/4.64 % Generated clauses : 29640
% 22.32/4.64 % ...of the previous two non-redundant : 25782
% 22.32/4.64 % ...aggressively subsumed : 0
% 22.32/4.64 % Contextual simplify-reflections : 320
% 22.32/4.64 % Paramodulations : 29358
% 22.32/4.64 % Factorizations : 1
% 22.32/4.64 % NegExts : 0
% 22.32/4.64 % Equation resolutions : 284
% 22.32/4.64 % Disequality decompositions : 0
% 22.32/4.64 % Total rewrite steps : 7239
% 22.32/4.64 % ...of those cached : 5892
% 22.32/4.64 % Propositional unsat checks : 1
% 22.32/4.64 % Propositional check models : 1
% 22.32/4.64 % Propositional check unsatisfiable : 0
% 22.32/4.64 % Propositional clauses : 0
% 22.32/4.64 % Propositional clauses after purity: 0
% 22.32/4.64 % Propositional unsat core size : 0
% 22.32/4.64 % Propositional preprocessing time : 0.000
% 22.32/4.64 % Propositional encoding time : 0.052
% 22.32/4.64 % Propositional solver time : 0.062
% 22.32/4.64 % Success case prop preproc time : 0.000
% 22.32/4.64 % Success case prop encoding time : 0.000
% 22.32/4.64 % Success case prop solver time : 0.000
% 22.32/4.64 % Current number of processed clauses : 2473
% 22.32/4.64 % Positive orientable unit clauses : 286
% 22.32/4.64 % Positive unorientable unit clauses: 5
% 22.32/4.64 % Negative unit clauses : 632
% 22.32/4.64 % Non-unit-clauses : 1550
% 22.32/4.64 % Current number of unprocessed clauses: 17722
% 22.32/4.64 % ...number of literals in the above : 49596
% 22.32/4.64 % Current number of archived formulas : 0
% 22.32/4.64 % Current number of archived clauses : 2798
% 22.32/4.64 % Clause-clause subsumption calls (NU) : 4023113
% 22.32/4.64 % Rec. Clause-clause subsumption calls : 571123
% 22.32/4.64 % Non-unit clause-clause subsumptions : 2790
% 22.32/4.64 % Unit Clause-clause subsumption calls : 84251
% 22.32/4.64 % Rewrite failures with RHS unbound : 0
% 22.32/4.64 % BW rewrite match attempts : 432
% 22.32/4.64 % BW rewrite match successes : 309
% 22.32/4.64 % Condensation attempts : 0
% 22.32/4.64 % Condensation successes : 0
% 22.32/4.64 % Termbank termtop insertions : 687447
% 22.32/4.64 % Search garbage collected termcells : 68909
% 22.32/4.64
% 22.32/4.64 % -------------------------------------------------
% 22.32/4.64 % User time : 3.541 s
% 22.32/4.64 % System time : 0.099 s
% 22.32/4.64 % Total time : 3.640 s
% 22.32/4.64 % Maximum resident set size: 15296 pages
% 22.32/4.64
% 22.32/4.64 % -------------------------------------------------
% 22.32/4.64 % User time : 6.519 s
% 22.32/4.64 % System time : 0.200 s
% 22.32/4.64 % Total time : 6.719 s
% 22.32/4.64 % Maximum resident set size: 8960 pages
% 22.32/4.64 % E exiting
%------------------------------------------------------------------------------