TSTP Solution File: MGT043+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT043+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 18:37:13 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 13 unt; 0 def)
% Number of atoms : 213 ( 51 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 233 ( 72 ~; 66 |; 61 &)
% ( 5 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 90 ( 2 sgn; 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lemma_2,conjecture,
! [X1,X4,X5] :
( ( organization(X1)
& ~ has_immunity(X1,X4)
& ~ has_immunity(X1,X5)
& stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4)
& greater(internal_friction(X1,X5),internal_friction(X1,X4))
& external_ties(X1,X4) = external_ties(X1,X5) )
=> greater(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.fQ27THyvyi/E---3.1_2793.p',lemma_2) ).
fof(assumption_6,axiom,
! [X1,X4,X5] :
( organization(X1)
=> ( ( greater(external_ties(X1,X5),external_ties(X1,X4))
=> greater(position(X1,X5),position(X1,X4)) )
& ( external_ties(X1,X5) = external_ties(X1,X4)
=> position(X1,X5) = position(X1,X4) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fQ27THyvyi/E---3.1_2793.p',assumption_6) ).
fof(definition_smaller_or_equal,axiom,
! [X1,X2] :
( smaller_or_equal(X1,X2)
<=> ( smaller(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.fQ27THyvyi/E---3.1_2793.p',definition_smaller_or_equal) ).
fof(definition_smaller,axiom,
! [X1,X2] :
( smaller(X1,X2)
<=> greater(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fQ27THyvyi/E---3.1_2793.p',definition_smaller) ).
fof(assumption_5,axiom,
! [X1,X4,X5] :
( organization(X1)
=> ( ( ( greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& greater(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4)
& internal_friction(X1,X5) = internal_friction(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fQ27THyvyi/E---3.1_2793.p',assumption_5) ).
fof(definition_greater_or_equal,axiom,
! [X1,X2] :
( greater_or_equal(X1,X2)
<=> ( greater(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.fQ27THyvyi/E---3.1_2793.p',definition_greater_or_equal) ).
fof(assumption_4,axiom,
! [X1,X4,X5] :
( ( organization(X1)
& ~ has_immunity(X1,X4)
& ~ has_immunity(X1,X5) )
=> ( ( ( greater(capability(X1,X5),capability(X1,X4))
& greater_or_equal(position(X1,X5),position(X1,X4)) )
=> smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)) )
& ( ( greater_or_equal(capability(X1,X5),capability(X1,X4))
& greater(position(X1,X5),position(X1,X4)) )
=> smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)) )
& ( ( capability(X1,X5) = capability(X1,X4)
& position(X1,X5) = position(X1,X4) )
=> hazard_of_mortality(X1,X5) = hazard_of_mortality(X1,X4) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fQ27THyvyi/E---3.1_2793.p',assumption_4) ).
fof(c_0_7,plain,
! [X1,X5,X4] :
( epred2_3(X4,X5,X1)
<=> ( ( ( greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& greater(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4)
& internal_friction(X1,X5) = internal_friction(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) ) ) ),
introduced(definition) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X4,X5] :
( ( organization(X1)
& ~ has_immunity(X1,X4)
& ~ has_immunity(X1,X5)
& stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4)
& greater(internal_friction(X1,X5),internal_friction(X1,X4))
& external_ties(X1,X4) = external_ties(X1,X5) )
=> greater(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[lemma_2])]) ).
fof(c_0_9,plain,
! [X1,X5,X4] :
( epred2_3(X4,X5,X1)
=> ( ( ( greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& greater(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4)
& internal_friction(X1,X5) = internal_friction(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) ) ) ),
inference(split_equiv,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X25,X26,X27] :
( ( ~ greater(external_ties(X25,X27),external_ties(X25,X26))
| greater(position(X25,X27),position(X25,X26))
| ~ organization(X25) )
& ( external_ties(X25,X27) != external_ties(X25,X26)
| position(X25,X27) = position(X25,X26)
| ~ organization(X25) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_6])])]) ).
fof(c_0_11,negated_conjecture,
( organization(esk1_0)
& ~ has_immunity(esk1_0,esk2_0)
& ~ has_immunity(esk1_0,esk3_0)
& stock_of_knowledge(esk1_0,esk3_0) = stock_of_knowledge(esk1_0,esk2_0)
& greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0))
& external_ties(esk1_0,esk2_0) = external_ties(esk1_0,esk3_0)
& ~ greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,plain,
! [X34,X35,X36] :
( ( ~ greater(stock_of_knowledge(X34,X35),stock_of_knowledge(X34,X36))
| ~ smaller_or_equal(internal_friction(X34,X35),internal_friction(X34,X36))
| greater(capability(X34,X35),capability(X34,X36))
| ~ epred2_3(X36,X35,X34) )
& ( ~ smaller_or_equal(stock_of_knowledge(X34,X35),stock_of_knowledge(X34,X36))
| ~ greater(internal_friction(X34,X35),internal_friction(X34,X36))
| smaller(capability(X34,X35),capability(X34,X36))
| ~ epred2_3(X36,X35,X34) )
& ( stock_of_knowledge(X34,X35) != stock_of_knowledge(X34,X36)
| internal_friction(X34,X35) != internal_friction(X34,X36)
| capability(X34,X35) = capability(X34,X36)
| ~ epred2_3(X36,X35,X34) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_13,plain,
! [X6,X7] :
( ( ~ smaller_or_equal(X6,X7)
| smaller(X6,X7)
| X6 = X7 )
& ( ~ smaller(X6,X7)
| smaller_or_equal(X6,X7) )
& ( X6 != X7
| smaller_or_equal(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller_or_equal])])]) ).
fof(c_0_14,plain,
! [X1,X5,X4] :
( epred1_3(X4,X5,X1)
<=> ( ( ( greater(capability(X1,X5),capability(X1,X4))
& greater_or_equal(position(X1,X5),position(X1,X4)) )
=> smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)) )
& ( ( greater_or_equal(capability(X1,X5),capability(X1,X4))
& greater(position(X1,X5),position(X1,X4)) )
=> smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)) )
& ( ( capability(X1,X5) = capability(X1,X4)
& position(X1,X5) = position(X1,X4) )
=> hazard_of_mortality(X1,X5) = hazard_of_mortality(X1,X4) ) ) ),
introduced(definition) ).
cnf(c_0_15,plain,
( position(X1,X2) = position(X1,X3)
| external_ties(X1,X2) != external_ties(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ epred2_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
stock_of_knowledge(esk1_0,esk3_0) = stock_of_knowledge(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X1,X5,X4] :
( epred1_3(X4,X5,X1)
=> ( ( ( greater(capability(X1,X5),capability(X1,X4))
& greater_or_equal(position(X1,X5),position(X1,X4)) )
=> smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)) )
& ( ( greater_or_equal(capability(X1,X5),capability(X1,X4))
& greater(position(X1,X5),position(X1,X4)) )
=> smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)) )
& ( ( capability(X1,X5) = capability(X1,X4)
& position(X1,X5) = position(X1,X4) )
=> hazard_of_mortality(X1,X5) = hazard_of_mortality(X1,X4) ) ) ),
inference(split_equiv,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( position(esk1_0,X1) = position(esk1_0,X2)
| external_ties(esk1_0,X1) != external_ties(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
external_ties(esk1_0,esk2_0) = external_ties(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_23,plain,
! [X10,X11] :
( ( ~ smaller(X10,X11)
| greater(X11,X10) )
& ( ~ greater(X11,X10)
| smaller(X10,X11) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller])]) ).
cnf(c_0_24,negated_conjecture,
( smaller(capability(esk1_0,X1),capability(esk1_0,esk2_0))
| ~ epred2_3(esk2_0,X1,esk1_0)
| ~ greater(internal_friction(esk1_0,X1),internal_friction(esk1_0,esk2_0))
| ~ smaller_or_equal(stock_of_knowledge(esk1_0,X1),stock_of_knowledge(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_27,axiom,
! [X1,X4,X5] :
( organization(X1)
=> epred2_3(X4,X5,X1) ),
inference(apply_def,[status(thm)],[assumption_5,c_0_7]) ).
fof(c_0_28,plain,
! [X31,X32,X33] :
( ( ~ greater(capability(X31,X32),capability(X31,X33))
| ~ greater_or_equal(position(X31,X32),position(X31,X33))
| smaller(hazard_of_mortality(X31,X32),hazard_of_mortality(X31,X33))
| ~ epred1_3(X33,X32,X31) )
& ( ~ greater_or_equal(capability(X31,X32),capability(X31,X33))
| ~ greater(position(X31,X32),position(X31,X33))
| smaller(hazard_of_mortality(X31,X32),hazard_of_mortality(X31,X33))
| ~ epred1_3(X33,X32,X31) )
& ( capability(X31,X32) != capability(X31,X33)
| position(X31,X32) != position(X31,X33)
| hazard_of_mortality(X31,X32) = hazard_of_mortality(X31,X33)
| ~ epred1_3(X33,X32,X31) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_29,negated_conjecture,
( position(esk1_0,X1) = position(esk1_0,esk2_0)
| external_ties(esk1_0,X1) != external_ties(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_30,plain,
! [X8,X9] :
( ( ~ greater_or_equal(X8,X9)
| greater(X8,X9)
| X8 = X9 )
& ( ~ greater(X8,X9)
| greater_or_equal(X8,X9) )
& ( X8 != X9
| greater_or_equal(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_greater_or_equal])])]) ).
cnf(c_0_31,plain,
( greater(X2,X1)
| ~ smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
( smaller(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))
| ~ epred2_3(esk2_0,esk3_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
fof(c_0_33,plain,
! [X22,X23,X24] :
( ~ organization(X22)
| epred2_3(X23,X24,X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])]) ).
cnf(c_0_34,plain,
( smaller(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))
| ~ greater(capability(X1,X2),capability(X1,X3))
| ~ greater_or_equal(position(X1,X2),position(X1,X3))
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,negated_conjecture,
position(esk1_0,esk2_0) = position(esk1_0,esk3_0),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( greater(capability(esk1_0,esk2_0),capability(esk1_0,esk3_0))
| ~ epred2_3(esk2_0,esk3_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( epred2_3(X2,X3,X1)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_39,plain,
! [X1,X4,X5] :
( ( organization(X1)
& ~ has_immunity(X1,X4)
& ~ has_immunity(X1,X5) )
=> epred1_3(X4,X5,X1) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[assumption_4]),c_0_14]) ).
cnf(c_0_40,plain,
( smaller(hazard_of_mortality(esk1_0,esk2_0),hazard_of_mortality(esk1_0,X1))
| ~ epred1_3(X1,esk2_0,esk1_0)
| ~ greater(capability(esk1_0,esk2_0),capability(esk1_0,X1))
| ~ greater_or_equal(position(esk1_0,esk3_0),position(esk1_0,X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
greater(capability(esk1_0,esk2_0),capability(esk1_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_16])]) ).
fof(c_0_43,plain,
! [X19,X20,X21] :
( ~ organization(X19)
| has_immunity(X19,X20)
| has_immunity(X19,X21)
| epred1_3(X20,X21,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])]) ).
cnf(c_0_44,plain,
( smaller(hazard_of_mortality(esk1_0,esk2_0),hazard_of_mortality(esk1_0,esk3_0))
| ~ epred1_3(esk3_0,esk2_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_45,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_46,plain,
( has_immunity(X1,X2)
| has_immunity(X1,X3)
| epred1_3(X2,X3,X1)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_47,plain,
~ epred1_3(esk3_0,esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_44]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( epred1_3(X1,X2,esk1_0)
| has_immunity(esk1_0,X1)
| has_immunity(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_16]) ).
cnf(c_0_49,negated_conjecture,
~ has_immunity(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_50,negated_conjecture,
~ has_immunity(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT043+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.34 % CPULimit : 2400
% 0.19/0.34 % WCLimit : 300
% 0.19/0.34 % DateTime : Tue Oct 3 00:22:44 EDT 2023
% 0.19/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.fQ27THyvyi/E---3.1_2793.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2914 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSF-FFMS22-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2922 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSF-FFMS22-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 10
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 28
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 28
% 0.20/0.51 # Processed clauses : 184
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 41
% 0.20/0.51 # ...remaining for further processing : 143
% 0.20/0.51 # Other redundant clauses eliminated : 2
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 5
% 0.20/0.51 # Backward-rewritten : 5
% 0.20/0.51 # Generated clauses : 530
% 0.20/0.51 # ...of the previous two non-redundant : 475
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 2
% 0.20/0.51 # Paramodulations : 516
% 0.20/0.51 # Factorizations : 8
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 6
% 0.20/0.51 # Total rewrite steps : 63
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 103
% 0.20/0.51 # Positive orientable unit clauses : 8
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 6
% 0.20/0.51 # Non-unit-clauses : 89
% 0.20/0.51 # Current number of unprocessed clauses: 341
% 0.20/0.51 # ...number of literals in the above : 2072
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 38
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 3128
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 1867
% 0.20/0.51 # Non-unit clause-clause subsumptions : 44
% 0.20/0.51 # Unit Clause-clause subsumption calls : 44
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 2
% 0.20/0.51 # BW rewrite match successes : 2
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 12226
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.023 s
% 0.20/0.51 # System time : 0.005 s
% 0.20/0.51 # Total time : 0.028 s
% 0.20/0.51 # Maximum resident set size: 1780 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.112 s
% 0.20/0.51 # System time : 0.014 s
% 0.20/0.51 # Total time : 0.125 s
% 0.20/0.51 # Maximum resident set size: 1688 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------