TSTP Solution File: PUZ047+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : PUZ047+1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n027.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 : 600s
% DateTime : Mon Jul 18 18:13:53 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Cycle in a tree)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0,conjecture,
( ( p(south,south,south,south,start)
& ! [X1] :
( p(south,north,south,north,X1)
=> p(north,north,south,north,go_alone(X1)) )
& ! [X2] :
( p(north,north,south,north,X2)
=> p(south,north,south,north,go_alone(X2)) )
& ! [X3] :
( p(south,south,north,south,X3)
=> p(north,south,north,south,go_alone(X3)) )
& ! [X4] :
( p(north,south,north,south,X4)
=> p(south,south,north,south,go_alone(X4)) )
& ! [X5] :
( p(south,south,south,north,X5)
=> p(north,north,south,north,take_wolf(X5)) )
& ! [X6] :
( p(north,north,south,north,X6)
=> p(south,south,south,north,take_wolf(X6)) )
& ! [X7] :
( p(south,south,north,south,X7)
=> p(north,north,north,south,take_wolf(X7)) )
& ! [X8] :
( p(north,north,north,south,X8)
=> p(south,south,north,south,take_wolf(X8)) )
& ! [X9,X10,X11] :
( p(south,X9,south,X10,X11)
=> p(north,X9,north,X10,take_goat(X11)) )
& ! [X12,X13,X14] :
( p(north,X12,north,X13,X14)
=> p(south,X12,south,X13,take_goat(X14)) )
& ! [X15] :
( p(south,north,south,south,X15)
=> p(north,north,south,north,take_cabbage(X15)) )
& ! [X16] :
( p(north,north,south,north,X16)
=> p(south,north,south,south,take_cabbage(X16)) )
& ! [X17] :
( p(south,south,north,south,X17)
=> p(north,south,north,north,take_cabbage(X17)) )
& ! [X18] :
( p(north,south,north,north,X18)
=> p(south,south,north,south,take_cabbage(X18)) ) )
=> ? [X19] : p(north,north,north,north,X19) ),
file('<stdin>',thm100) ).
fof(c_0_1,plain,
( epred1_0
<=> ( p(south,south,south,south,start)
& ! [X1] :
( p(south,north,south,north,X1)
=> p(north,north,south,north,go_alone(X1)) )
& ! [X2] :
( p(north,north,south,north,X2)
=> p(south,north,south,north,go_alone(X2)) )
& ! [X3] :
( p(south,south,north,south,X3)
=> p(north,south,north,south,go_alone(X3)) )
& ! [X4] :
( p(north,south,north,south,X4)
=> p(south,south,north,south,go_alone(X4)) )
& ! [X5] :
( p(south,south,south,north,X5)
=> p(north,north,south,north,take_wolf(X5)) )
& ! [X6] :
( p(north,north,south,north,X6)
=> p(south,south,south,north,take_wolf(X6)) )
& ! [X7] :
( p(south,south,north,south,X7)
=> p(north,north,north,south,take_wolf(X7)) )
& ! [X8] :
( p(north,north,north,south,X8)
=> p(south,south,north,south,take_wolf(X8)) )
& ! [X9,X10,X11] :
( p(south,X9,south,X10,X11)
=> p(north,X9,north,X10,take_goat(X11)) )
& ! [X12,X13,X14] :
( p(north,X12,north,X13,X14)
=> p(south,X12,south,X13,take_goat(X14)) )
& ! [X15] :
( p(south,north,south,south,X15)
=> p(north,north,south,north,take_cabbage(X15)) )
& ! [X16] :
( p(north,north,south,north,X16)
=> p(south,north,south,south,take_cabbage(X16)) )
& ! [X17] :
( p(south,south,north,south,X17)
=> p(north,south,north,north,take_cabbage(X17)) )
& ! [X18] :
( p(north,south,north,north,X18)
=> p(south,south,north,south,take_cabbage(X18)) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred1_0
=> ( p(south,south,south,south,start)
& ! [X1] :
( p(south,north,south,north,X1)
=> p(north,north,south,north,go_alone(X1)) )
& ! [X2] :
( p(north,north,south,north,X2)
=> p(south,north,south,north,go_alone(X2)) )
& ! [X3] :
( p(south,south,north,south,X3)
=> p(north,south,north,south,go_alone(X3)) )
& ! [X4] :
( p(north,south,north,south,X4)
=> p(south,south,north,south,go_alone(X4)) )
& ! [X5] :
( p(south,south,south,north,X5)
=> p(north,north,south,north,take_wolf(X5)) )
& ! [X6] :
( p(north,north,south,north,X6)
=> p(south,south,south,north,take_wolf(X6)) )
& ! [X7] :
( p(south,south,north,south,X7)
=> p(north,north,north,south,take_wolf(X7)) )
& ! [X8] :
( p(north,north,north,south,X8)
=> p(south,south,north,south,take_wolf(X8)) )
& ! [X9,X10,X11] :
( p(south,X9,south,X10,X11)
=> p(north,X9,north,X10,take_goat(X11)) )
& ! [X12,X13,X14] :
( p(north,X12,north,X13,X14)
=> p(south,X12,south,X13,take_goat(X14)) )
& ! [X15] :
( p(south,north,south,south,X15)
=> p(north,north,south,north,take_cabbage(X15)) )
& ! [X16] :
( p(north,north,south,north,X16)
=> p(south,north,south,south,take_cabbage(X16)) )
& ! [X17] :
( p(south,south,north,south,X17)
=> p(north,south,north,north,take_cabbage(X17)) )
& ! [X18] :
( p(north,south,north,north,X18)
=> p(south,south,north,south,take_cabbage(X18)) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( epred1_0
=> ? [X19] : p(north,north,north,north,X19) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[c_0_0]),c_0_1,theory(equality,[symmetry])]) ).
fof(c_0_4,plain,
! [X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36] :
( ( p(south,south,south,south,start)
| ~ epred1_0 )
& ( ~ p(south,north,south,north,X19)
| p(north,north,south,north,go_alone(X19))
| ~ epred1_0 )
& ( ~ p(north,north,south,north,X20)
| p(south,north,south,north,go_alone(X20))
| ~ epred1_0 )
& ( ~ p(south,south,north,south,X21)
| p(north,south,north,south,go_alone(X21))
| ~ epred1_0 )
& ( ~ p(north,south,north,south,X22)
| p(south,south,north,south,go_alone(X22))
| ~ epred1_0 )
& ( ~ p(south,south,south,north,X23)
| p(north,north,south,north,take_wolf(X23))
| ~ epred1_0 )
& ( ~ p(north,north,south,north,X24)
| p(south,south,south,north,take_wolf(X24))
| ~ epred1_0 )
& ( ~ p(south,south,north,south,X25)
| p(north,north,north,south,take_wolf(X25))
| ~ epred1_0 )
& ( ~ p(north,north,north,south,X26)
| p(south,south,north,south,take_wolf(X26))
| ~ epred1_0 )
& ( ~ p(south,X27,south,X28,X29)
| p(north,X27,north,X28,take_goat(X29))
| ~ epred1_0 )
& ( ~ p(north,X30,north,X31,X32)
| p(south,X30,south,X31,take_goat(X32))
| ~ epred1_0 )
& ( ~ p(south,north,south,south,X33)
| p(north,north,south,north,take_cabbage(X33))
| ~ epred1_0 )
& ( ~ p(north,north,south,north,X34)
| p(south,north,south,south,take_cabbage(X34))
| ~ epred1_0 )
& ( ~ p(south,south,north,south,X35)
| p(north,south,north,north,take_cabbage(X35))
| ~ epred1_0 )
& ( ~ p(north,south,north,north,X36)
| p(south,south,north,south,take_cabbage(X36))
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_5,negated_conjecture,
! [X20] :
( epred1_0
& ~ p(north,north,north,north,X20) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( p(north,X1,north,X2,take_goat(X3))
| ~ epred1_0
| ~ p(south,X1,south,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( p(south,X1,south,X2,take_goat(X3))
| ~ epred1_0
| ~ p(north,X1,north,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( p(north,north,south,north,go_alone(X1))
| ~ epred1_0
| ~ p(south,north,south,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( p(south,north,south,north,go_alone(X1))
| ~ epred1_0
| ~ p(north,north,south,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( p(north,south,north,south,go_alone(X1))
| ~ epred1_0
| ~ p(south,south,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( p(south,south,north,south,go_alone(X1))
| ~ epred1_0
| ~ p(north,south,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( p(north,north,south,north,take_wolf(X1))
| ~ epred1_0
| ~ p(south,south,south,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,plain,
( p(south,south,south,north,take_wolf(X1))
| ~ epred1_0
| ~ p(north,north,south,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( p(north,north,north,south,take_wolf(X1))
| ~ epred1_0
| ~ p(south,south,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,plain,
( p(south,south,north,south,take_wolf(X1))
| ~ epred1_0
| ~ p(north,north,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( p(north,north,south,north,take_cabbage(X1))
| ~ epred1_0
| ~ p(south,north,south,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,plain,
( p(south,north,south,south,take_cabbage(X1))
| ~ epred1_0
| ~ p(north,north,south,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,plain,
( p(north,south,north,north,take_cabbage(X1))
| ~ epred1_0
| ~ p(south,south,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,plain,
( p(south,south,north,south,take_cabbage(X1))
| ~ epred1_0
| ~ p(north,south,north,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,negated_conjecture,
~ p(north,north,north,north,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,plain,
( p(south,south,south,south,start)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,plain,
( p(north,X1,north,X2,take_goat(X3))
| ~ epred1_0
| ~ p(south,X1,south,X2,X3) ),
c_0_6,
[final] ).
cnf(c_0_24,plain,
( p(south,X1,south,X2,take_goat(X3))
| ~ epred1_0
| ~ p(north,X1,north,X2,X3) ),
c_0_7,
[final] ).
cnf(c_0_25,plain,
( p(north,north,south,north,go_alone(X1))
| ~ epred1_0
| ~ p(south,north,south,north,X1) ),
c_0_8,
[final] ).
cnf(c_0_26,plain,
( p(south,north,south,north,go_alone(X1))
| ~ epred1_0
| ~ p(north,north,south,north,X1) ),
c_0_9,
[final] ).
cnf(c_0_27,plain,
( p(north,south,north,south,go_alone(X1))
| ~ epred1_0
| ~ p(south,south,north,south,X1) ),
c_0_10,
[final] ).
cnf(c_0_28,plain,
( p(south,south,north,south,go_alone(X1))
| ~ epred1_0
| ~ p(north,south,north,south,X1) ),
c_0_11,
[final] ).
cnf(c_0_29,plain,
( p(north,north,south,north,take_wolf(X1))
| ~ epred1_0
| ~ p(south,south,south,north,X1) ),
c_0_12,
[final] ).
cnf(c_0_30,plain,
( p(south,south,south,north,take_wolf(X1))
| ~ epred1_0
| ~ p(north,north,south,north,X1) ),
c_0_13,
[final] ).
cnf(c_0_31,plain,
( p(north,north,north,south,take_wolf(X1))
| ~ epred1_0
| ~ p(south,south,north,south,X1) ),
c_0_14,
[final] ).
cnf(c_0_32,plain,
( p(south,south,north,south,take_wolf(X1))
| ~ epred1_0
| ~ p(north,north,north,south,X1) ),
c_0_15,
[final] ).
cnf(c_0_33,plain,
( p(north,north,south,north,take_cabbage(X1))
| ~ epred1_0
| ~ p(south,north,south,south,X1) ),
c_0_16,
[final] ).
cnf(c_0_34,plain,
( p(south,north,south,south,take_cabbage(X1))
| ~ epred1_0
| ~ p(north,north,south,north,X1) ),
c_0_17,
[final] ).
cnf(c_0_35,plain,
( p(north,south,north,north,take_cabbage(X1))
| ~ epred1_0
| ~ p(south,south,north,south,X1) ),
c_0_18,
[final] ).
cnf(c_0_36,plain,
( p(south,south,north,south,take_cabbage(X1))
| ~ epred1_0
| ~ p(north,south,north,north,X1) ),
c_0_19,
[final] ).
cnf(c_0_37,negated_conjecture,
~ p(north,north,north,north,X1),
c_0_20,
[final] ).
cnf(c_0_38,plain,
( p(south,south,south,south,start)
| ~ epred1_0 ),
c_0_21,
[final] ).
cnf(c_0_39,negated_conjecture,
epred1_0,
c_0_22,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_0,plain,
( p(north,X0,north,X1,take_goat(X2))
| ~ p(south,X0,south,X1,X2)
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_868bc5.p',c_0_23) ).
cnf(c_57,plain,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(global_propositional_subsumption,[status(thm)],[c_0,c_57]) ).
cnf(c_59,plain,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_113,plain,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_142,plain,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(copy,[status(esa)],[c_113]) ).
cnf(c_183,plain,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(copy,[status(esa)],[c_142]) ).
cnf(c_269,plain,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(copy,[status(esa)],[c_183]) ).
cnf(c_270,plain,
( p(north,X0,north,X1,take_goat(X2))
| ~ p(south,X0,south,X1,X2) ),
inference(rewriting,[status(thm)],[c_269]) ).
cnf(c_15,negated_conjecture,
~ p(north,north,north,north,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_868bc5.p',c_0_37) ).
cnf(c_89,negated_conjecture,
~ p(north,north,north,north,X0),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_97,negated_conjecture,
~ p(north,north,north,north,X0),
inference(copy,[status(esa)],[c_89]) ).
cnf(c_158,negated_conjecture,
~ p(north,north,north,north,X0),
inference(copy,[status(esa)],[c_97]) ).
cnf(c_176,negated_conjecture,
~ p(north,north,north,north,X0),
inference(copy,[status(esa)],[c_158]) ).
cnf(c_255,negated_conjecture,
~ p(north,north,north,north,X0),
inference(copy,[status(esa)],[c_176]) ).
cnf(c_345,plain,
~ p(south,north,south,north,X0),
inference(resolution,[status(thm)],[c_270,c_255]) ).
cnf(c_346,plain,
~ p(south,north,south,north,X0),
inference(rewriting,[status(thm)],[c_345]) ).
cnf(c_3,plain,
( ~ p(north,north,south,north,X0)
| p(south,north,south,north,go_alone(X0))
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_868bc5.p',c_0_26) ).
cnf(c_52,plain,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
inference(global_propositional_subsumption,[status(thm)],[c_3,c_52]) ).
cnf(c_65,plain,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_110,plain,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_145,plain,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
inference(copy,[status(esa)],[c_110]) ).
cnf(c_180,plain,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
inference(copy,[status(esa)],[c_145]) ).
cnf(c_263,plain,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
inference(copy,[status(esa)],[c_180]) ).
cnf(c_264,plain,
( ~ p(north,north,south,north,X0)
| p(south,north,south,north,go_alone(X0)) ),
inference(rewriting,[status(thm)],[c_263]) ).
cnf(c_349,plain,
~ p(north,north,south,north,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_346,c_264]) ).
cnf(c_350,plain,
~ p(north,north,south,north,X0),
inference(rewriting,[status(thm)],[c_349]) ).
cnf(c_6,plain,
( p(north,north,south,north,take_wolf(X0))
| ~ p(south,south,south,north,X0)
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_868bc5.p',c_0_29) ).
cnf(c_46,plain,
( ~ p(south,south,south,north,X0)
| p(north,north,south,north,take_wolf(X0)) ),
inference(global_propositional_subsumption,[status(thm)],[c_6,c_46]) ).
cnf(c_71,plain,
( ~ p(south,south,south,north,X0)
| p(north,north,south,north,take_wolf(X0)) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_72,plain,
( p(north,north,south,north,take_wolf(X0))
| ~ p(south,south,south,north,X0) ),
inference(rewriting,[status(thm)],[c_71]) ).
cnf(c_120,plain,
( p(north,north,south,north,take_wolf(X0))
| ~ p(south,south,south,north,X0) ),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_135,plain,
( p(north,north,south,north,take_wolf(X0))
| ~ p(south,south,south,north,X0) ),
inference(copy,[status(esa)],[c_120]) ).
cnf(c_161,plain,
( p(north,north,south,north,take_wolf(X0))
| ~ p(south,south,south,north,X0) ),
inference(copy,[status(esa)],[c_135]) ).
cnf(c_225,plain,
( p(north,north,south,north,take_wolf(X0))
| ~ p(south,south,south,north,X0) ),
inference(copy,[status(esa)],[c_161]) ).
cnf(c_356,plain,
~ p(south,south,south,north,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_350,c_225]) ).
cnf(c_357,plain,
~ p(south,south,south,north,X0),
inference(rewriting,[status(thm)],[c_356]) ).
cnf(c_1,plain,
( ~ p(north,X0,north,X1,X2)
| p(south,X0,south,X1,take_goat(X2))
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_868bc5.p',c_0_24) ).
cnf(c_56,plain,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
inference(global_propositional_subsumption,[status(thm)],[c_1,c_56]) ).
cnf(c_61,plain,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_112,plain,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_143,plain,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
inference(copy,[status(esa)],[c_112]) ).
cnf(c_182,plain,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
inference(copy,[status(esa)],[c_143]) ).
cnf(c_267,plain,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
inference(copy,[status(esa)],[c_182]) ).
cnf(c_268,plain,
( ~ p(north,X0,north,X1,X2)
| p(south,X0,south,X1,take_goat(X2)) ),
inference(rewriting,[status(thm)],[c_267]) ).
cnf(c_361,plain,
~ p(north,south,north,north,X0),
inference(resolution,[status(thm)],[c_357,c_268]) ).
cnf(c_362,plain,
~ p(north,south,north,north,X0),
inference(rewriting,[status(thm)],[c_361]) ).
cnf(c_12,plain,
( p(north,south,north,north,take_cabbage(X0))
| ~ p(south,south,north,south,X0)
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_868bc5.p',c_0_35) ).
cnf(c_34,plain,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(global_propositional_subsumption,[status(thm)],[c_12,c_34]) ).
cnf(c_83,plain,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_101,plain,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_154,plain,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_162,plain,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(copy,[status(esa)],[c_154]) ).
cnf(c_227,plain,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(copy,[status(esa)],[c_162]) ).
cnf(c_228,plain,
( p(north,south,north,north,take_cabbage(X0))
| ~ p(south,south,north,south,X0) ),
inference(rewriting,[status(thm)],[c_227]) ).
cnf(c_369,plain,
~ p(south,south,north,south,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_362,c_228]) ).
cnf(c_370,plain,
~ p(south,south,north,south,X0),
inference(rewriting,[status(thm)],[c_369]) ).
cnf(c_5,plain,
( ~ p(north,south,north,south,X0)
| p(south,south,north,south,go_alone(X0))
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_868bc5.p',c_0_28) ).
cnf(c_48,plain,
( p(south,south,north,south,go_alone(X0))
| ~ p(north,south,north,south,X0) ),
inference(global_propositional_subsumption,[status(thm)],[c_5,c_48]) ).
cnf(c_69,plain,
( p(south,south,north,south,go_alone(X0))
| ~ p(north,south,north,south,X0) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_70,plain,
( ~ p(north,south,north,south,X0)
| p(south,south,north,south,go_alone(X0)) ),
inference(rewriting,[status(thm)],[c_69]) ).
cnf(c_119,plain,
( ~ p(north,south,north,south,X0)
| p(south,south,north,south,go_alone(X0)) ),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_136,plain,
( ~ p(north,south,north,south,X0)
| p(south,south,north,south,go_alone(X0)) ),
inference(copy,[status(esa)],[c_119]) ).
cnf(c_160,plain,
( ~ p(north,south,north,south,X0)
| p(south,south,north,south,go_alone(X0)) ),
inference(copy,[status(esa)],[c_136]) ).
cnf(c_223,plain,
( ~ p(north,south,north,south,X0)
| p(south,south,north,south,go_alone(X0)) ),
inference(copy,[status(esa)],[c_160]) ).
cnf(c_381,plain,
~ p(north,south,north,south,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_370,c_223]) ).
cnf(c_382,plain,
~ p(north,south,north,south,X0),
inference(rewriting,[status(thm)],[c_381]) ).
cnf(c_385,plain,
~ p(south,south,south,south,X0),
inference(resolution,[status(thm)],[c_382,c_270]) ).
cnf(c_386,plain,
~ p(south,south,south,south,X0),
inference(rewriting,[status(thm)],[c_385]) ).
cnf(c_14,plain,
( p(south,south,south,south,start)
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_868bc5.p',c_0_38) ).
cnf(c_16,negated_conjecture,
epred1_0,
file('/export/starexec/sandbox2/tmp/iprover_modulo_868bc5.p',c_0_39) ).
cnf(c_31,plain,
p(south,south,south,south,start),
inference(global_propositional_subsumption,[status(thm)],[c_14,c_16]) ).
cnf(c_87,plain,
p(south,south,south,south,start),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_99,plain,
p(south,south,south,south,start),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_156,plain,
p(south,south,south,south,start),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_188,plain,
p(south,south,south,south,start),
inference(copy,[status(esa)],[c_156]) ).
cnf(c_279,plain,
p(south,south,south,south,start),
inference(copy,[status(esa)],[c_188]) ).
cnf(c_389,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_386,c_279]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PUZ047+1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n027.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.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun May 29 01:26:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.13/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.39 % FOF problem with conjecture
% 0.13/0.39 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_379b35.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_868bc5.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_521c66 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_379b35.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn true
% 0.20/0.42 % Has equality false
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 0.20/0.42
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_379b35.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % Resolution empty clause
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 17
% 0.20/0.43 % num_of_input_neg_conjectures: 2
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 0
% 0.20/0.43 % is_horn: 1
% 0.20/0.43 % has_eq: 0
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 19
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.004
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.03
% 0.20/0.43 % num_of_symbols: 34
% 0.20/0.43 % num_of_terms: 111
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 1
% 0.20/0.43 % prop_fast_solver_calls: 108
% 0.20/0.43 % prop_num_of_clauses: 59
% 0.20/0.43 % prop_preprocess_simplified: 288
% 0.20/0.43 % prop_fo_subsumed: 15
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: 31
% 0.20/0.43 % inst_num_in_passive: 0
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 31
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: 28
% 0.20/0.43 % res_num_in_passive: 0
% 0.20/0.43 % res_num_in_active: 13
% 0.20/0.43 % res_num_of_loops: 26
% 0.20/0.43 % res_forward_subset_subsumed: 18
% 0.20/0.43 % res_backward_subset_subsumed: 4
% 0.20/0.43 % res_forward_subsumed: 0
% 0.20/0.43 % res_backward_subsumed: 2
% 0.20/0.43 % res_forward_subsumption_resolution: 0
% 0.20/0.43 % res_backward_subsumption_resolution: 7
% 0.20/0.43 % res_clause_to_clause_subsumption: 59
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 0
% 0.20/0.43 % res_num_eq_res_simplified: 0
% 0.20/0.43 % res_num_sel_changes: 0
% 0.20/0.43 % res_moves_from_active_to_pass: 0
% 0.20/0.43
% 0.20/0.43 % Status Unsatisfiable
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------