TSTP Solution File: TOP025+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : TOP025+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 20:51:34 EDT 2023
% Result : Theorem 7.14s 2.45s
% Output : CNFRefutation 7.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 16 unt; 0 def)
% Number of atoms : 191 ( 27 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 223 ( 79 ~; 76 |; 36 &)
% ( 5 <=>; 27 =>; 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 : 59 ( 1 sgn; 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_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_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9tTyzo6dsL/E---3.1_3756.p',t2_tsp_2) ).
fof(t3_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)))
=> ~ ( ( v3_pre_topc(X2,X1)
| v4_pre_topc(X2,X1) )
& v1_tsp_2(X2,X1)
& v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9tTyzo6dsL/E---3.1_3756.p',t3_tsp_2) ).
fof(d5_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_2(X2,X1)
<=> ( v1_tsp_1(X2,X1)
& k3_tex_4(X1,X2) = u1_struct_0(X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9tTyzo6dsL/E---3.1_3756.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)))
=> ( ( v4_pre_topc(X2,X1)
=> k6_pre_topc(X1,X2) = X2 )
& ( ( v2_pre_topc(X1)
& k6_pre_topc(X1,X2) = X2 )
=> v4_pre_topc(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9tTyzo6dsL/E---3.1_3756.p',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/tmp/tmp.9tTyzo6dsL/E---3.1_3756.p',d2_tops_3) ).
fof(t58_tex_4,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)))
=> ( v3_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9tTyzo6dsL/E---3.1_3756.p',t58_tex_4) ).
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/tmp/tmp.9tTyzo6dsL/E---3.1_3756.p',t5_tex_2) ).
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.9tTyzo6dsL/E---3.1_3756.p',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.9tTyzo6dsL/E---3.1_3756.p',reflexivity_r1_tarski) ).
fof(c_0_9,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_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t2_tsp_2]) ).
fof(c_0_10,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)))
=> ~ ( ( v3_pre_topc(X2,X1)
| v4_pre_topc(X2,X1) )
& v1_tsp_2(X2,X1)
& v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t3_tsp_2])]) ).
fof(c_0_11,plain,
! [X125,X126] :
( v3_struct_0(X125)
| ~ v2_pre_topc(X125)
| ~ l1_pre_topc(X125)
| ~ m1_subset_1(X126,k1_zfmisc_1(u1_struct_0(X125)))
| ~ v1_tsp_2(X126,X125)
| v1_tops_1(X126,X125) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& ( v3_pre_topc(esk2_0,esk1_0)
| v4_pre_topc(esk2_0,esk1_0) )
& v1_tsp_2(esk2_0,esk1_0)
& v1_tex_2(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_13,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_2(X2,X1)
<=> ( v1_tsp_1(X2,X1)
& k3_tex_4(X1,X2) = u1_struct_0(X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[d5_tsp_2]) ).
fof(c_0_14,plain,
! [X136,X137] :
( ( ~ v4_pre_topc(X137,X136)
| k6_pre_topc(X136,X137) = X137
| ~ m1_subset_1(X137,k1_zfmisc_1(u1_struct_0(X136)))
| ~ l1_pre_topc(X136) )
& ( ~ v2_pre_topc(X136)
| k6_pre_topc(X136,X137) != X137
| v4_pre_topc(X137,X136)
| ~ m1_subset_1(X137,k1_zfmisc_1(u1_struct_0(X136)))
| ~ l1_pre_topc(X136) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t52_pre_topc])])])]) ).
fof(c_0_15,plain,
! [X736,X737] :
( ( ~ v1_tops_1(X737,X736)
| k6_pre_topc(X736,X737) = u1_struct_0(X736)
| ~ m1_subset_1(X737,k1_zfmisc_1(u1_struct_0(X736)))
| ~ l1_pre_topc(X736) )
& ( k6_pre_topc(X736,X737) != u1_struct_0(X736)
| v1_tops_1(X737,X736)
| ~ m1_subset_1(X737,k1_zfmisc_1(u1_struct_0(X736)))
| ~ l1_pre_topc(X736) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tops_3])])])]) ).
cnf(c_0_16,plain,
( v3_struct_0(X1)
| v1_tops_1(X2,X1)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_22,plain,
! [X123,X124] :
( ( v1_tsp_1(X124,X123)
| ~ v1_tsp_2(X124,X123)
| ~ m1_subset_1(X124,k1_zfmisc_1(u1_struct_0(X123)))
| v3_struct_0(X123)
| ~ v2_pre_topc(X123)
| ~ l1_pre_topc(X123) )
& ( k3_tex_4(X123,X124) = u1_struct_0(X123)
| ~ v1_tsp_2(X124,X123)
| ~ m1_subset_1(X124,k1_zfmisc_1(u1_struct_0(X123)))
| v3_struct_0(X123)
| ~ v2_pre_topc(X123)
| ~ l1_pre_topc(X123) )
& ( ~ v1_tsp_1(X124,X123)
| k3_tex_4(X123,X124) != u1_struct_0(X123)
| v1_tsp_2(X124,X123)
| ~ m1_subset_1(X124,k1_zfmisc_1(u1_struct_0(X123)))
| v3_struct_0(X123)
| ~ v2_pre_topc(X123)
| ~ l1_pre_topc(X123) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_23,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)))
=> ( v3_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
inference(fof_simplification,[status(thm)],[t58_tex_4]) ).
cnf(c_0_24,plain,
( k6_pre_topc(X2,X1) = X1
| ~ v4_pre_topc(X1,X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ l1_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,negated_conjecture,
( v3_pre_topc(esk2_0,esk1_0)
| v4_pre_topc(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,plain,
( k6_pre_topc(X2,X1) = u1_struct_0(X2)
| ~ v1_tops_1(X1,X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ l1_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,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_16,c_0_17]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
fof(c_0_28,plain,
! [X57,X58] :
( ( ~ v1_tex_2(X58,k1_zfmisc_1(X57))
| X58 != X57
| ~ m1_subset_1(X58,k1_zfmisc_1(X57)) )
& ( X58 = X57
| v1_tex_2(X58,k1_zfmisc_1(X57))
| ~ m1_subset_1(X58,k1_zfmisc_1(X57)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_tex_2])])]) ).
fof(c_0_29,plain,
! [X1199,X1200] :
( ( ~ m1_subset_1(X1199,k1_zfmisc_1(X1200))
| r1_tarski(X1199,X1200) )
& ( ~ r1_tarski(X1199,X1200)
| m1_subset_1(X1199,k1_zfmisc_1(X1200)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_30,plain,
! [X1176] : r1_tarski(X1176,X1176),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_31,plain,
( k3_tex_4(X1,X2) = u1_struct_0(X1)
| v3_struct_0(X1)
| ~ v1_tsp_2(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_22]) ).
fof(c_0_32,plain,
! [X1428,X1429] :
( v3_struct_0(X1428)
| ~ v2_pre_topc(X1428)
| ~ l1_pre_topc(X1428)
| ~ m1_subset_1(X1429,k1_zfmisc_1(u1_struct_0(X1428)))
| ~ v3_pre_topc(X1429,X1428)
| k3_tex_4(X1428,X1429) = X1429 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_33,negated_conjecture,
( k6_pre_topc(esk1_0,esk2_0) = esk2_0
| v3_pre_topc(esk2_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19]),c_0_20])]) ).
cnf(c_0_34,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_26,c_0_27]),c_0_19]),c_0_20])]) ).
cnf(c_0_35,plain,
( ~ v1_tex_2(X1,k1_zfmisc_1(X2))
| X1 != X2
| ~ m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,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_31,c_0_17]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_39,plain,
( v3_struct_0(X1)
| k3_tex_4(X1,X2) = X2
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v3_pre_topc(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
( esk2_0 = u1_struct_0(esk1_0)
| v3_pre_topc(esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( ~ v1_tex_2(X1,k1_zfmisc_1(X1))
| ~ m1_subset_1(X1,k1_zfmisc_1(X1)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
m1_subset_1(X1,k1_zfmisc_1(X1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
v1_tex_2(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_44,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_38,c_0_39]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]),c_0_40]) ).
cnf(c_0_45,plain,
~ v1_tex_2(X1,k1_zfmisc_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : TOP025+3 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n029.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 2400
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Mon Oct 2 19:32:38 EDT 2023
% 0.09/0.28 % CPUTime :
% 0.90/1.17 Running first-order model finding
% 0.90/1.17 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/tmp/tmp.9tTyzo6dsL/E---3.1_3756.p
% 7.14/2.45 # Version: 3.1pre001
% 7.14/2.45 # Preprocessing class: FMLLSMLLSSSNFFN.
% 7.14/2.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.14/2.45 # Starting new_bool_3 with 900s (3) cores
% 7.14/2.45 # Starting new_bool_1 with 900s (3) cores
% 7.14/2.45 # Starting sh5l with 300s (1) cores
% 7.14/2.45 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 7.14/2.45 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 3836 completed with status 0
% 7.14/2.45 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 7.14/2.45 # Preprocessing class: FMLLSMLLSSSNFFN.
% 7.14/2.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.14/2.45 # Starting new_bool_3 with 900s (3) cores
% 7.14/2.45 # Starting new_bool_1 with 900s (3) cores
% 7.14/2.45 # Starting sh5l with 300s (1) cores
% 7.14/2.45 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 7.14/2.45 # SinE strategy is gf120_gu_R02_F100_L20000
% 7.14/2.45 # Search class: FGHSM-SMLM31-MFFFFFNN
% 7.14/2.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 7.14/2.45 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 163s (1) cores
% 7.14/2.45 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 3837 completed with status 0
% 7.14/2.45 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 7.14/2.45 # Preprocessing class: FMLLSMLLSSSNFFN.
% 7.14/2.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.14/2.45 # Starting new_bool_3 with 900s (3) cores
% 7.14/2.45 # Starting new_bool_1 with 900s (3) cores
% 7.14/2.45 # Starting sh5l with 300s (1) cores
% 7.14/2.45 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 7.14/2.45 # SinE strategy is gf120_gu_R02_F100_L20000
% 7.14/2.45 # Search class: FGHSM-SMLM31-MFFFFFNN
% 7.14/2.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 7.14/2.45 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 163s (1) cores
% 7.14/2.45 # Preprocessing time : 0.040 s
% 7.14/2.45 # Presaturation interreduction done
% 7.14/2.45
% 7.14/2.45 # Proof found!
% 7.14/2.45 # SZS status Theorem
% 7.14/2.45 # SZS output start CNFRefutation
% See solution above
% 7.14/2.45 # Parsed axioms : 13478
% 7.14/2.45 # Removed by relevancy pruning/SinE : 12907
% 7.14/2.45 # Initial clauses : 1463
% 7.14/2.45 # Removed in clause preprocessing : 43
% 7.14/2.45 # Initial clauses in saturation : 1420
% 7.14/2.45 # Processed clauses : 6838
% 7.14/2.45 # ...of these trivial : 29
% 7.14/2.45 # ...subsumed : 3087
% 7.14/2.45 # ...remaining for further processing : 3722
% 7.14/2.45 # Other redundant clauses eliminated : 96
% 7.14/2.45 # Clauses deleted for lack of memory : 0
% 7.14/2.45 # Backward-subsumed : 133
% 7.14/2.45 # Backward-rewritten : 226
% 7.14/2.45 # Generated clauses : 13755
% 7.14/2.45 # ...of the previous two non-redundant : 12529
% 7.14/2.45 # ...aggressively subsumed : 0
% 7.14/2.45 # Contextual simplify-reflections : 231
% 7.14/2.45 # Paramodulations : 13654
% 7.14/2.45 # Factorizations : 0
% 7.14/2.45 # NegExts : 0
% 7.14/2.45 # Equation resolutions : 100
% 7.14/2.45 # Total rewrite steps : 2690
% 7.14/2.45 # Propositional unsat checks : 0
% 7.14/2.45 # Propositional check models : 0
% 7.14/2.45 # Propositional check unsatisfiable : 0
% 7.14/2.45 # Propositional clauses : 0
% 7.14/2.45 # Propositional clauses after purity: 0
% 7.14/2.45 # Propositional unsat core size : 0
% 7.14/2.45 # Propositional preprocessing time : 0.000
% 7.14/2.45 # Propositional encoding time : 0.000
% 7.14/2.45 # Propositional solver time : 0.000
% 7.14/2.45 # Success case prop preproc time : 0.000
% 7.14/2.45 # Success case prop encoding time : 0.000
% 7.14/2.45 # Success case prop solver time : 0.000
% 7.14/2.45 # Current number of processed clauses : 1957
% 7.14/2.45 # Positive orientable unit clauses : 165
% 7.14/2.45 # Positive unorientable unit clauses: 0
% 7.14/2.45 # Negative unit clauses : 139
% 7.14/2.45 # Non-unit-clauses : 1653
% 7.14/2.45 # Current number of unprocessed clauses: 8174
% 7.14/2.45 # ...number of literals in the above : 31706
% 7.14/2.45 # Current number of archived formulas : 0
% 7.14/2.45 # Current number of archived clauses : 1679
% 7.14/2.45 # Clause-clause subsumption calls (NU) : 1397396
% 7.14/2.45 # Rec. Clause-clause subsumption calls : 264656
% 7.14/2.45 # Non-unit clause-clause subsumptions : 1715
% 7.14/2.45 # Unit Clause-clause subsumption calls : 20157
% 7.14/2.45 # Rewrite failures with RHS unbound : 0
% 7.14/2.45 # BW rewrite match attempts : 55
% 7.14/2.45 # BW rewrite match successes : 18
% 7.14/2.45 # Condensation attempts : 0
% 7.14/2.45 # Condensation successes : 0
% 7.14/2.45 # Termbank termtop insertions : 605341
% 7.14/2.45
% 7.14/2.45 # -------------------------------------------------
% 7.14/2.45 # User time : 0.821 s
% 7.14/2.45 # System time : 0.049 s
% 7.14/2.45 # Total time : 0.870 s
% 7.14/2.45 # Maximum resident set size: 26024 pages
% 7.14/2.45
% 7.14/2.45 # -------------------------------------------------
% 7.14/2.45 # User time : 1.181 s
% 7.14/2.45 # System time : 0.066 s
% 7.14/2.45 # Total time : 1.247 s
% 7.14/2.45 # Maximum resident set size: 19800 pages
% 7.14/2.45 % E---3.1 exiting
%------------------------------------------------------------------------------