TSTP Solution File: PRO011+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PRO011+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:10:24 EDT 2024
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 55 ( 20 unt; 0 def)
% Number of atoms : 214 ( 12 equ)
% Maximal formula atoms : 49 ( 3 avg)
% Number of connectives : 234 ( 75 ~; 86 |; 59 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-2 aty)
% Number of variables : 83 ( 4 sgn 39 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_27,axiom,
! [X77,X78] :
( ( occurrence_of(X78,X77)
& ~ atomic(X77) )
=> ? [X79] :
( root(X79,X77)
& subactivity_occurrence(X79,X78) ) ),
file('/export/starexec/sandbox2/tmp/tmp.h12ImdxT31/E---3.1_20003.p',sos_27) ).
fof(goals,conjecture,
! [X110] :
( occurrence_of(X110,tptp0)
=> ? [X111,X112] :
( leaf_occ(X112,X110)
& ( occurrence_of(X112,tptp1)
=> ~ ? [X113] :
( occurrence_of(X113,tptp2)
& subactivity_occurrence(X113,X110)
& min_precedes(X111,X113,tptp0) ) )
& ( occurrence_of(X112,tptp2)
=> ~ ? [X114] :
( occurrence_of(X114,tptp1)
& subactivity_occurrence(X114,X110)
& min_precedes(X111,X114,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.h12ImdxT31/E---3.1_20003.p',goals) ).
fof(sos_37,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/tmp/tmp.h12ImdxT31/E---3.1_20003.p',sos_37) ).
fof(sos_24,axiom,
! [X68,X69] :
( subactivity_occurrence(X68,X69)
=> ( activity_occurrence(X68)
& activity_occurrence(X69) ) ),
file('/export/starexec/sandbox2/tmp/tmp.h12ImdxT31/E---3.1_20003.p',sos_24) ).
fof(sos_01,axiom,
! [X3] :
( activity_occurrence(X3)
=> ? [X4] :
( activity(X4)
& occurrence_of(X3,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.h12ImdxT31/E---3.1_20003.p',sos_01) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox2/tmp/tmp.h12ImdxT31/E---3.1_20003.p',sos_02) ).
fof(sos_35,axiom,
! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108,X109] :
( occurrence_of(X107,tptp3)
& root_occ(X107,X106)
& occurrence_of(X108,tptp4)
& next_subocc(X107,X108,tptp0)
& ( occurrence_of(X109,tptp1)
| occurrence_of(X109,tptp2) )
& next_subocc(X108,X109,tptp0)
& leaf_occ(X109,X106) ) ),
file('/export/starexec/sandbox2/tmp/tmp.h12ImdxT31/E---3.1_20003.p',sos_35) ).
fof(sos_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( occurrence_of(X104,X105)
& subactivity_occurrence(X103,X104)
& leaf(X103,X105) ) ),
file('/export/starexec/sandbox2/tmp/tmp.h12ImdxT31/E---3.1_20003.p',sos_34) ).
fof(sos_21,axiom,
! [X57,X58] :
( leaf(X57,X58)
<=> ( ( root(X57,X58)
| ? [X59] : min_precedes(X59,X57,X58) )
& ~ ? [X60] : min_precedes(X57,X60,X58) ) ),
file('/export/starexec/sandbox2/tmp/tmp.h12ImdxT31/E---3.1_20003.p',sos_21) ).
fof(sos_47,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox2/tmp/tmp.h12ImdxT31/E---3.1_20003.p',sos_47) ).
fof(c_0_10,plain,
! [X77,X78] :
( ( occurrence_of(X78,X77)
& ~ atomic(X77) )
=> ? [X79] :
( root(X79,X77)
& subactivity_occurrence(X79,X78) ) ),
inference(fof_simplification,[status(thm)],[sos_27]) ).
fof(c_0_11,negated_conjecture,
~ ! [X110] :
( occurrence_of(X110,tptp0)
=> ? [X111,X112] :
( leaf_occ(X112,X110)
& ( occurrence_of(X112,tptp1)
=> ~ ? [X113] :
( occurrence_of(X113,tptp2)
& subactivity_occurrence(X113,X110)
& min_precedes(X111,X113,tptp0) ) )
& ( occurrence_of(X112,tptp2)
=> ~ ? [X114] :
( occurrence_of(X114,tptp1)
& subactivity_occurrence(X114,X110)
& min_precedes(X111,X114,tptp0) ) ) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_12,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_37]) ).
fof(c_0_13,plain,
! [X141,X142] :
( ( root(esk7_2(X141,X142),X141)
| ~ occurrence_of(X142,X141)
| atomic(X141) )
& ( subactivity_occurrence(esk7_2(X141,X142),X142)
| ~ occurrence_of(X142,X141)
| atomic(X141) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_14,negated_conjecture,
! [X116,X117] :
( occurrence_of(esk1_0,tptp0)
& ( occurrence_of(X117,tptp2)
| occurrence_of(X117,tptp1)
| ~ leaf_occ(X117,esk1_0) )
& ( occurrence_of(esk3_2(X116,X117),tptp1)
| occurrence_of(X117,tptp1)
| ~ leaf_occ(X117,esk1_0) )
& ( subactivity_occurrence(esk3_2(X116,X117),esk1_0)
| occurrence_of(X117,tptp1)
| ~ leaf_occ(X117,esk1_0) )
& ( min_precedes(X116,esk3_2(X116,X117),tptp0)
| occurrence_of(X117,tptp1)
| ~ leaf_occ(X117,esk1_0) )
& ( occurrence_of(X117,tptp2)
| occurrence_of(esk2_2(X116,X117),tptp2)
| ~ leaf_occ(X117,esk1_0) )
& ( occurrence_of(esk3_2(X116,X117),tptp1)
| occurrence_of(esk2_2(X116,X117),tptp2)
| ~ leaf_occ(X117,esk1_0) )
& ( subactivity_occurrence(esk3_2(X116,X117),esk1_0)
| occurrence_of(esk2_2(X116,X117),tptp2)
| ~ leaf_occ(X117,esk1_0) )
& ( min_precedes(X116,esk3_2(X116,X117),tptp0)
| occurrence_of(esk2_2(X116,X117),tptp2)
| ~ leaf_occ(X117,esk1_0) )
& ( occurrence_of(X117,tptp2)
| subactivity_occurrence(esk2_2(X116,X117),esk1_0)
| ~ leaf_occ(X117,esk1_0) )
& ( occurrence_of(esk3_2(X116,X117),tptp1)
| subactivity_occurrence(esk2_2(X116,X117),esk1_0)
| ~ leaf_occ(X117,esk1_0) )
& ( subactivity_occurrence(esk3_2(X116,X117),esk1_0)
| subactivity_occurrence(esk2_2(X116,X117),esk1_0)
| ~ leaf_occ(X117,esk1_0) )
& ( min_precedes(X116,esk3_2(X116,X117),tptp0)
| subactivity_occurrence(esk2_2(X116,X117),esk1_0)
| ~ leaf_occ(X117,esk1_0) )
& ( occurrence_of(X117,tptp2)
| min_precedes(X116,esk2_2(X116,X117),tptp0)
| ~ leaf_occ(X117,esk1_0) )
& ( occurrence_of(esk3_2(X116,X117),tptp1)
| min_precedes(X116,esk2_2(X116,X117),tptp0)
| ~ leaf_occ(X117,esk1_0) )
& ( subactivity_occurrence(esk3_2(X116,X117),esk1_0)
| min_precedes(X116,esk2_2(X116,X117),tptp0)
| ~ leaf_occ(X117,esk1_0) )
& ( min_precedes(X116,esk3_2(X116,X117),tptp0)
| min_precedes(X116,esk2_2(X116,X117),tptp0)
| ~ leaf_occ(X117,esk1_0) ) ),
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_11])])])])])]) ).
fof(c_0_15,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X187,X188] :
( ( activity_occurrence(X187)
| ~ subactivity_occurrence(X187,X188) )
& ( activity_occurrence(X188)
| ~ subactivity_occurrence(X187,X188) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_24])])])]) ).
cnf(c_0_17,plain,
( subactivity_occurrence(esk7_2(X1,X2),X2)
| atomic(X1)
| ~ occurrence_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X162] :
( ( activity(esk12_1(X162))
| ~ activity_occurrence(X162) )
& ( occurrence_of(X162,esk12_1(X162))
| ~ activity_occurrence(X162) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_01])])])])]) ).
cnf(c_0_21,plain,
( activity_occurrence(X1)
| ~ subactivity_occurrence(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
subactivity_occurrence(esk7_2(tptp0,esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
fof(c_0_23,plain,
! [X147,X148,X149] :
( ~ occurrence_of(X147,X148)
| ~ occurrence_of(X147,X149)
| X148 = X149 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
cnf(c_0_24,plain,
( occurrence_of(X1,esk12_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
activity_occurrence(esk1_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
occurrence_of(esk1_0,esk12_1(esk1_0)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_28,plain,
! [X156] :
( ( occurrence_of(esk9_1(X156),tptp3)
| ~ occurrence_of(X156,tptp0) )
& ( root_occ(esk9_1(X156),X156)
| ~ occurrence_of(X156,tptp0) )
& ( occurrence_of(esk10_1(X156),tptp4)
| ~ occurrence_of(X156,tptp0) )
& ( next_subocc(esk9_1(X156),esk10_1(X156),tptp0)
| ~ occurrence_of(X156,tptp0) )
& ( occurrence_of(esk11_1(X156),tptp1)
| occurrence_of(esk11_1(X156),tptp2)
| ~ occurrence_of(X156,tptp0) )
& ( next_subocc(esk10_1(X156),esk11_1(X156),tptp0)
| ~ occurrence_of(X156,tptp0) )
& ( leaf_occ(esk11_1(X156),X156)
| ~ occurrence_of(X156,tptp0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_35])])])])]) ).
cnf(c_0_29,negated_conjecture,
( X1 = esk12_1(esk1_0)
| ~ occurrence_of(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_30,plain,
! [X150,X151,X153,X154,X155] :
( ( occurrence_of(X151,esk8_2(X150,X151))
| ~ leaf_occ(X150,X151) )
& ( subactivity_occurrence(X150,X151)
| ~ leaf_occ(X150,X151) )
& ( leaf(X150,esk8_2(X150,X151))
| ~ leaf_occ(X150,X151) )
& ( ~ occurrence_of(X154,X155)
| ~ subactivity_occurrence(X153,X154)
| ~ leaf(X153,X155)
| leaf_occ(X153,X154) ) ),
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)],[sos_34])])])])])])]) ).
cnf(c_0_31,plain,
( leaf_occ(esk11_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
esk12_1(esk1_0) = tptp0,
inference(spm,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_33,plain,
( occurrence_of(X1,esk8_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
leaf_occ(esk11_1(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
fof(c_0_35,plain,
! [X165,X166,X168,X169,X170,X171] :
( ( root(X165,X166)
| min_precedes(esk13_2(X165,X166),X165,X166)
| ~ leaf(X165,X166) )
& ( ~ min_precedes(X165,X168,X166)
| ~ leaf(X165,X166) )
& ( ~ root(X169,X170)
| min_precedes(X169,esk14_2(X169,X170),X170)
| leaf(X169,X170) )
& ( ~ min_precedes(X171,X169,X170)
| min_precedes(X169,esk14_2(X169,X170),X170)
| leaf(X169,X170) ) ),
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)],[sos_21])])])])])])]) ).
cnf(c_0_36,negated_conjecture,
( min_precedes(X1,esk3_2(X1,X2),tptp0)
| occurrence_of(X2,tptp1)
| ~ leaf_occ(X2,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_37,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk1_0,X1) ),
inference(rw,[status(thm)],[c_0_29,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
occurrence_of(esk1_0,esk8_2(esk11_1(esk1_0),esk1_0)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( ~ min_precedes(X1,X2,X3)
| ~ leaf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( min_precedes(X1,esk3_2(X1,esk11_1(esk1_0)),tptp0)
| occurrence_of(esk11_1(esk1_0),tptp1) ),
inference(spm,[status(thm)],[c_0_36,c_0_34]) ).
cnf(c_0_41,plain,
( leaf(X1,esk8_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,negated_conjecture,
esk8_2(esk11_1(esk1_0),esk1_0) = tptp0,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk2_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_44,negated_conjecture,
( occurrence_of(esk11_1(esk1_0),tptp1)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
leaf(esk11_1(esk1_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_34]),c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( min_precedes(X1,esk2_2(X1,esk11_1(esk1_0)),tptp0)
| occurrence_of(esk11_1(esk1_0),tptp2) ),
inference(spm,[status(thm)],[c_0_43,c_0_34]) ).
fof(c_0_47,plain,
tptp1 != tptp2,
inference(fof_simplification,[status(thm)],[sos_47]) ).
cnf(c_0_48,negated_conjecture,
occurrence_of(esk11_1(esk1_0),tptp1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( occurrence_of(esk11_1(esk1_0),tptp2)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_39,c_0_46]) ).
fof(c_0_50,plain,
tptp1 != tptp2,
inference(fof_nnf,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( X1 = tptp1
| ~ occurrence_of(esk11_1(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
occurrence_of(esk11_1(esk1_0),tptp2),
inference(spm,[status(thm)],[c_0_49,c_0_45]) ).
cnf(c_0_53,plain,
tptp1 != tptp2,
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : PRO011+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n013.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 15:47:23 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.h12ImdxT31/E---3.1_20003.p
% 0.16/0.46 # Version: 3.1.0
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # new_bool_1 with pid 20082 completed with status 0
% 0.16/0.46 # Result found by new_bool_1
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.16/0.46 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 20084 completed with status 0
% 0.16/0.46 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.16/0.46 # Preprocessing time : 0.003 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 49
% 0.16/0.46 # Removed by relevancy pruning/SinE : 13
% 0.16/0.46 # Initial clauses : 86
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 86
% 0.16/0.46 # Processed clauses : 328
% 0.16/0.46 # ...of these trivial : 4
% 0.16/0.46 # ...subsumed : 17
% 0.16/0.46 # ...remaining for further processing : 307
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 3
% 0.16/0.46 # Backward-rewritten : 24
% 0.16/0.46 # Generated clauses : 418
% 0.16/0.46 # ...of the previous two non-redundant : 355
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 2
% 0.16/0.46 # Paramodulations : 418
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 0
% 0.16/0.46 # Disequality decompositions : 0
% 0.16/0.46 # Total rewrite steps : 119
% 0.16/0.46 # ...of those cached : 77
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 194
% 0.16/0.46 # Positive orientable unit clauses : 65
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 15
% 0.16/0.46 # Non-unit-clauses : 114
% 0.16/0.46 # Current number of unprocessed clauses: 177
% 0.16/0.46 # ...number of literals in the above : 366
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 113
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 3040
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 2362
% 0.16/0.46 # Non-unit clause-clause subsumptions : 9
% 0.16/0.46 # Unit Clause-clause subsumption calls : 455
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 13
% 0.16/0.46 # BW rewrite match successes : 13
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 11564
% 0.16/0.46 # Search garbage collected termcells : 1288
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.016 s
% 0.16/0.46 # System time : 0.008 s
% 0.16/0.46 # Total time : 0.024 s
% 0.16/0.46 # Maximum resident set size: 2048 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.019 s
% 0.16/0.46 # System time : 0.009 s
% 0.16/0.46 # Total time : 0.028 s
% 0.16/0.46 # Maximum resident set size: 1812 pages
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------