%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL949_4 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:18:08 PM UTC 2026
% Result : Theorem 0.13s 10.47s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 195 ( 0 equ)
% Maximal formula atoms : 44 ( 5 avg)
% Number of connectives : 234 ( 78 ~; 86 |; 20 &)
% ( 1 <=>; 49 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 127 ( 0 sgn 127 !; 0 ?; 88 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'$ki_world': $tType ).
tff(decl_23,type,
'$ki_local_world': '$ki_world' ).
tff(decl_24,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(decl_30,type,
qmltpeq: ( $i * ( $i * '$ki_world' ) ) > $o ).
tff(decl_35,type,
subclass: ( $i * ( $i * '$ki_world' ) ) > $o ).
tff(decl_57,type,
'$ki_exists_in_world_$i': ( $i * '$ki_world' ) > $o ).
tff(decl_59,type,
epred2_3: ( $i * ( '$ki_world' * $i ) ) > $o ).
tff(decl_60,type,
esk1_0: '$ki_world' ).
tff(decl_61,type,
esk2_0: $i ).
tff(decl_62,type,
esk3_0: '$ki_world' ).
tff(decl_81,type,
esk22_4: ( '$ki_world' * ( $i * ( '$ki_world' * $i ) ) ) > '$ki_world' ).
tff(decl_82,type,
esk23_4: ( '$ki_world' * ( $i * ( '$ki_world' * $i ) ) ) > '$ki_world' ).
tff(decl_83,type,
esk24_4: ( '$ki_world' * ( $i * ( '$ki_world' * $i ) ) ) > '$ki_world' ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> subclass(X5,X4,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(reflexivity,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> qmltpeq(X5,X4,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
tff('$ki_exists_in_world_$i_const',axiom,
! [X1: '$ki_world',X4] : '$ki_exists_in_world_$i'(X1,X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
tff(mrel_transitive,axiom,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world'] :
( ( '$ki_accessible'(X2,X3)
& '$ki_accessible'(X1,X2) )
=> '$ki_accessible'(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_transitive) ).
tff(extensionality,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ! [X6] :
( '$ki_exists_in_world_$i'(X5,X6)
=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X6,X4) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X4,X6) ) )
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> qmltpeq(X8,X4,X6) ) ) )
& ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> qmltpeq(X8,X4,X6) )
=> ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X6,X4) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X4,X6) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality) ).
tff(mrel_reflexive,axiom,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(c_0_6,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> subclass(X5,X4,X4) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_7,plain,
! [X4,X5: '$ki_world',X6] :
( epred2_3(X6,X5,X4)
<=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X6,X4) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X4,X6) ) )
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> qmltpeq(X8,X4,X6) ) ) )
& ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> qmltpeq(X8,X4,X6) )
=> ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X6,X4) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X4,X6) ) ) ) ) ) ),
introduced(definition) ).
tff(c_0_8,plain,
! [X80: '$ki_world',X81,X82: '$ki_world'] :
( qmltpeq(X82,X81,X81)
| ~ '$ki_accessible'(X80,X82)
| ~ '$ki_exists_in_world_$i'(X80,X81)
| ~ '$ki_accessible'('$ki_local_world',X80) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[reflexivity])])])]) ).
tff(c_0_9,plain,
! [X76: '$ki_world',X77] : '$ki_exists_in_world_$i'(X76,X77),
inference(variable_rename,[status(thm)],['$ki_exists_in_world_$i_const']) ).
tff(c_0_10,plain,
! [X73: '$ki_world',X74: '$ki_world',X75: '$ki_world'] :
( '$ki_accessible'(X73,X75)
| ~ '$ki_accessible'(X74,X75)
| ~ '$ki_accessible'(X73,X74) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mrel_transitive])])]) ).
tff(c_0_11,negated_conjecture,
( ~ subclass(esk3_0,esk2_0,esk2_0)
& '$ki_accessible'(esk1_0,esk3_0)
& '$ki_exists_in_world_$i'(esk1_0,esk2_0)
& '$ki_accessible'('$ki_local_world',esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
tff(c_0_12,plain,
! [X4,X5: '$ki_world',X6] :
( epred2_3(X6,X5,X4)
=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X6,X4) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X4,X6) ) )
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> qmltpeq(X8,X4,X6) ) ) )
& ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> qmltpeq(X8,X4,X6) )
=> ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X6,X4) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subclass(X8,X4,X6) ) ) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_7]) ).
tcf(c_0_13,plain,
! [X1: '$ki_world',X4,X2: '$ki_world'] :
( ~ '$ki_accessible'(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ '$ki_accessible'('$ki_local_world',X1)
| qmltpeq(X2,X4,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_14,plain,
! [X1: '$ki_world',X4] : '$ki_exists_in_world_$i'(X1,X4),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_15,plain,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world'] :
( ~ '$ki_accessible'(X2,X3)
| ~ '$ki_accessible'(X1,X2)
| '$ki_accessible'(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_16,negated_conjecture,
'$ki_accessible'(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tff(c_0_17,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ! [X6] :
( '$ki_exists_in_world_$i'(X5,X6)
=> epred2_3(X6,X5,X4) ) ) ) ),
inference(apply_def,[status(thm)],[extensionality,c_0_7]) ).
tff(c_0_18,plain,
! [X137,X138: '$ki_world',X139,X140: '$ki_world',X142: '$ki_world',X143: '$ki_world',X144: '$ki_world',X147: '$ki_world'] :
( ( ~ epred2_3(X139,X138,X137)
| ~ '$ki_accessible'(X138,X144)
| qmltpeq(X147,X137,X139)
| ~ '$ki_accessible'(X144,X147)
| ~ subclass(esk23_4(X137,X138,X139,X144),X137,X139)
| ~ subclass(esk24_4(X137,X138,X139,X144),X139,X137) )
& ( ~ epred2_3(X139,X138,X137)
| ~ '$ki_accessible'(X138,X144)
| qmltpeq(X147,X137,X139)
| ~ '$ki_accessible'(X144,X147)
| ~ subclass(esk23_4(X137,X138,X139,X144),X137,X139)
| '$ki_accessible'(X144,esk24_4(X137,X138,X139,X144)) )
& ( ~ epred2_3(X139,X138,X137)
| ~ '$ki_accessible'(X138,X144)
| qmltpeq(X147,X137,X139)
| ~ '$ki_accessible'(X144,X147)
| '$ki_accessible'(X144,esk23_4(X137,X138,X139,X144))
| ~ subclass(esk24_4(X137,X138,X139,X144),X139,X137) )
& ( ~ epred2_3(X139,X138,X137)
| ~ '$ki_accessible'(X138,X144)
| qmltpeq(X147,X137,X139)
| ~ '$ki_accessible'(X144,X147)
| '$ki_accessible'(X144,esk23_4(X137,X138,X139,X144))
| '$ki_accessible'(X144,esk24_4(X137,X138,X139,X144)) )
& ( ~ epred2_3(X139,X138,X137)
| ~ '$ki_accessible'(X138,X140)
| ~ qmltpeq(esk22_4(X137,X138,X139,X140),X137,X139)
| subclass(X143,X139,X137)
| ~ '$ki_accessible'(X140,X143) )
& ( ~ epred2_3(X139,X138,X137)
| ~ '$ki_accessible'(X138,X140)
| ~ qmltpeq(esk22_4(X137,X138,X139,X140),X137,X139)
| subclass(X142,X137,X139)
| ~ '$ki_accessible'(X140,X142) )
& ( ~ epred2_3(X139,X138,X137)
| ~ '$ki_accessible'(X138,X140)
| '$ki_accessible'(X140,esk22_4(X137,X138,X139,X140))
| subclass(X143,X139,X137)
| ~ '$ki_accessible'(X140,X143) )
& ( ~ epred2_3(X139,X138,X137)
| ~ '$ki_accessible'(X138,X140)
| '$ki_accessible'(X140,esk22_4(X137,X138,X139,X140))
| subclass(X142,X137,X139)
| ~ '$ki_accessible'(X140,X142) ) ),
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_12])])])])])]) ).
tcf(c_0_19,plain,
! [X4,X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X2,X1)
| ~ '$ki_accessible'('$ki_local_world',X2)
| qmltpeq(X1,X4,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
tcf(c_0_20,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(X1,esk1_0)
| '$ki_accessible'(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
tcf(c_0_21,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tff(c_0_22,plain,
! [X72: '$ki_world'] : '$ki_accessible'(X72,X72),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
tff(c_0_23,plain,
! [X68: '$ki_world',X69,X70: '$ki_world',X71] :
( epred2_3(X71,X70,X69)
| ~ '$ki_exists_in_world_$i'(X70,X71)
| ~ '$ki_accessible'(X68,X70)
| ~ '$ki_exists_in_world_$i'(X68,X69)
| ~ '$ki_accessible'('$ki_local_world',X68) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
tcf(c_0_24,plain,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world',X6,X4] :
( ~ epred2_3(X6,X3,X4)
| ~ '$ki_accessible'(X3,X1)
| ~ qmltpeq(esk22_4(X4,X3,X6,X1),X4,X6)
| ~ '$ki_accessible'(X1,X2)
| subclass(X2,X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_25,negated_conjecture,
! [X4,X1: '$ki_world'] :
( ~ '$ki_accessible'(esk3_0,X1)
| qmltpeq(X1,X4,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
tcf(c_0_26,plain,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world',X6,X4] :
( ~ epred2_3(X6,X3,X4)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_accessible'(X1,X2)
| '$ki_accessible'(X1,esk22_4(X4,X3,X6,X1))
| subclass(X2,X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_27,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
tcf(c_0_28,plain,
! [X1: '$ki_world',X2: '$ki_world',X4,X6] :
( ~ '$ki_exists_in_world_$i'(X2,X6)
| ~ '$ki_accessible'(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ '$ki_accessible'('$ki_local_world',X1)
| epred2_3(X6,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_29,negated_conjecture,
! [X4,X3: '$ki_world',X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X3,X1)
| ~ '$ki_accessible'(X2,X3)
| ~ '$ki_accessible'(esk3_0,esk22_4(X4,X2,X4,X3))
| ~ epred2_3(X4,X2,X4)
| subclass(X1,X4,X4) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
tcf(c_0_30,plain,
! [X6,X4,X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X2,X1)
| ~ epred2_3(X6,X2,X4)
| '$ki_accessible'(X1,esk22_4(X4,X2,X6,X1))
| subclass(X1,X4,X6) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
tcf(c_0_31,plain,
! [X6,X4,X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X2,X1)
| ~ '$ki_accessible'('$ki_local_world',X2)
| epred2_3(X4,X1,X6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_14]),c_0_14])]) ).
tcf(c_0_32,plain,
! [X4,X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(esk3_0,X1)
| ~ '$ki_accessible'(X2,esk3_0)
| ~ epred2_3(X4,X2,X4)
| subclass(X1,X4,X4)
| subclass(esk3_0,X4,X4) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
tcf(c_0_33,negated_conjecture,
! [X6,X4,X1: '$ki_world'] :
( ~ '$ki_accessible'(esk3_0,X1)
| epred2_3(X4,X1,X6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_20]),c_0_21])]) ).
tcf(c_0_34,negated_conjecture,
! [X1: '$ki_world',X4,X2: '$ki_world'] :
( ~ '$ki_accessible'(esk3_0,X2)
| ~ '$ki_accessible'(esk3_0,X1)
| ~ '$ki_accessible'(X2,esk3_0)
| subclass(X1,X4,X4)
| subclass(esk3_0,X4,X4) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
tcf(c_0_35,negated_conjecture,
! [X4,X1: '$ki_world'] :
( ~ '$ki_accessible'(esk3_0,X1)
| subclass(X1,X4,X4)
| subclass(esk3_0,X4,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_27])]) ).
tcf(c_0_36,negated_conjecture,
~ subclass(esk3_0,esk2_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_37,negated_conjecture,
! [X4] : subclass(esk3_0,X4,X4),
inference(spm,[status(thm)],[c_0_35,c_0_27]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL949_4 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/10.38 % Computer : n026.cluster.edu
% 0.09/10.38 % Model : x86_64 x86_64
% 0.09/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.38 % Memory : 8046.5625MB
% 0.09/10.38 % OS : Linux 6.8.0-71-generic
% 0.09/10.38 % CPULimit : 300
% 0.09/10.38 % WCLimit : 300
% 0.09/10.38 % DateTime : Mon Sep 21 01:16:47 UTC 2026
% 0.09/10.38 % CPUTime :
% 0.09/10.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/10.42 Running first-order theorem proving
% 0.13/10.42 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/benchmark/theBenchmark.p
% 0.13/10.47 % Version: 3.5.1
% 0.13/10.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/10.47 % Starting new_bool_1 with 300s (1) cores
% 0.13/10.47 % Starting sh5l with 300s (1) cores
% 0.13/10.47 % new_bool_3 with pid 1046399 completed with status 0
% 0.13/10.47 % Result found by new_bool_3
% 0.13/10.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/10.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/10.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/10.47 % Search class: FGUNS-FFLS33-SFFFFFNN
% 0.13/10.47 % partial match(2): FGUSS-FFMS33-SFFFFFNN
% 0.13/10.47 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/10.47 % Starting SubtermCWHack with 31s (1) cores
% 0.13/10.47 % SubtermCWHack with pid 1046402 completed with status 0
% 0.13/10.47 % Result found by SubtermCWHack
% 0.13/10.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/10.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/10.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/10.47 % Search class: FGUNS-FFLS33-SFFFFFNN
% 0.13/10.47 % partial match(2): FGUSS-FFMS33-SFFFFFNN
% 0.13/10.47 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/10.47 % Starting SubtermCWHack with 31s (1) cores
% 0.13/10.47 % Preprocessing time : 0.003 s
% 0.13/10.47
% 0.13/10.47 % Proof found!
% 0.13/10.47 % SZS status Theorem
% 0.13/10.47 % SZS output start CNFRefutation
% See solution above
% 0.13/10.47 % Parsed axioms : 124
% 0.13/10.47 % Removed by relevancy pruning/SinE : 109
% 0.13/10.47 % Initial clauses : 52
% 0.13/10.47 % Removed in clause preprocessing : 0
% 0.13/10.47 % Initial clauses in saturation : 52
% 0.13/10.47 % Processed clauses : 80
% 0.13/10.47 % ...of these trivial : 1
% 0.13/10.47 % ...subsumed : 12
% 0.13/10.47 % ...remaining for further processing : 67
% 0.13/10.47 % Other redundant clauses eliminated : 0
% 0.13/10.47 % Clauses deleted for lack of memory : 0
% 0.13/10.47 % Backward-subsumed : 2
% 0.13/10.47 % Backward-rewritten : 3
% 0.13/10.47 % Generated clauses : 338
% 0.13/10.47 % ...of the previous two non-redundant : 337
% 0.13/10.47 % ...aggressively subsumed : 0
% 0.13/10.47 % Contextual simplify-reflections : 0
% 0.13/10.47 % Paramodulations : 338
% 0.13/10.47 % Factorizations : 0
% 0.13/10.47 % NegExts : 0
% 0.13/10.47 % Equation resolutions : 0
% 0.13/10.47 % Disequality decompositions : 0
% 0.13/10.47 % Total rewrite steps : 83
% 0.13/10.47 % ...of those cached : 74
% 0.13/10.47 % Propositional unsat checks : 0
% 0.13/10.47 % Propositional check models : 0
% 0.13/10.47 % Propositional check unsatisfiable : 0
% 0.13/10.47 % Propositional clauses : 0
% 0.13/10.47 % Propositional clauses after purity: 0
% 0.13/10.47 % Propositional unsat core size : 0
% 0.13/10.47 % Propositional preprocessing time : 0.000
% 0.13/10.47 % Propositional encoding time : 0.000
% 0.13/10.47 % Propositional solver time : 0.000
% 0.13/10.47 % Success case prop preproc time : 0.000
% 0.13/10.47 % Success case prop encoding time : 0.000
% 0.13/10.47 % Success case prop solver time : 0.000
% 0.13/10.47 % Current number of processed clauses : 62
% 0.13/10.47 % Positive orientable unit clauses : 5
% 0.13/10.47 % Positive unorientable unit clauses: 0
% 0.13/10.47 % Negative unit clauses : 0
% 0.13/10.47 % Non-unit-clauses : 57
% 0.13/10.47 % Current number of unprocessed clauses: 309
% 0.13/10.47 % ...number of literals in the above : 2028
% 0.13/10.47 % Current number of archived formulas : 0
% 0.13/10.47 % Current number of archived clauses : 5
% 0.13/10.47 % Clause-clause subsumption calls (NU) : 1657
% 0.13/10.47 % Rec. Clause-clause subsumption calls : 416
% 0.13/10.47 % Non-unit clause-clause subsumptions : 14
% 0.13/10.47 % Unit Clause-clause subsumption calls : 38
% 0.13/10.47 % Rewrite failures with RHS unbound : 0
% 0.13/10.47 % BW rewrite match attempts : 6
% 0.13/10.47 % BW rewrite match successes : 3
% 0.13/10.47 % Condensation attempts : 0
% 0.13/10.47 % Condensation successes : 0
% 0.13/10.47 % Termbank termtop insertions : 15629
% 0.13/10.47 % Search garbage collected termcells : 3631
% 0.13/10.47
% 0.13/10.47 % -------------------------------------------------
% 0.13/10.47 % User time : 0.019 s
% 0.13/10.47 % System time : 0.003 s
% 0.13/10.47 % Total time : 0.022 s
% 0.13/10.47 % Maximum resident set size: 4176 pages
% 0.13/10.47
% 0.13/10.47 % -------------------------------------------------
% 0.13/10.47 % User time : 0.029 s
% 0.13/10.47 % System time : 0.007 s
% 0.13/10.47 % Total time : 0.037 s
% 0.13/10.47 % Maximum resident set size: 5120 pages
% 0.13/10.47 % E exiting
%------------------------------------------------------------------------------