TSTP Solution File: PLA054_4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PLA054_4 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : Tue May 21 02:19:42 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of formulae : 54 ( 10 unt; 14 typ; 0 def)
% Number of atoms : 186 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 231 ( 85 ~; 79 |; 31 &)
% ( 1 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 21 ( 9 >; 12 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 119 ( 0 sgn 112 !; 7 ?; 71 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'$ki_world': $tType ).
tff(decl_22,type,
'$ki_local_world': '$ki_world' ).
tff(decl_23,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(decl_24,type,
d: $i ).
tff(decl_26,type,
o: $i ).
tff(decl_27,type,
h: ( '$ki_world' * $i ) > $o ).
tff(decl_28,type,
closed: ( '$ki_world' * $i ) > $o ).
tff(decl_29,type,
combo: ( '$ki_world' * $i * $i ) > $o ).
tff(decl_30,type,
open: ( '$ki_world' * $i ) > $o ).
tff(decl_31,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(decl_32,type,
epred1_3: ( $i * $i * '$ki_world' ) > $o ).
tff(decl_33,type,
esk1_0: '$ki_world' ).
tff(decl_34,type,
esk2_2: ( $i * $i ) > '$ki_world' ).
tff(decl_37,type,
esk5_3: ( '$ki_world' * $i * $i ) > $i ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X11] :
( '$ki_exists_in_world_$i'(X1,X11)
& ? [X7] :
( '$ki_exists_in_world_$i'(X1,X7)
& ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X1,X8)
=> ( combo(X8,d,X11)
& h(X8,X7) ) )
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X1,X8)
=> open(X8,d) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
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(ax1,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X5] :
( '$ki_exists_in_world_$i'(X1,X5)
=> ! [X6] :
( '$ki_exists_in_world_$i'(X1,X6)
=> ? [X7] :
( '$ki_exists_in_world_$i'(X1,X7)
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X1,X8)
=> ( ( closed(X8,X5)
& combo(X8,X5,X6)
& h(X8,X7) )
=> ! [X9: '$ki_world'] :
( '$ki_accessible'(X8,X9)
=> open(X9,X5) ) ) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X1,X8)
=> ( ( closed(X8,X5)
& ~ combo(X8,X5,X6)
& h(X8,o) )
=> ! [X9: '$ki_world'] :
( '$ki_accessible'(X8,X9)
=> closed(X9,X5) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
tff(ax2,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> closed(X1,d) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
tff(mrel_transitive,axiom,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world'] :
( ( '$ki_accessible'(X1,X2)
& '$ki_accessible'(X2,X3) )
=> '$ki_accessible'(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_transitive) ).
tff(mrel_reflexive,axiom,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(c_0_6,plain,
! [X1: '$ki_world',X6,X5] :
( epred1_3(X5,X6,X1)
<=> ? [X7] :
( '$ki_exists_in_world_$i'(X1,X7)
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X1,X8)
=> ( ( closed(X8,X5)
& combo(X8,X5,X6)
& h(X8,X7) )
=> ! [X9: '$ki_world'] :
( '$ki_accessible'(X8,X9)
=> open(X9,X5) ) ) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X1,X8)
=> ( ( closed(X8,X5)
& ~ combo(X8,X5,X6)
& h(X8,o) )
=> ! [X9: '$ki_world'] :
( '$ki_accessible'(X8,X9)
=> closed(X9,X5) ) ) ) ) ),
introduced(definition) ).
tff(c_0_7,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X11] :
( '$ki_exists_in_world_$i'(X1,X11)
& ? [X7] :
( '$ki_exists_in_world_$i'(X1,X7)
& ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X1,X8)
=> ( combo(X8,d,X11)
& h(X8,X7) ) )
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X1,X8)
=> open(X8,d) ) ) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_8,plain,
! [X1: '$ki_world',X6,X5] :
( epred1_3(X5,X6,X1)
=> ? [X7] :
( '$ki_exists_in_world_$i'(X1,X7)
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X1,X8)
=> ( ( closed(X8,X5)
& combo(X8,X5,X6)
& h(X8,X7) )
=> ! [X9: '$ki_world'] :
( '$ki_accessible'(X8,X9)
=> open(X9,X5) ) ) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X1,X8)
=> ( ( closed(X8,X5)
& ~ combo(X8,X5,X6)
& h(X8,o) )
=> ! [X9: '$ki_world'] :
( '$ki_accessible'(X8,X9)
=> closed(X9,X5) ) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_6]) ).
tff(c_0_9,negated_conjecture,
! [X13,X14,X15: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',esk1_0)
& ( combo(X15,d,X13)
| ~ '$ki_accessible'(esk1_0,X15)
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13) )
& ( h(X15,X14)
| ~ '$ki_accessible'(esk1_0,X15)
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13) )
& ( '$ki_accessible'(esk1_0,esk2_2(X13,X14))
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13) )
& ( ~ open(esk2_2(X13,X14),d)
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13) ) ),
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_7])])])])])]) ).
tff(c_0_10,plain,
! [X30: '$ki_world',X31] : '$ki_exists_in_world_$i'(X30,X31),
inference(variable_rename,[status(thm)],['$ki_exists_in_world_$i_const']) ).
tff(c_0_11,plain,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X5] :
( '$ki_exists_in_world_$i'(X1,X5)
=> ! [X6] :
( '$ki_exists_in_world_$i'(X1,X6)
=> epred1_3(X5,X6,X1) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax1]),c_0_6]) ).
tff(c_0_12,plain,
! [X34: '$ki_world',X35,X36,X38: '$ki_world',X39: '$ki_world',X40: '$ki_world',X41: '$ki_world'] :
( ( '$ki_exists_in_world_$i'(X34,esk5_3(X34,X35,X36))
| ~ epred1_3(X36,X35,X34) )
& ( ~ '$ki_accessible'(X34,X38)
| ~ closed(X38,X36)
| ~ combo(X38,X36,X35)
| ~ h(X38,esk5_3(X34,X35,X36))
| ~ '$ki_accessible'(X38,X39)
| open(X39,X36)
| ~ epred1_3(X36,X35,X34) )
& ( ~ '$ki_accessible'(X34,X40)
| ~ closed(X40,X36)
| combo(X40,X36,X35)
| ~ h(X40,o)
| ~ '$ki_accessible'(X40,X41)
| closed(X41,X36)
| ~ epred1_3(X36,X35,X34) ) ),
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)],[c_0_8])])])])])])]) ).
tcf(c_0_13,negated_conjecture,
! [X1: '$ki_world',X4,X5] :
( h(X1,X4)
| ~ '$ki_accessible'(esk1_0,X1)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4)
| ~ '$ki_exists_in_world_$i'(esk1_0,X5) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_14,plain,
! [X1: '$ki_world',X4] : '$ki_exists_in_world_$i'(X1,X4),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tff(c_0_15,plain,
! [X17: '$ki_world',X18,X19] :
( ~ '$ki_accessible'('$ki_local_world',X17)
| ~ '$ki_exists_in_world_$i'(X17,X18)
| ~ '$ki_exists_in_world_$i'(X17,X19)
| epred1_3(X18,X19,X17) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
tcf(c_0_16,plain,
! [X3: '$ki_world',X2: '$ki_world',X5,X4,X1: '$ki_world'] :
( open(X3,X4)
| ~ '$ki_accessible'(X1,X2)
| ~ closed(X2,X4)
| ~ combo(X2,X4,X5)
| ~ h(X2,esk5_3(X1,X5,X4))
| ~ '$ki_accessible'(X2,X3)
| ~ epred1_3(X4,X5,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_17,negated_conjecture,
! [X4,X1: '$ki_world'] :
( h(X1,X4)
| ~ '$ki_accessible'(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14])]) ).
tcf(c_0_18,plain,
! [X1: '$ki_world',X4,X5] :
( epred1_3(X4,X5,X1)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ '$ki_exists_in_world_$i'(X1,X5) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_19,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X5,X4,X3: '$ki_world'] :
( open(X1,X4)
| ~ epred1_3(X4,X5,X2)
| ~ combo(X3,X4,X5)
| ~ closed(X3,X4)
| ~ '$ki_accessible'(esk1_0,X3)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_accessible'(X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
tcf(c_0_20,plain,
! [X5,X4,X1: '$ki_world'] :
( epred1_3(X4,X5,X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_14]),c_0_14])]) ).
tcf(c_0_21,negated_conjecture,
! [X1: '$ki_world',X5,X4] :
( combo(X1,d,X4)
| ~ '$ki_accessible'(esk1_0,X1)
| ~ '$ki_exists_in_world_$i'(esk1_0,X5)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_22,negated_conjecture,
! [X1: '$ki_world',X5,X4,X3: '$ki_world',X2: '$ki_world'] :
( open(X1,X4)
| ~ combo(X2,X4,X5)
| ~ closed(X2,X4)
| ~ '$ki_accessible'(esk1_0,X2)
| ~ '$ki_accessible'('$ki_local_world',X3)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_accessible'(X3,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
tcf(c_0_23,negated_conjecture,
! [X4,X1: '$ki_world'] :
( combo(X1,d,X4)
| ~ '$ki_accessible'(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_14]),c_0_14])]) ).
tff(c_0_24,plain,
! [X22: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X22)
| closed(X22,d) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2])])]) ).
tff(c_0_25,plain,
! [X27: '$ki_world',X28: '$ki_world',X29: '$ki_world'] :
( ~ '$ki_accessible'(X27,X28)
| ~ '$ki_accessible'(X28,X29)
| '$ki_accessible'(X27,X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mrel_transitive])])]) ).
tcf(c_0_26,negated_conjecture,
! [X1: '$ki_world',X3: '$ki_world',X2: '$ki_world'] :
( open(X1,d)
| ~ closed(X2,d)
| ~ '$ki_accessible'(esk1_0,X2)
| ~ '$ki_accessible'('$ki_local_world',X3)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_accessible'(X3,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
tcf(c_0_27,plain,
! [X1: '$ki_world'] :
( closed(X1,d)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
tcf(c_0_28,plain,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
| ~ '$ki_accessible'(X1,X2)
| ~ '$ki_accessible'(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
tff(c_0_29,plain,
! [X26: '$ki_world'] : '$ki_accessible'(X26,X26),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
tcf(c_0_30,negated_conjecture,
! [X1: '$ki_world',X3: '$ki_world',X2: '$ki_world'] :
( open(X1,d)
| ~ '$ki_accessible'(esk1_0,X2)
| ~ '$ki_accessible'('$ki_local_world',X3)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_accessible'(X3,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
tcf(c_0_31,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
tcf(c_0_32,negated_conjecture,
! [X5,X4] :
( ~ open(esk2_2(X4,X5),d)
| ~ '$ki_exists_in_world_$i'(esk1_0,X5)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_33,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( open(X1,d)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'(esk1_0,X1)
| ~ '$ki_accessible'(X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
tcf(c_0_34,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_35,negated_conjecture,
! [X5,X4] :
( '$ki_accessible'(esk1_0,esk2_2(X4,X5))
| ~ '$ki_exists_in_world_$i'(esk1_0,X5)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_36,negated_conjecture,
! [X4,X5] : ~ open(esk2_2(X4,X5),d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_14]),c_0_14])]) ).
tcf(c_0_37,negated_conjecture,
! [X1: '$ki_world'] :
( open(X1,d)
| ~ '$ki_accessible'(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_34])]) ).
tcf(c_0_38,negated_conjecture,
! [X4,X5] : '$ki_accessible'(esk1_0,esk2_2(X4,X5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_14]),c_0_14])]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PLA054_4 : TPTP v8.2.0. Released v8.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat May 18 13:44:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # sh5l with pid 21051 completed with status 0
% 0.20/0.48 # Result found by sh5l
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48 # Search class: FGHNS-FFSF32-SFFFFFNN
% 0.20/0.48 # partial match(1): FGHSS-FFSF32-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # SAT001_MinMin_p005000_rr_RG with pid 21054 completed with status 0
% 0.20/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48 # Search class: FGHNS-FFSF32-SFFFFFNN
% 0.20/0.48 # partial match(1): FGHSS-FFSF32-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 21
% 0.20/0.48 # Removed by relevancy pruning/SinE : 11
% 0.20/0.48 # Initial clauses : 18
% 0.20/0.48 # Removed in clause preprocessing : 1
% 0.20/0.48 # Initial clauses in saturation : 17
% 0.20/0.48 # Processed clauses : 44
% 0.20/0.48 # ...of these trivial : 2
% 0.20/0.48 # ...subsumed : 2
% 0.20/0.48 # ...remaining for further processing : 40
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 2
% 0.20/0.48 # Backward-rewritten : 1
% 0.20/0.48 # Generated clauses : 25
% 0.20/0.48 # ...of the previous two non-redundant : 21
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 1
% 0.20/0.48 # Paramodulations : 25
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 21
% 0.20/0.48 # ...of those cached : 10
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 23
% 0.20/0.48 # Positive orientable unit clauses : 4
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 18
% 0.20/0.48 # Current number of unprocessed clauses: 8
% 0.20/0.48 # ...number of literals in the above : 35
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 17
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 165
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 67
% 0.20/0.48 # Non-unit clause-clause subsumptions : 5
% 0.20/0.48 # Unit Clause-clause subsumption calls : 0
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 3
% 0.20/0.48 # BW rewrite match successes : 1
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 2305
% 0.20/0.48 # Search garbage collected termcells : 411
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.008 s
% 0.20/0.48 # System time : 0.001 s
% 0.20/0.48 # Total time : 0.009 s
% 0.20/0.48 # Maximum resident set size: 1892 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.008 s
% 0.20/0.48 # System time : 0.004 s
% 0.20/0.48 # Total time : 0.013 s
% 0.20/0.48 # Maximum resident set size: 1720 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------