TSTP Solution File: SWV033+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV033+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:42:39 EDT 2024
% Result : Theorem 0.66s 0.59s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 73 ( 17 unt; 0 def)
% Number of atoms : 250 ( 94 equ)
% Maximal formula atoms : 56 ( 3 avg)
% Number of connectives : 247 ( 70 ~; 110 |; 48 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-3 aty)
% Number of variables : 77 ( 3 sgn 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_init_0045,conjecture,
( ( init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,n2) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,n3) )
=> a_select3(simplex7_init,X18,X14) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,minus(pv1376,n1)) )
=> a_select2(s_values7_init,X4) = init ) )
=> ( init = init
& ! [X20] :
( ( leq(n0,X20)
& leq(X20,n2) )
=> ! [X21] :
( ( leq(n0,X21)
& leq(X21,n3) )
=> a_select3(simplex7_init,X21,X20) = init ) )
& ! [X22] :
( ( leq(n0,X22)
& leq(X22,minus(plus(n1,pv1376),n1)) )
=> a_select2(tptp_update2(s_values7_init,pv1376,init),X22) = init ) ) ),
file('/export/starexec/sandbox/tmp/tmp.df3cNzOxfT/E---3.1_30349.p',gauss_init_0045) ).
fof(sel2_update_2,axiom,
! [X5,X7,X1,X17,X25] :
( ( X5 != X7
& a_select2(X1,X7) = X17 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
file('/export/starexec/sandbox/tmp/tmp.df3cNzOxfT/E---3.1_30349.p',sel2_update_2) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/tmp/tmp.df3cNzOxfT/E---3.1_30349.p',pred_minus_1) ).
fof(leq_gt2,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& X1 != X2 )
=> gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.df3cNzOxfT/E---3.1_30349.p',leq_gt2) ).
fof(succ_plus_1_l,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/export/starexec/sandbox/tmp/tmp.df3cNzOxfT/E---3.1_30349.p',succ_plus_1_l) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.df3cNzOxfT/E---3.1_30349.p',pred_succ) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.df3cNzOxfT/E---3.1_30349.p',leq_gt_pred) ).
fof(sel2_update_1,axiom,
! [X1,X7,X17] : a_select2(tptp_update2(X1,X7,X17),X7) = X17,
file('/export/starexec/sandbox/tmp/tmp.df3cNzOxfT/E---3.1_30349.p',sel2_update_1) ).
fof(c_0_8,negated_conjecture,
~ ( ( init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,n2) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,n3) )
=> a_select3(simplex7_init,X18,X14) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,minus(pv1376,n1)) )
=> a_select2(s_values7_init,X4) = init ) )
=> ( init = init
& ! [X20] :
( ( leq(n0,X20)
& leq(X20,n2) )
=> ! [X21] :
( ( leq(n0,X21)
& leq(X21,n3) )
=> a_select3(simplex7_init,X21,X20) = init ) )
& ! [X22] :
( ( leq(n0,X22)
& leq(X22,minus(plus(n1,pv1376),n1)) )
=> a_select2(tptp_update2(s_values7_init,pv1376,init),X22) = init ) ) ),
inference(assume_negation,[status(cth)],[gauss_init_0045]) ).
fof(c_0_9,negated_conjecture,
! [X28,X29,X30] :
( init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ( ~ leq(n0,X28)
| ~ leq(X28,n2)
| ~ leq(n0,X29)
| ~ leq(X29,n3)
| a_select3(simplex7_init,X29,X28) = init )
& ( ~ leq(n0,X30)
| ~ leq(X30,minus(pv1376,n1))
| a_select2(s_values7_init,X30) = init )
& ( leq(n0,esk3_0)
| leq(n0,esk1_0)
| init != init )
& ( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(n0,esk1_0)
| init != init )
& ( a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| leq(n0,esk1_0)
| init != init )
& ( leq(n0,esk3_0)
| leq(esk1_0,n2)
| init != init )
& ( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(esk1_0,n2)
| init != init )
& ( a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| leq(esk1_0,n2)
| init != init )
& ( leq(n0,esk3_0)
| leq(n0,esk2_0)
| init != init )
& ( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(n0,esk2_0)
| init != init )
& ( a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| leq(n0,esk2_0)
| init != init )
& ( leq(n0,esk3_0)
| leq(esk2_0,n3)
| init != init )
& ( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(esk2_0,n3)
| init != init )
& ( a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| leq(esk2_0,n3)
| init != init )
& ( leq(n0,esk3_0)
| a_select3(simplex7_init,esk2_0,esk1_0) != init
| init != init )
& ( leq(esk3_0,minus(plus(n1,pv1376),n1))
| a_select3(simplex7_init,esk2_0,esk1_0) != init
| init != init )
& ( a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| a_select3(simplex7_init,esk2_0,esk1_0) != init
| init != init ) ),
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_8])])])])])]) ).
fof(c_0_10,plain,
! [X5,X7,X1,X17,X25] :
( ( X5 != X7
& a_select2(X1,X7) = X17 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
inference(fof_simplification,[status(thm)],[sel2_update_2]) ).
cnf(c_0_11,negated_conjecture,
( a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| a_select3(simplex7_init,esk2_0,esk1_0) != init
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( leq(n0,esk1_0)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( leq(n0,esk2_0)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( leq(esk1_0,n2)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( leq(esk2_0,n3)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X37,X38,X39,X40,X41] :
( X37 = X38
| a_select2(X39,X38) != X40
| a_select2(tptp_update2(X39,X37,X41),X38) = X40 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_17,negated_conjecture,
( a_select3(simplex7_init,esk2_0,esk1_0) != init
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(cn,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( a_select3(simplex7_init,X2,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n2)
| ~ leq(n0,X2)
| ~ leq(X2,n3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( leq(n0,esk1_0)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(cn,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( leq(n0,esk2_0)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(cn,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( leq(esk1_0,n2)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(cn,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( leq(esk2_0,n3)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(cn,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( X1 = X2
| a_select2(tptp_update2(X3,X1,X5),X2) = X4
| a_select2(X3,X2) != X4 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,plain,
! [X64] : minus(X64,n1) = pred(X64),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_25,negated_conjecture,
( leq(n0,esk3_0)
| a_select3(simplex7_init,esk2_0,esk1_0) != init
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( leq(n0,esk3_0)
| leq(n0,esk1_0)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
( leq(n0,esk3_0)
| leq(n0,esk2_0)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
( leq(n0,esk3_0)
| leq(esk1_0,n2)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
( leq(n0,esk3_0)
| leq(esk2_0,n3)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_30,plain,
! [X1,X2] :
( ( leq(X1,X2)
& X1 != X2 )
=> gt(X2,X1) ),
inference(fof_simplification,[status(thm)],[leq_gt2]) ).
cnf(c_0_31,negated_conjecture,
( leq(esk3_0,minus(plus(n1,pv1376),n1))
| a_select3(simplex7_init,esk2_0,esk1_0) != init
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_32,plain,
! [X68] : plus(n1,X68) = succ(X68),
inference(variable_rename,[status(thm)],[succ_plus_1_l]) ).
fof(c_0_33,plain,
! [X91] : pred(succ(X91)) = X91,
inference(variable_rename,[status(thm)],[pred_succ]) ).
cnf(c_0_34,negated_conjecture,
( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(n0,esk1_0)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(n0,esk2_0)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_36,negated_conjecture,
( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(esk1_0,n2)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_37,negated_conjecture,
( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(esk2_0,n3)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_38,negated_conjecture,
a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[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_39,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4)
| X2 = X4 ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_40,negated_conjecture,
( a_select2(s_values7_init,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,minus(pv1376,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_42,negated_conjecture,
( leq(n0,esk3_0)
| a_select3(simplex7_init,esk2_0,esk1_0) != init ),
inference(cn,[status(thm)],[c_0_25]) ).
cnf(c_0_43,negated_conjecture,
( leq(n0,esk1_0)
| leq(n0,esk3_0) ),
inference(cn,[status(thm)],[c_0_26]) ).
cnf(c_0_44,negated_conjecture,
( leq(n0,esk2_0)
| leq(n0,esk3_0) ),
inference(cn,[status(thm)],[c_0_27]) ).
cnf(c_0_45,negated_conjecture,
( leq(n0,esk3_0)
| leq(esk1_0,n2) ),
inference(cn,[status(thm)],[c_0_28]) ).
cnf(c_0_46,negated_conjecture,
( leq(n0,esk3_0)
| leq(esk2_0,n3) ),
inference(cn,[status(thm)],[c_0_29]) ).
fof(c_0_47,plain,
! [X89,X90] :
( ( ~ leq(X89,pred(X90))
| gt(X90,X89) )
& ( ~ gt(X90,X89)
| leq(X89,pred(X90)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])]) ).
fof(c_0_48,plain,
! [X53,X54] :
( ~ leq(X53,X54)
| X53 = X54
| gt(X54,X53) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
cnf(c_0_49,negated_conjecture,
( leq(esk3_0,minus(plus(n1,pv1376),n1))
| a_select3(simplex7_init,esk2_0,esk1_0) != init ),
inference(cn,[status(thm)],[c_0_31]) ).
cnf(c_0_50,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_51,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_52,negated_conjecture,
( leq(n0,esk1_0)
| leq(esk3_0,minus(plus(n1,pv1376),n1)) ),
inference(cn,[status(thm)],[c_0_34]) ).
cnf(c_0_53,negated_conjecture,
( leq(n0,esk2_0)
| leq(esk3_0,minus(plus(n1,pv1376),n1)) ),
inference(cn,[status(thm)],[c_0_35]) ).
cnf(c_0_54,negated_conjecture,
( leq(esk1_0,n2)
| leq(esk3_0,minus(plus(n1,pv1376),n1)) ),
inference(cn,[status(thm)],[c_0_36]) ).
cnf(c_0_55,negated_conjecture,
( leq(esk2_0,n3)
| leq(esk3_0,minus(plus(n1,pv1376),n1)) ),
inference(cn,[status(thm)],[c_0_37]) ).
cnf(c_0_56,negated_conjecture,
( esk3_0 = pv1376
| a_select2(s_values7_init,esk3_0) != init ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_57,negated_conjecture,
( a_select2(s_values7_init,X1) = init
| ~ leq(X1,pred(pv1376))
| ~ leq(n0,X1) ),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_58,negated_conjecture,
leq(n0,esk3_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_18]),c_0_43]),c_0_44]),c_0_45]),c_0_46]) ).
cnf(c_0_59,plain,
( leq(X2,pred(X1))
| ~ gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_60,plain,
( X1 = X2
| gt(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_61,negated_conjecture,
( leq(esk3_0,pv1376)
| a_select3(simplex7_init,esk2_0,esk1_0) != init ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_41]),c_0_50]),c_0_51]) ).
cnf(c_0_62,negated_conjecture,
( leq(n0,esk1_0)
| leq(esk3_0,pv1376) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_41]),c_0_50]),c_0_51]) ).
cnf(c_0_63,negated_conjecture,
( leq(n0,esk2_0)
| leq(esk3_0,pv1376) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_41]),c_0_50]),c_0_51]) ).
cnf(c_0_64,negated_conjecture,
( leq(esk1_0,n2)
| leq(esk3_0,pv1376) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_41]),c_0_50]),c_0_51]) ).
cnf(c_0_65,negated_conjecture,
( leq(esk2_0,n3)
| leq(esk3_0,pv1376) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_41]),c_0_50]),c_0_51]) ).
cnf(c_0_66,negated_conjecture,
( esk3_0 = pv1376
| ~ leq(esk3_0,pred(pv1376)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_67,plain,
( X1 = X2
| leq(X1,pred(X2))
| ~ leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_68,negated_conjecture,
leq(esk3_0,pv1376),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_18]),c_0_62]),c_0_63]),c_0_64]),c_0_65]) ).
fof(c_0_69,plain,
! [X34,X35,X36] : a_select2(tptp_update2(X34,X35,X36),X35) = X36,
inference(variable_rename,[status(thm)],[sel2_update_1]) ).
cnf(c_0_70,negated_conjecture,
esk3_0 = pv1376,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]) ).
cnf(c_0_71,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_70]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWV033+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 16:56:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/tmp/tmp.df3cNzOxfT/E---3.1_30349.p
% 0.66/0.59 # Version: 3.1.0
% 0.66/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.66/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.66/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.66/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.66/0.59 # Starting sh5l with 300s (1) cores
% 0.66/0.59 # new_bool_3 with pid 30430 completed with status 0
% 0.66/0.59 # Result found by new_bool_3
% 0.66/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.66/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.66/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.66/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.66/0.59 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.66/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.66/0.59 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.66/0.59 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 30433 completed with status 0
% 0.66/0.59 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.66/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.66/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.66/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.66/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.66/0.59 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.66/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.66/0.59 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.66/0.59 # Preprocessing time : 0.002 s
% 0.66/0.59
% 0.66/0.59 # Proof found!
% 0.66/0.59 # SZS status Theorem
% 0.66/0.59 # SZS output start CNFRefutation
% See solution above
% 0.66/0.59 # Parsed axioms : 85
% 0.66/0.59 # Removed by relevancy pruning/SinE : 21
% 0.66/0.59 # Initial clauses : 88
% 0.66/0.59 # Removed in clause preprocessing : 1
% 0.66/0.59 # Initial clauses in saturation : 87
% 0.66/0.59 # Processed clauses : 1253
% 0.66/0.59 # ...of these trivial : 29
% 0.66/0.59 # ...subsumed : 592
% 0.66/0.59 # ...remaining for further processing : 632
% 0.66/0.59 # Other redundant clauses eliminated : 2
% 0.66/0.59 # Clauses deleted for lack of memory : 0
% 0.66/0.59 # Backward-subsumed : 178
% 0.66/0.59 # Backward-rewritten : 106
% 0.66/0.59 # Generated clauses : 6841
% 0.66/0.59 # ...of the previous two non-redundant : 4247
% 0.66/0.59 # ...aggressively subsumed : 0
% 0.66/0.59 # Contextual simplify-reflections : 52
% 0.66/0.59 # Paramodulations : 6769
% 0.66/0.59 # Factorizations : 68
% 0.66/0.59 # NegExts : 0
% 0.66/0.59 # Equation resolutions : 4
% 0.66/0.59 # Disequality decompositions : 0
% 0.66/0.59 # Total rewrite steps : 4533
% 0.66/0.59 # ...of those cached : 4431
% 0.66/0.59 # Propositional unsat checks : 0
% 0.66/0.59 # Propositional check models : 0
% 0.66/0.59 # Propositional check unsatisfiable : 0
% 0.66/0.59 # Propositional clauses : 0
% 0.66/0.59 # Propositional clauses after purity: 0
% 0.66/0.59 # Propositional unsat core size : 0
% 0.66/0.59 # Propositional preprocessing time : 0.000
% 0.66/0.59 # Propositional encoding time : 0.000
% 0.66/0.59 # Propositional solver time : 0.000
% 0.66/0.59 # Success case prop preproc time : 0.000
% 0.66/0.59 # Success case prop encoding time : 0.000
% 0.66/0.59 # Success case prop solver time : 0.000
% 0.66/0.59 # Current number of processed clauses : 348
% 0.66/0.59 # Positive orientable unit clauses : 85
% 0.66/0.59 # Positive unorientable unit clauses: 0
% 0.66/0.59 # Negative unit clauses : 111
% 0.66/0.59 # Non-unit-clauses : 152
% 0.66/0.59 # Current number of unprocessed clauses: 2927
% 0.66/0.59 # ...number of literals in the above : 15994
% 0.66/0.59 # Current number of archived formulas : 0
% 0.66/0.59 # Current number of archived clauses : 284
% 0.66/0.59 # Clause-clause subsumption calls (NU) : 6675
% 0.66/0.59 # Rec. Clause-clause subsumption calls : 1291
% 0.66/0.59 # Non-unit clause-clause subsumptions : 272
% 0.66/0.59 # Unit Clause-clause subsumption calls : 3657
% 0.66/0.59 # Rewrite failures with RHS unbound : 0
% 0.66/0.59 # BW rewrite match attempts : 17
% 0.66/0.59 # BW rewrite match successes : 6
% 0.66/0.59 # Condensation attempts : 0
% 0.66/0.59 # Condensation successes : 0
% 0.66/0.59 # Termbank termtop insertions : 84305
% 0.66/0.59 # Search garbage collected termcells : 950
% 0.66/0.59
% 0.66/0.59 # -------------------------------------------------
% 0.66/0.59 # User time : 0.096 s
% 0.66/0.59 # System time : 0.004 s
% 0.66/0.59 # Total time : 0.100 s
% 0.66/0.59 # Maximum resident set size: 2052 pages
% 0.66/0.59
% 0.66/0.59 # -------------------------------------------------
% 0.66/0.59 # User time : 0.097 s
% 0.66/0.59 # System time : 0.006 s
% 0.66/0.59 # Total time : 0.104 s
% 0.66/0.59 # Maximum resident set size: 1804 pages
% 0.66/0.60 % E---3.1 exiting
% 0.66/0.60 % E exiting
%------------------------------------------------------------------------------