TSTP Solution File: TOP024+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : TOP024+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:09 EDT 2023
% Result : Theorem 12.94s 2.93s
% Output : CNFRefutation 12.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 57 ( 23 unt; 0 def)
% Number of atoms : 202 ( 28 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 230 ( 85 ~; 76 |; 35 &)
% ( 11 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 81 ( 2 sgn; 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',d5_tsp_2) ).
fof(t2_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)
=> v1_tops_1(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',t2_tsp_2) ).
fof(t64_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)))
=> k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',t64_tex_4) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) )
& ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',d2_subset_1) ).
fof(dt_k6_pre_topc,axiom,
! [X1,X2] :
( ( l1_pre_topc(X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',dt_k6_pre_topc) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
file('/export/starexec/sandbox2/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',fc1_subset_1) ).
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/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',d1_zfmisc_1) ).
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/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',d2_tops_3) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( r1_tarski(X1,X2)
& r1_tarski(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',d10_xboole_0) ).
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',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/tmp/tmp.MxtTygFSDA/E---3.1_24742.p',t48_pre_topc) ).
fof(c_0_12,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_13,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)
=> v1_tops_1(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t2_tsp_2])]) ).
fof(c_0_14,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)))
=> 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_15,plain,
! [X133,X134] :
( ( v1_tsp_1(X134,X133)
| ~ v1_tsp_2(X134,X133)
| ~ m1_subset_1(X134,k1_zfmisc_1(u1_struct_0(X133)))
| v3_struct_0(X133)
| ~ v2_pre_topc(X133)
| ~ l1_pre_topc(X133) )
& ( k3_tex_4(X133,X134) = u1_struct_0(X133)
| ~ v1_tsp_2(X134,X133)
| ~ m1_subset_1(X134,k1_zfmisc_1(u1_struct_0(X133)))
| v3_struct_0(X133)
| ~ v2_pre_topc(X133)
| ~ l1_pre_topc(X133) )
& ( ~ v1_tsp_1(X134,X133)
| k3_tex_4(X133,X134) != u1_struct_0(X133)
| v1_tsp_2(X134,X133)
| ~ m1_subset_1(X134,k1_zfmisc_1(u1_struct_0(X133)))
| v3_struct_0(X133)
| ~ v2_pre_topc(X133)
| ~ l1_pre_topc(X133) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_16,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)))
& v1_tsp_2(esk2_0,esk1_0)
& ~ v1_tops_1(esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_17,plain,
! [X1445,X1446] :
( v3_struct_0(X1445)
| ~ v2_pre_topc(X1445)
| ~ l1_pre_topc(X1445)
| ~ m1_subset_1(X1446,k1_zfmisc_1(u1_struct_0(X1445)))
| k6_pre_topc(X1445,k3_tex_4(X1445,X1446)) = k6_pre_topc(X1445,X1446) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_18,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_15]) ).
cnf(c_0_19,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,plain,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) )
& ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_25,plain,
! [X402,X403] :
( ~ l1_pre_topc(X402)
| ~ m1_subset_1(X403,k1_zfmisc_1(u1_struct_0(X402)))
| m1_subset_1(k6_pre_topc(X402,X403),k1_zfmisc_1(u1_struct_0(X402))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_pre_topc])]) ).
cnf(c_0_26,plain,
( v3_struct_0(X1)
| k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
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_18,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
fof(c_0_28,plain,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
fof(c_0_29,plain,
! [X457,X458,X459,X460,X461,X462] :
( ( ~ r2_hidden(X459,X458)
| r1_tarski(X459,X457)
| X458 != k1_zfmisc_1(X457) )
& ( ~ r1_tarski(X460,X457)
| r2_hidden(X460,X458)
| X458 != k1_zfmisc_1(X457) )
& ( ~ r2_hidden(esk47_2(X461,X462),X462)
| ~ r1_tarski(esk47_2(X461,X462),X461)
| X462 = k1_zfmisc_1(X461) )
& ( r2_hidden(esk47_2(X461,X462),X462)
| r1_tarski(esk47_2(X461,X462),X461)
| X462 = k1_zfmisc_1(X461) ) ),
inference(distribute,[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])])])])])]) ).
fof(c_0_30,plain,
! [X1252,X1253] :
( ( ~ m1_subset_1(X1253,X1252)
| r2_hidden(X1253,X1252)
| v1_xboole_0(X1252) )
& ( ~ r2_hidden(X1253,X1252)
| m1_subset_1(X1253,X1252)
| v1_xboole_0(X1252) )
& ( ~ m1_subset_1(X1253,X1252)
| v1_xboole_0(X1253)
| ~ v1_xboole_0(X1252) )
& ( ~ v1_xboole_0(X1253)
| m1_subset_1(X1253,X1252)
| ~ v1_xboole_0(X1252) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_31,plain,
( m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
k6_pre_topc(esk1_0,esk2_0) = k6_pre_topc(esk1_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_26,c_0_27]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
fof(c_0_33,plain,
! [X1247] : ~ v1_xboole_0(k1_zfmisc_1(X1247)),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_34,plain,
! [X34,X35] :
( ( ~ v1_tops_1(X35,X34)
| k6_pre_topc(X34,X35) = u1_struct_0(X34)
| ~ m1_subset_1(X35,k1_zfmisc_1(u1_struct_0(X34)))
| ~ l1_pre_topc(X34) )
& ( k6_pre_topc(X34,X35) != u1_struct_0(X34)
| v1_tops_1(X35,X34)
| ~ m1_subset_1(X35,k1_zfmisc_1(u1_struct_0(X34)))
| ~ l1_pre_topc(X34) ) ),
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_35,plain,
( r1_tarski(X1,X3)
| ~ r2_hidden(X1,X2)
| X2 != k1_zfmisc_1(X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( r2_hidden(X1,X2)
| v1_xboole_0(X2)
| ~ m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
m1_subset_1(k6_pre_topc(esk1_0,u1_struct_0(esk1_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_31,c_0_32]),c_0_21]),c_0_22])]) ).
cnf(c_0_38,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
~ v1_tops_1(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_40,plain,
( v1_tops_1(X2,X1)
| k6_pre_topc(X1,X2) != u1_struct_0(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_41,plain,
! [X452,X453] :
( ( r1_tarski(X452,X453)
| X452 != X453 )
& ( r1_tarski(X453,X452)
| X452 != X453 )
& ( ~ r1_tarski(X452,X453)
| ~ r1_tarski(X453,X452)
| X452 = X453 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
cnf(c_0_42,plain,
( r1_tarski(X1,X2)
| ~ r2_hidden(X1,k1_zfmisc_1(X2)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_43,negated_conjecture,
r2_hidden(k6_pre_topc(esk1_0,u1_struct_0(esk1_0)),k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_44,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_39,c_0_40]),c_0_21]),c_0_22])]) ).
fof(c_0_45,plain,
! [X474,X475] :
( ( ~ m1_subset_1(X474,k1_zfmisc_1(X475))
| r1_tarski(X474,X475) )
& ( ~ r1_tarski(X474,X475)
| m1_subset_1(X474,k1_zfmisc_1(X475)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_46,plain,
! [X451] : r1_tarski(X451,X451),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_47,plain,
( X1 = X2
| ~ r1_tarski(X1,X2)
| ~ r1_tarski(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
r1_tarski(k6_pre_topc(esk1_0,u1_struct_0(esk1_0)),u1_struct_0(esk1_0)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
k6_pre_topc(esk1_0,u1_struct_0(esk1_0)) != u1_struct_0(esk1_0),
inference(rw,[status(thm)],[c_0_44,c_0_32]) ).
fof(c_0_50,plain,
! [X387,X388] :
( ~ l1_pre_topc(X387)
| ~ m1_subset_1(X388,k1_zfmisc_1(u1_struct_0(X387)))
| r1_tarski(X388,k6_pre_topc(X387,X388)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t48_pre_topc])])]) ).
cnf(c_0_51,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
~ r1_tarski(u1_struct_0(esk1_0),k6_pre_topc(esk1_0,u1_struct_0(esk1_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_54,plain,
( r1_tarski(X2,k6_pre_topc(X1,X2))
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_55,plain,
m1_subset_1(X1,k1_zfmisc_1(X1)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_21]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.36 % Problem : TOP024+2 : TPTP v8.1.2. Released v3.4.0.
% 0.12/0.37 % Command : run_E %s %d THM
% 0.38/0.58 % Computer : n002.cluster.edu
% 0.38/0.58 % Model : x86_64 x86_64
% 0.38/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.38/0.58 % Memory : 8042.1875MB
% 0.38/0.58 % OS : Linux 3.10.0-693.el7.x86_64
% 0.38/0.58 % CPULimit : 2400
% 0.38/0.58 % WCLimit : 300
% 0.38/0.58 % DateTime : Mon Oct 2 19:19:45 EDT 2023
% 0.38/0.59 % CPUTime :
% 0.56/1.08 Running first-order theorem proving
% 0.56/1.08 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/tmp/tmp.MxtTygFSDA/E---3.1_24742.p
% 12.94/2.93 # Version: 3.1pre001
% 12.94/2.93 # Preprocessing class: FMLMSMSLSSSNFFN.
% 12.94/2.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.94/2.93 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 12.94/2.93 # Starting new_bool_3 with 600s (2) cores
% 12.94/2.93 # Starting new_bool_1 with 600s (2) cores
% 12.94/2.93 # Starting sh5l with 300s (1) cores
% 12.94/2.93 # new_bool_1 with pid 24822 completed with status 0
% 12.94/2.93 # Result found by new_bool_1
% 12.94/2.93 # Preprocessing class: FMLMSMSLSSSNFFN.
% 12.94/2.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.94/2.93 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 12.94/2.93 # Starting new_bool_3 with 600s (2) cores
% 12.94/2.93 # Starting new_bool_1 with 600s (2) cores
% 12.94/2.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.94/2.93 # Search class: FGHSM-SMLM31-MFFFFFNN
% 12.94/2.93 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 12.94/2.93 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 361s (1) cores
% 12.94/2.93 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 61s (1) cores
% 12.94/2.93 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 24824 completed with status 0
% 12.94/2.93 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 12.94/2.93 # Preprocessing class: FMLMSMSLSSSNFFN.
% 12.94/2.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.94/2.93 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 12.94/2.93 # Starting new_bool_3 with 600s (2) cores
% 12.94/2.93 # Starting new_bool_1 with 600s (2) cores
% 12.94/2.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.94/2.93 # Search class: FGHSM-SMLM31-MFFFFFNN
% 12.94/2.93 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 12.94/2.93 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 361s (1) cores
% 12.94/2.93 # Preprocessing time : 0.046 s
% 12.94/2.93 # Presaturation interreduction done
% 12.94/2.93
% 12.94/2.93 # Proof found!
% 12.94/2.93 # SZS status Theorem
% 12.94/2.93 # SZS output start CNFRefutation
% See solution above
% 12.94/2.93 # Parsed axioms : 3583
% 12.94/2.93 # Removed by relevancy pruning/SinE : 2545
% 12.94/2.93 # Initial clauses : 2493
% 12.94/2.93 # Removed in clause preprocessing : 100
% 12.94/2.93 # Initial clauses in saturation : 2393
% 12.94/2.93 # Processed clauses : 15359
% 12.94/2.93 # ...of these trivial : 50
% 12.94/2.93 # ...subsumed : 9552
% 12.94/2.93 # ...remaining for further processing : 5757
% 12.94/2.93 # Other redundant clauses eliminated : 281
% 12.94/2.93 # Clauses deleted for lack of memory : 0
% 12.94/2.93 # Backward-subsumed : 189
% 12.94/2.93 # Backward-rewritten : 66
% 12.94/2.93 # Generated clauses : 43187
% 12.94/2.93 # ...of the previous two non-redundant : 38793
% 12.94/2.93 # ...aggressively subsumed : 0
% 12.94/2.93 # Contextual simplify-reflections : 339
% 12.94/2.93 # Paramodulations : 42896
% 12.94/2.93 # Factorizations : 3
% 12.94/2.93 # NegExts : 0
% 12.94/2.93 # Equation resolutions : 291
% 12.94/2.93 # Total rewrite steps : 7119
% 12.94/2.93 # Propositional unsat checks : 1
% 12.94/2.93 # Propositional check models : 1
% 12.94/2.93 # Propositional check unsatisfiable : 0
% 12.94/2.93 # Propositional clauses : 0
% 12.94/2.93 # Propositional clauses after purity: 0
% 12.94/2.93 # Propositional unsat core size : 0
% 12.94/2.93 # Propositional preprocessing time : 0.000
% 12.94/2.93 # Propositional encoding time : 0.022
% 12.94/2.93 # Propositional solver time : 0.017
% 12.94/2.93 # Success case prop preproc time : 0.000
% 12.94/2.93 # Success case prop encoding time : 0.000
% 12.94/2.93 # Success case prop solver time : 0.000
% 12.94/2.93 # Current number of processed clauses : 3170
% 12.94/2.93 # Positive orientable unit clauses : 237
% 12.94/2.93 # Positive unorientable unit clauses: 2
% 12.94/2.93 # Negative unit clauses : 478
% 12.94/2.93 # Non-unit-clauses : 2453
% 12.94/2.93 # Current number of unprocessed clauses: 27487
% 12.94/2.93 # ...number of literals in the above : 105151
% 12.94/2.93 # Current number of archived formulas : 0
% 12.94/2.93 # Current number of archived clauses : 2416
% 12.94/2.93 # Clause-clause subsumption calls (NU) : 4246812
% 12.94/2.93 # Rec. Clause-clause subsumption calls : 706520
% 12.94/2.93 # Non-unit clause-clause subsumptions : 4821
% 12.94/2.93 # Unit Clause-clause subsumption calls : 33991
% 12.94/2.93 # Rewrite failures with RHS unbound : 0
% 12.94/2.93 # BW rewrite match attempts : 288
% 12.94/2.93 # BW rewrite match successes : 186
% 12.94/2.93 # Condensation attempts : 0
% 12.94/2.93 # Condensation successes : 0
% 12.94/2.93 # Termbank termtop insertions : 854058
% 12.94/2.93
% 12.94/2.93 # -------------------------------------------------
% 12.94/2.93 # User time : 1.634 s
% 12.94/2.93 # System time : 0.052 s
% 12.94/2.93 # Total time : 1.686 s
% 12.94/2.93 # Maximum resident set size: 13052 pages
% 12.94/2.93
% 12.94/2.93 # -------------------------------------------------
% 12.94/2.93 # User time : 3.254 s
% 12.94/2.93 # System time : 0.104 s
% 12.94/2.93 # Total time : 3.358 s
% 12.94/2.93 # Maximum resident set size: 6136 pages
% 12.94/2.93 % E---3.1 exiting
% 12.94/2.93 % E---3.1 exiting
%------------------------------------------------------------------------------