%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : TOP024+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 5.69s 7.06s
% Output : CNFRefutation 5.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 53 ( 18 unt; 0 def)
% Number of atoms : 185 ( 28 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 211 ( 79 ~; 71 |; 32 &)
% ( 7 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 1 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_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_tsp_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',d5_tsp_2) ).
fof(t64_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)))
=> k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+405.ax',t64_tex_4) ).
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+9.ax',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+1.ax',reflexivity_r1_tarski) ).
fof(t48_pre_topc,axiom,
! [X1] :
( l1_pre_topc(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> r1_tarski(X2,k6_pre_topc(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',t48_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/sandbox2/benchmark/Axioms/SET007/SET007+370.ax',d2_tops_3) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( r1_tarski(X2,X1)
& r1_tarski(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',d10_xboole_0) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = k1_zfmisc_1(X1)
<=> ! [X3] :
( r2_hidden(X3,X2)
<=> r1_tarski(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+6.ax',d1_zfmisc_1) ).
fof(dt_k6_pre_topc,axiom,
! [X1,X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
& l1_pre_topc(X1) )
=> m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',dt_k6_pre_topc) ).
fof(c_0_10,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_tsp_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
inference(assume_negation,[status(cth)],[t2_tsp_2]) ).
fof(c_0_11,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_12,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_tsp_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_13,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)))
=> k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t64_tex_4]) ).
fof(c_0_14,plain,
! [X110,X111] :
( ( ~ l1_pre_topc(X110)
| ~ v2_pre_topc(X110)
| v3_struct_0(X110)
| ~ m1_subset_1(X111,k1_zfmisc_1(u1_struct_0(X110)))
| v1_tsp_2(X111,X110)
| k3_tex_4(X110,X111) != u1_struct_0(X110)
| ~ v1_tsp_1(X111,X110) )
& ( ~ l1_pre_topc(X110)
| ~ v2_pre_topc(X110)
| v3_struct_0(X110)
| ~ m1_subset_1(X111,k1_zfmisc_1(u1_struct_0(X110)))
| ~ v1_tsp_2(X111,X110)
| k3_tex_4(X110,X111) = u1_struct_0(X110) )
& ( ~ l1_pre_topc(X110)
| ~ v2_pre_topc(X110)
| v3_struct_0(X110)
| ~ m1_subset_1(X111,k1_zfmisc_1(u1_struct_0(X110)))
| ~ v1_tsp_2(X111,X110)
| v1_tsp_1(X111,X110) ) ),
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_11])])])])]) ).
fof(c_0_15,negated_conjecture,
( ~ v1_tops_1(esk2_0,esk1_0)
& v1_tsp_2(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_12])])])]) ).
fof(c_0_16,plain,
! [X1407,X1408] :
( k6_pre_topc(X1407,k3_tex_4(X1407,X1408)) = k6_pre_topc(X1407,X1408)
| ~ m1_subset_1(X1408,k1_zfmisc_1(u1_struct_0(X1407)))
| ~ l1_pre_topc(X1407)
| ~ v2_pre_topc(X1407)
| v3_struct_0(X1407) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_17,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_14]) ).
cnf(c_0_18,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
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_15]) ).
cnf(c_0_22,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X461,X462] :
( ( m1_subset_1(X461,k1_zfmisc_1(X462))
| ~ r1_tarski(X461,X462) )
& ( r1_tarski(X461,X462)
| ~ m1_subset_1(X461,k1_zfmisc_1(X462)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_24,plain,
! [X438] : r1_tarski(X438,X438),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_25,plain,
! [X372,X373] :
( r1_tarski(X373,k6_pre_topc(X372,X373))
| ~ m1_subset_1(X373,k1_zfmisc_1(u1_struct_0(X372)))
| ~ l1_pre_topc(X372) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t48_pre_topc])])])]) ).
cnf(c_0_26,plain,
( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,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_17,c_0_18]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_28,plain,
( ~ r1_tarski(X1,X2)
| m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_30,plain,
! [X42,X43] :
( ( ~ l1_pre_topc(X42)
| ~ m1_subset_1(X43,k1_zfmisc_1(u1_struct_0(X42)))
| v1_tops_1(X43,X42)
| k6_pre_topc(X42,X43) != u1_struct_0(X42) )
& ( ~ l1_pre_topc(X42)
| ~ m1_subset_1(X43,k1_zfmisc_1(u1_struct_0(X42)))
| k6_pre_topc(X42,X43) = u1_struct_0(X42)
| ~ v1_tops_1(X43,X42) ) ),
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])])])])]) ).
fof(c_0_31,plain,
! [X439,X440] :
( ( X439 = X440
| ~ r1_tarski(X440,X439)
| ~ r1_tarski(X439,X440) )
& ( X439 != X440
| r1_tarski(X440,X439) )
& ( X439 != X440
| r1_tarski(X439,X440) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_32,plain,
( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| r1_tarski(X2,k6_pre_topc(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
k6_pre_topc(esk1_0,u1_struct_0(esk1_0)) = k6_pre_topc(esk1_0,esk2_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_26,c_0_27]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_34,plain,
m1_subset_1(X1,k1_zfmisc_1(X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
~ v1_tops_1(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,plain,
( ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| k6_pre_topc(X1,X2) != u1_struct_0(X1)
| v1_tops_1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_37,plain,
! [X444,X445,X446,X447,X448,X449] :
( ( X449 = k1_zfmisc_1(X448)
| r1_tarski(esk46_2(X448,X449),X448)
| r2_hidden(esk46_2(X448,X449),X449) )
& ( X449 = k1_zfmisc_1(X448)
| ~ r1_tarski(esk46_2(X448,X449),X448)
| ~ r2_hidden(esk46_2(X448,X449),X449) )
& ( X445 != k1_zfmisc_1(X444)
| r2_hidden(X447,X445)
| ~ r1_tarski(X447,X444) )
& ( X445 != k1_zfmisc_1(X444)
| r1_tarski(X446,X444)
| ~ r2_hidden(X446,X445) ) ),
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)],[d1_zfmisc_1])])])])])])]) ).
cnf(c_0_38,plain,
( ~ r1_tarski(X2,X1)
| ~ r1_tarski(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,negated_conjecture,
r1_tarski(u1_struct_0(esk1_0),k6_pre_topc(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_20]),c_0_34])]) ).
cnf(c_0_40,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_35,c_0_36]),c_0_20]),c_0_21])]) ).
cnf(c_0_41,plain,
( X2 != k1_zfmisc_1(X3)
| ~ r2_hidden(X1,X2)
| r1_tarski(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
( X3 != k1_zfmisc_1(X2)
| ~ r1_tarski(X1,X2)
| r2_hidden(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_43,plain,
! [X387,X388] :
( m1_subset_1(k6_pre_topc(X387,X388),k1_zfmisc_1(u1_struct_0(X387)))
| ~ m1_subset_1(X388,k1_zfmisc_1(u1_struct_0(X387)))
| ~ l1_pre_topc(X387) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_pre_topc])])]) ).
cnf(c_0_44,negated_conjecture,
~ r1_tarski(k6_pre_topc(esk1_0,esk2_0),u1_struct_0(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_45,plain,
( ~ r2_hidden(X1,k1_zfmisc_1(X2))
| r1_tarski(X1,X2) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_46,plain,
( ~ r1_tarski(X1,X2)
| r2_hidden(X1,k1_zfmisc_1(X2)) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_47,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_48,plain,
( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,negated_conjecture,
~ r2_hidden(k6_pre_topc(esk1_0,esk2_0),k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| r2_hidden(X1,k1_zfmisc_1(X2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
m1_subset_1(k6_pre_topc(esk1_0,esk2_0),k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_33]),c_0_20]),c_0_34])]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : TOP024+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.40 % Computer : n005.cluster.edu
% 0.12/5.40 % Model : x86_64 x86_64
% 0.12/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.40 % Memory : 8046.5625MB
% 0.12/5.40 % OS : Linux 6.8.0-71-generic
% 0.12/5.40 % CPULimit : 300
% 0.16/5.40 % WCLimit : 300
% 0.16/5.40 % DateTime : Mon Sep 21 12:39:27 UTC 2026
% 0.16/5.40 % CPUTime :
% 0.16/5.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.45 Running first-order theorem proving
% 0.16/5.45 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 5.69/7.06 % Version: 3.5.1
% 5.69/7.06 % Preprocessing class: FMLLSMLLSSSNFFN.
% 5.69/7.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.69/7.06 % Starting new_bool_3 with 900s (3) cores
% 5.69/7.06 % Starting new_bool_1 with 900s (3) cores
% 5.69/7.06 % Starting sh5l with 300s (1) cores
% 5.69/7.06 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 5.69/7.06 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 3470441 completed with status 0
% 5.69/7.06 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 5.69/7.06 % Preprocessing class: FMLLSMLLSSSNFFN.
% 5.69/7.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.69/7.06 % Starting new_bool_3 with 900s (3) cores
% 5.69/7.06 % Starting new_bool_1 with 900s (3) cores
% 5.69/7.06 % Starting sh5l with 300s (1) cores
% 5.69/7.06 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 5.69/7.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.69/7.06 % SinE strategy is gf120_gu_R02_F100_L20000
% 5.69/7.06 % Search class: FGHSM-SMLM31-MFFFFFNN
% 5.69/7.06 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 5.69/7.06 % Starting SubtermCWHack with 28s (1) cores
% 5.69/7.06 % SubtermCWHack with pid 3470442 completed with status 0
% 5.69/7.06 % Result found by SubtermCWHack
% 5.69/7.06 % Preprocessing class: FMLLSMLLSSSNFFN.
% 5.69/7.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.69/7.06 % Starting new_bool_3 with 900s (3) cores
% 5.69/7.06 % Starting new_bool_1 with 900s (3) cores
% 5.69/7.06 % Starting sh5l with 300s (1) cores
% 5.69/7.06 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 5.69/7.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.69/7.06 % SinE strategy is gf120_gu_R02_F100_L20000
% 5.69/7.06 % Search class: FGHSM-SMLM31-MFFFFFNN
% 5.69/7.06 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 5.69/7.06 % Starting SubtermCWHack with 28s (1) cores
% 5.69/7.06 % Preprocessing time : 0.039 s
% 5.69/7.06
% 5.69/7.06 % Proof found!
% 5.69/7.06 % SZS status Theorem
% 5.69/7.06 % SZS output start CNFRefutation
% See solution above
% 5.69/7.06 % Parsed axioms : 13477
% 5.69/7.06 % Removed by relevancy pruning/SinE : 12961
% 5.69/7.06 % Initial clauses : 1239
% 5.69/7.06 % Removed in clause preprocessing : 38
% 5.69/7.06 % Initial clauses in saturation : 1201
% 5.69/7.06 % Processed clauses : 6037
% 5.69/7.06 % ...of these trivial : 39
% 5.69/7.06 % ...subsumed : 4186
% 5.69/7.06 % ...remaining for further processing : 1812
% 5.69/7.06 % Other redundant clauses eliminated : 37
% 5.69/7.06 % Clauses deleted for lack of memory : 0
% 5.69/7.06 % Backward-subsumed : 124
% 5.69/7.06 % Backward-rewritten : 53
% 5.69/7.06 % Generated clauses : 21672
% 5.69/7.06 % ...of the previous two non-redundant : 17587
% 5.69/7.06 % ...aggressively subsumed : 0
% 5.69/7.06 % Contextual simplify-reflections : 76
% 5.69/7.06 % Paramodulations : 21617
% 5.69/7.06 % Factorizations : 2
% 5.69/7.06 % NegExts : 0
% 5.69/7.06 % Equation resolutions : 45
% 5.69/7.06 % Disequality decompositions : 0
% 5.69/7.06 % Total rewrite steps : 5791
% 5.69/7.06 % ...of those cached : 5341
% 5.69/7.06 % Propositional unsat checks : 0
% 5.69/7.06 % Propositional check models : 0
% 5.69/7.06 % Propositional check unsatisfiable : 0
% 5.69/7.06 % Propositional clauses : 0
% 5.69/7.06 % Propositional clauses after purity: 0
% 5.69/7.06 % Propositional unsat core size : 0
% 5.69/7.06 % Propositional preprocessing time : 0.000
% 5.69/7.06 % Propositional encoding time : 0.000
% 5.69/7.06 % Propositional solver time : 0.000
% 5.69/7.06 % Success case prop preproc time : 0.000
% 5.69/7.06 % Success case prop encoding time : 0.000
% 5.69/7.06 % Success case prop solver time : 0.000
% 5.69/7.06 % Current number of processed clauses : 1606
% 5.69/7.06 % Positive orientable unit clauses : 208
% 5.69/7.06 % Positive unorientable unit clauses: 0
% 5.69/7.06 % Negative unit clauses : 238
% 5.69/7.06 % Non-unit-clauses : 1160
% 5.69/7.06 % Current number of unprocessed clauses: 12108
% 5.69/7.06 % ...number of literals in the above : 47320
% 5.69/7.06 % Current number of archived formulas : 0
% 5.69/7.06 % Current number of archived clauses : 185
% 5.69/7.06 % Clause-clause subsumption calls (NU) : 521085
% 5.69/7.06 % Rec. Clause-clause subsumption calls : 184245
% 5.69/7.06 % Non-unit clause-clause subsumptions : 3077
% 5.69/7.06 % Unit Clause-clause subsumption calls : 51973
% 5.69/7.06 % Rewrite failures with RHS unbound : 0
% 5.69/7.06 % BW rewrite match attempts : 151
% 5.69/7.06 % BW rewrite match successes : 24
% 5.69/7.06 % Condensation attempts : 0
% 5.69/7.06 % Condensation successes : 0
% 5.69/7.06 % Termbank termtop insertions : 660471
% 5.69/7.06 % Search garbage collected termcells : 136759
% 5.69/7.06
% 5.69/7.06 % -------------------------------------------------
% 5.69/7.06 % User time : 0.779 s
% 5.69/7.06 % System time : 0.093 s
% 5.69/7.06 % Total time : 0.872 s
% 5.69/7.06 % Maximum resident set size: 27520 pages
% 5.69/7.06
% 5.69/7.06 % -------------------------------------------------
% 5.69/7.06 % User time : 1.388 s
% 5.69/7.06 % System time : 0.117 s
% 5.69/7.06 % Total time : 1.506 s
% 5.69/7.06 % Maximum resident set size: 22784 pages
% 5.69/7.06 % E exiting
%------------------------------------------------------------------------------