TSTP Solution File: PLA002-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n021.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 16:57:50 EDT 2022
% Result : Unsatisfiable 0.21s 0.45s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 41
% Number of leaves : 37
% Syntax : Number of formulae : 244 ( 27 unt; 0 def)
% Number of atoms : 651 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 826 ( 419 ~; 407 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 266 ( 34 sgn 81 !; 0 ?)
% 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,hypothesis,
! [X3] :
( ~ warm(X3)
| ~ at(d,X3)
| at(b,climb(b,X3))
| ~ situation(X3) ),
file('<stdin>',climb_mountain_d_to_b) ).
fof(c_0_1,hypothesis,
! [X3] :
( ~ warm(X3)
| ~ at(b,X3)
| at(d,climb(d,X3))
| ~ situation(X3) ),
file('<stdin>',climb_mountain_b_to_d) ).
fof(c_0_2,hypothesis,
! [X3] :
( ~ cold(X3)
| ~ at(c,X3)
| at(b,skate(b,X3))
| ~ situation(X3) ),
file('<stdin>',cross_river_c_to_b) ).
fof(c_0_3,hypothesis,
! [X3] :
( ~ cold(X3)
| ~ at(b,X3)
| at(c,skate(c,X3))
| ~ situation(X3) ),
file('<stdin>',cross_river_b_to_c) ).
fof(c_0_4,hypothesis,
! [X3] :
( ~ at(f,X3)
| at(d,go(d,X3))
| ~ situation(X3) ),
file('<stdin>',go_f_to_d) ).
fof(c_0_5,hypothesis,
! [X3] :
( ~ at(d,X3)
| at(f,go(f,X3))
| ~ situation(X3) ),
file('<stdin>',go_d_to_f) ).
fof(c_0_6,hypothesis,
! [X3] :
( ~ at(e,X3)
| at(c,go(c,X3))
| ~ situation(X3) ),
file('<stdin>',go_e_to_c) ).
fof(c_0_7,hypothesis,
! [X3] :
( ~ at(c,X3)
| at(e,go(e,X3))
| ~ situation(X3) ),
file('<stdin>',go_c_to_e) ).
fof(c_0_8,hypothesis,
! [X3] :
( ~ at(d,X3)
| at(c,go(c,X3))
| ~ situation(X3) ),
file('<stdin>',go_d_to_c) ).
fof(c_0_9,hypothesis,
! [X3] :
( ~ at(c,X3)
| at(d,go(d,X3))
| ~ situation(X3) ),
file('<stdin>',go_c_to_d) ).
fof(c_0_10,hypothesis,
! [X3] :
( ~ at(b,X3)
| at(a,drive(a,X3))
| ~ situation(X3) ),
file('<stdin>',drive_b_to_a) ).
fof(c_0_11,hypothesis,
! [X3] :
( ~ at(b,X3)
| at(a,walk(a,X3))
| ~ situation(X3) ),
file('<stdin>',walk_b_to_a) ).
fof(c_0_12,hypothesis,
! [X3] :
( ~ at(a,X3)
| at(b,drive(b,X3))
| ~ situation(X3) ),
file('<stdin>',drive_a_to_b) ).
fof(c_0_13,hypothesis,
! [X3] :
( ~ at(a,X3)
| at(b,walk(b,X3))
| ~ situation(X3) ),
file('<stdin>',walk_a_to_b) ).
fof(c_0_14,hypothesis,
! [X4,X3] :
( ~ situation(X3)
| situation(go(X4,X3)) ),
file('<stdin>',go_situation) ).
fof(c_0_15,hypothesis,
! [X4,X3] :
( ~ situation(X3)
| situation(skate(X4,X3)) ),
file('<stdin>',skate_situation) ).
fof(c_0_16,hypothesis,
! [X4,X3] :
( ~ situation(X3)
| situation(climb(X4,X3)) ),
file('<stdin>',climb_situation) ).
fof(c_0_17,hypothesis,
! [X4,X3] :
( ~ situation(X3)
| situation(drive(X4,X3)) ),
file('<stdin>',drive_situation) ).
fof(c_0_18,hypothesis,
! [X4,X3] :
( ~ situation(X3)
| situation(walk(X4,X3)) ),
file('<stdin>',walk_situation) ).
fof(c_0_19,negated_conjecture,
! [X5] :
( ~ at(a,X5)
| ~ situation(X5) ),
file('<stdin>',prove_you_can_get_to_a_in_a_situation) ).
fof(c_0_20,hypothesis,
! [X1,X2] :
( warm(X2)
| cold(X1)
| ~ situation(X2)
| ~ situation(X1) ),
file('<stdin>',warm_or_cold) ).
fof(c_0_21,hypothesis,
at(f,s0),
file('<stdin>',initial) ).
fof(c_0_22,hypothesis,
situation(s0),
file('<stdin>',initial_situation) ).
fof(c_0_23,hypothesis,
! [X3] :
( ~ warm(X3)
| ~ at(d,X3)
| at(b,climb(b,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_24,hypothesis,
! [X3] :
( ~ warm(X3)
| ~ at(b,X3)
| at(d,climb(d,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_25,hypothesis,
! [X3] :
( ~ cold(X3)
| ~ at(c,X3)
| at(b,skate(b,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_26,hypothesis,
! [X3] :
( ~ cold(X3)
| ~ at(b,X3)
| at(c,skate(c,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_27,hypothesis,
! [X3] :
( ~ at(f,X3)
| at(d,go(d,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_28,hypothesis,
! [X3] :
( ~ at(d,X3)
| at(f,go(f,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_29,hypothesis,
! [X3] :
( ~ at(e,X3)
| at(c,go(c,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_30,hypothesis,
! [X3] :
( ~ at(c,X3)
| at(e,go(e,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_31,hypothesis,
! [X3] :
( ~ at(d,X3)
| at(c,go(c,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_32,hypothesis,
! [X3] :
( ~ at(c,X3)
| at(d,go(d,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_33,hypothesis,
! [X3] :
( ~ at(b,X3)
| at(a,drive(a,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_34,hypothesis,
! [X3] :
( ~ at(b,X3)
| at(a,walk(a,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_35,hypothesis,
! [X3] :
( ~ at(a,X3)
| at(b,drive(b,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_36,hypothesis,
! [X3] :
( ~ at(a,X3)
| at(b,walk(b,X3))
| ~ situation(X3) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_37,hypothesis,
! [X4,X3] :
( ~ situation(X3)
| situation(go(X4,X3)) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_38,hypothesis,
! [X4,X3] :
( ~ situation(X3)
| situation(skate(X4,X3)) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_39,hypothesis,
! [X4,X3] :
( ~ situation(X3)
| situation(climb(X4,X3)) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_40,hypothesis,
! [X4,X3] :
( ~ situation(X3)
| situation(drive(X4,X3)) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_41,hypothesis,
! [X4,X3] :
( ~ situation(X3)
| situation(walk(X4,X3)) ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_42,negated_conjecture,
! [X5] :
( ~ at(a,X5)
| ~ situation(X5) ),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_43,hypothesis,
! [X1,X2] :
( warm(X2)
| cold(X1)
| ~ situation(X2)
| ~ situation(X1) ),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_44,hypothesis,
at(f,s0),
c_0_21 ).
fof(c_0_45,hypothesis,
situation(s0),
c_0_22 ).
fof(c_0_46,hypothesis,
! [X4] :
( ~ warm(X4)
| ~ at(d,X4)
| at(b,climb(b,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_47,hypothesis,
! [X4] :
( ~ warm(X4)
| ~ at(b,X4)
| at(d,climb(d,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_48,hypothesis,
! [X4] :
( ~ cold(X4)
| ~ at(c,X4)
| at(b,skate(b,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_49,hypothesis,
! [X4] :
( ~ cold(X4)
| ~ at(b,X4)
| at(c,skate(c,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_50,hypothesis,
! [X4] :
( ~ at(f,X4)
| at(d,go(d,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_51,hypothesis,
! [X4] :
( ~ at(d,X4)
| at(f,go(f,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_52,hypothesis,
! [X4] :
( ~ at(e,X4)
| at(c,go(c,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_53,hypothesis,
! [X4] :
( ~ at(c,X4)
| at(e,go(e,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_54,hypothesis,
! [X4] :
( ~ at(d,X4)
| at(c,go(c,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_55,hypothesis,
! [X4] :
( ~ at(c,X4)
| at(d,go(d,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_56,hypothesis,
! [X4] :
( ~ at(b,X4)
| at(a,drive(a,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_57,hypothesis,
! [X4] :
( ~ at(b,X4)
| at(a,walk(a,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_58,hypothesis,
! [X4] :
( ~ at(a,X4)
| at(b,drive(b,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_59,hypothesis,
! [X4] :
( ~ at(a,X4)
| at(b,walk(b,X4))
| ~ situation(X4) ),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_60,hypothesis,
! [X5,X6] :
( ~ situation(X6)
| situation(go(X5,X6)) ),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_61,hypothesis,
! [X5,X6] :
( ~ situation(X6)
| situation(skate(X5,X6)) ),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_62,hypothesis,
! [X5,X6] :
( ~ situation(X6)
| situation(climb(X5,X6)) ),
inference(variable_rename,[status(thm)],[c_0_39]) ).
fof(c_0_63,hypothesis,
! [X5,X6] :
( ~ situation(X6)
| situation(drive(X5,X6)) ),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_64,hypothesis,
! [X5,X6] :
( ~ situation(X6)
| situation(walk(X5,X6)) ),
inference(variable_rename,[status(thm)],[c_0_41]) ).
fof(c_0_65,negated_conjecture,
! [X6] :
( ~ at(a,X6)
| ~ situation(X6) ),
inference(variable_rename,[status(thm)],[c_0_42]) ).
fof(c_0_66,hypothesis,
! [X3,X4] :
( warm(X4)
| cold(X3)
| ~ situation(X4)
| ~ situation(X3) ),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_67,hypothesis,
at(f,s0),
c_0_44 ).
fof(c_0_68,hypothesis,
situation(s0),
c_0_45 ).
cnf(c_0_69,hypothesis,
( at(b,climb(b,X1))
| ~ situation(X1)
| ~ at(d,X1)
| ~ warm(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_70,hypothesis,
( at(d,climb(d,X1))
| ~ situation(X1)
| ~ at(b,X1)
| ~ warm(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_71,hypothesis,
( at(b,skate(b,X1))
| ~ situation(X1)
| ~ at(c,X1)
| ~ cold(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_72,hypothesis,
( at(c,skate(c,X1))
| ~ situation(X1)
| ~ at(b,X1)
| ~ cold(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_73,hypothesis,
( at(d,go(d,X1))
| ~ situation(X1)
| ~ at(f,X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_74,hypothesis,
( at(f,go(f,X1))
| ~ situation(X1)
| ~ at(d,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_75,hypothesis,
( at(c,go(c,X1))
| ~ situation(X1)
| ~ at(e,X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_76,hypothesis,
( at(e,go(e,X1))
| ~ situation(X1)
| ~ at(c,X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_77,hypothesis,
( at(c,go(c,X1))
| ~ situation(X1)
| ~ at(d,X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_78,hypothesis,
( at(d,go(d,X1))
| ~ situation(X1)
| ~ at(c,X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_79,hypothesis,
( at(a,drive(a,X1))
| ~ situation(X1)
| ~ at(b,X1) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_80,hypothesis,
( at(a,walk(a,X1))
| ~ situation(X1)
| ~ at(b,X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_81,hypothesis,
( at(b,drive(b,X1))
| ~ situation(X1)
| ~ at(a,X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_82,hypothesis,
( at(b,walk(b,X1))
| ~ situation(X1)
| ~ at(a,X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_83,hypothesis,
( situation(go(X1,X2))
| ~ situation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_84,hypothesis,
( situation(skate(X1,X2))
| ~ situation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_85,hypothesis,
( situation(climb(X1,X2))
| ~ situation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_86,hypothesis,
( situation(drive(X1,X2))
| ~ situation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_87,hypothesis,
( situation(walk(X1,X2))
| ~ situation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_88,negated_conjecture,
( ~ situation(X1)
| ~ at(a,X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_89,hypothesis,
( cold(X1)
| warm(X2)
| ~ situation(X1)
| ~ situation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_90,hypothesis,
at(f,s0),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_91,hypothesis,
situation(s0),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_92,hypothesis,
( at(b,climb(b,X1))
| ~ situation(X1)
| ~ at(d,X1)
| ~ warm(X1) ),
c_0_69,
[final] ).
cnf(c_0_93,hypothesis,
( at(d,climb(d,X1))
| ~ situation(X1)
| ~ at(b,X1)
| ~ warm(X1) ),
c_0_70,
[final] ).
cnf(c_0_94,hypothesis,
( at(b,skate(b,X1))
| ~ situation(X1)
| ~ at(c,X1)
| ~ cold(X1) ),
c_0_71,
[final] ).
cnf(c_0_95,hypothesis,
( at(c,skate(c,X1))
| ~ situation(X1)
| ~ at(b,X1)
| ~ cold(X1) ),
c_0_72,
[final] ).
cnf(c_0_96,hypothesis,
( at(d,go(d,X1))
| ~ situation(X1)
| ~ at(f,X1) ),
c_0_73,
[final] ).
cnf(c_0_97,hypothesis,
( at(f,go(f,X1))
| ~ situation(X1)
| ~ at(d,X1) ),
c_0_74,
[final] ).
cnf(c_0_98,hypothesis,
( at(c,go(c,X1))
| ~ situation(X1)
| ~ at(e,X1) ),
c_0_75,
[final] ).
cnf(c_0_99,hypothesis,
( at(e,go(e,X1))
| ~ situation(X1)
| ~ at(c,X1) ),
c_0_76,
[final] ).
cnf(c_0_100,hypothesis,
( at(c,go(c,X1))
| ~ situation(X1)
| ~ at(d,X1) ),
c_0_77,
[final] ).
cnf(c_0_101,hypothesis,
( at(d,go(d,X1))
| ~ situation(X1)
| ~ at(c,X1) ),
c_0_78,
[final] ).
cnf(c_0_102,hypothesis,
( at(a,drive(a,X1))
| ~ situation(X1)
| ~ at(b,X1) ),
c_0_79,
[final] ).
cnf(c_0_103,hypothesis,
( at(a,walk(a,X1))
| ~ situation(X1)
| ~ at(b,X1) ),
c_0_80,
[final] ).
cnf(c_0_104,hypothesis,
( at(b,drive(b,X1))
| ~ situation(X1)
| ~ at(a,X1) ),
c_0_81,
[final] ).
cnf(c_0_105,hypothesis,
( at(b,walk(b,X1))
| ~ situation(X1)
| ~ at(a,X1) ),
c_0_82,
[final] ).
cnf(c_0_106,hypothesis,
( situation(go(X1,X2))
| ~ situation(X2) ),
c_0_83,
[final] ).
cnf(c_0_107,hypothesis,
( situation(skate(X1,X2))
| ~ situation(X2) ),
c_0_84,
[final] ).
cnf(c_0_108,hypothesis,
( situation(climb(X1,X2))
| ~ situation(X2) ),
c_0_85,
[final] ).
cnf(c_0_109,hypothesis,
( situation(drive(X1,X2))
| ~ situation(X2) ),
c_0_86,
[final] ).
cnf(c_0_110,hypothesis,
( situation(walk(X1,X2))
| ~ situation(X2) ),
c_0_87,
[final] ).
cnf(c_0_111,negated_conjecture,
( ~ situation(X1)
| ~ at(a,X1) ),
c_0_88,
[final] ).
cnf(c_0_112,hypothesis,
( cold(X1)
| warm(X2)
| ~ situation(X1)
| ~ situation(X2) ),
c_0_89,
[final] ).
cnf(c_0_113,hypothesis,
at(f,s0),
c_0_90,
[final] ).
cnf(c_0_114,hypothesis,
situation(s0),
c_0_91,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_10,plain,
( ~ at(b,X0)
| at(a,drive(a,X0))
| ~ situation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_102) ).
cnf(c_69,plain,
( ~ at(b,X0)
| at(a,drive(a,X0))
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_111,plain,
( ~ at(b,X0)
| at(a,drive(a,X0))
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_136,plain,
( ~ at(b,X0)
| at(a,drive(a,X0))
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_111]) ).
cnf(c_421,plain,
( ~ at(b,X0)
| at(a,drive(a,X0))
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_136]) ).
cnf(c_467,plain,
( ~ at(b,X0)
| at(a,drive(a,X0))
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_421]) ).
cnf(c_12,plain,
( at(b,drive(b,X0))
| ~ at(a,X0)
| ~ situation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_104) ).
cnf(c_19,negated_conjecture,
( ~ at(a,X0)
| ~ situation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_111) ).
cnf(c_48,plain,
( ~ at(a,X0)
| ~ situation(X0) ),
inference(global_propositional_subsumption,[status(thm)],[c_12,c_19]) ).
cnf(c_73,plain,
( ~ at(a,X0)
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_118,plain,
( ~ at(a,X0)
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_129,plain,
( ~ at(a,X0)
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_118]) ).
cnf(c_429,plain,
( ~ at(a,X0)
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_129]) ).
cnf(c_483,plain,
( ~ at(a,X0)
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_429]) ).
cnf(c_565,plain,
( ~ at(b,X0)
| ~ situation(drive(a,X0))
| ~ situation(X0) ),
inference(resolution,[status(thm)],[c_467,c_483]) ).
cnf(c_566,plain,
( ~ at(b,X0)
| ~ situation(drive(a,X0))
| ~ situation(X0) ),
inference(rewriting,[status(thm)],[c_565]) ).
cnf(c_17,plain,
( situation(drive(X0,X1))
| ~ situation(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_109) ).
cnf(c_83,plain,
( situation(drive(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_116,plain,
( situation(drive(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_131,plain,
( situation(drive(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_116]) ).
cnf(c_426,plain,
( situation(drive(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_131]) ).
cnf(c_477,plain,
( situation(drive(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_426]) ).
cnf(c_610,plain,
( ~ at(b,X0)
| ~ situation(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_566,c_477]) ).
cnf(c_611,plain,
( ~ at(b,X0)
| ~ situation(X0) ),
inference(rewriting,[status(thm)],[c_610]) ).
cnf(c_20,plain,
( ~ situation(X0)
| ~ situation(X1)
| warm(X0)
| cold(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_112) ).
cnf(c_44,plain,
( sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split,sP0_iProver_split])],[c_20]) ).
cnf(c_91,plain,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_123,plain,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_91]) ).
cnf(c_124,plain,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_123]) ).
cnf(c_43,plain,
( ~ situation(X0)
| warm(X0)
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_20]) ).
cnf(c_89,plain,
( ~ situation(X0)
| warm(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_122,plain,
( ~ situation(X0)
| warm(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_89]) ).
cnf(c_125,plain,
( ~ situation(X0)
| warm(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_122]) ).
cnf(c_147,plain,
( ~ situation(X0)
| warm(X0)
| sP0_iProver_split ),
inference(resolution,[status(thm)],[c_124,c_125]) ).
cnf(c_158,plain,
( ~ situation(X0)
| warm(X0)
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_147]) ).
cnf(c_162,plain,
( ~ situation(X0)
| warm(X0)
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_158]) ).
cnf(c_0,plain,
( at(b,climb(b,X0))
| ~ at(d,X0)
| ~ situation(X0)
| ~ warm(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_92) ).
cnf(c_49,plain,
( at(b,climb(b,X0))
| ~ at(d,X0)
| ~ situation(X0)
| ~ warm(X0) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_101,plain,
( at(b,climb(b,X0))
| ~ at(d,X0)
| ~ situation(X0)
| ~ warm(X0) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_146,plain,
( at(b,climb(b,X0))
| ~ at(d,X0)
| ~ situation(X0)
| ~ warm(X0) ),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_282,plain,
( at(b,climb(b,X0))
| ~ at(d,X0)
| ~ situation(X0)
| sP0_iProver_split ),
inference(resolution,[status(thm)],[c_162,c_146]) ).
cnf(c_296,plain,
( at(b,climb(b,X0))
| ~ at(d,X0)
| ~ situation(X0)
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_282]) ).
cnf(c_306,plain,
( at(b,climb(b,X0))
| ~ at(d,X0)
| ~ situation(X0)
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_296]) ).
cnf(c_432,plain,
( at(b,climb(b,X0))
| ~ at(d,X0)
| ~ situation(X0)
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_306]) ).
cnf(c_489,plain,
( at(b,climb(b,X0))
| ~ at(d,X0)
| ~ situation(X0)
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_432]) ).
cnf(c_614,plain,
( ~ at(d,X0)
| ~ situation(climb(b,X0))
| ~ situation(X0)
| sP0_iProver_split ),
inference(resolution,[status(thm)],[c_611,c_489]) ).
cnf(c_615,plain,
( ~ at(d,X0)
| ~ situation(climb(b,X0))
| ~ situation(X0)
| sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_614]) ).
cnf(c_16,plain,
( situation(climb(X0,X1))
| ~ situation(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_108) ).
cnf(c_81,plain,
( situation(climb(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_115,plain,
( situation(climb(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_81]) ).
cnf(c_132,plain,
( situation(climb(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_115]) ).
cnf(c_425,plain,
( situation(climb(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_132]) ).
cnf(c_475,plain,
( situation(climb(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_425]) ).
cnf(c_622,plain,
( ~ at(d,X0)
| ~ situation(X0)
| sP0_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_615,c_475]) ).
cnf(c_623,plain,
( ~ at(d,X0)
| ~ situation(X0)
| sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_622]) ).
cnf(c_4,plain,
( at(d,go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_96) ).
cnf(c_57,plain,
( at(d,go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_105,plain,
( at(d,go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_142,plain,
( at(d,go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_105]) ).
cnf(c_415,plain,
( at(d,go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_142]) ).
cnf(c_455,plain,
( at(d,go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_415]) ).
cnf(c_628,plain,
( ~ at(f,X0)
| ~ situation(go(d,X0))
| ~ situation(X0)
| sP0_iProver_split ),
inference(resolution,[status(thm)],[c_623,c_455]) ).
cnf(c_629,plain,
( ~ at(f,X0)
| ~ situation(go(d,X0))
| ~ situation(X0)
| sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_628]) ).
cnf(c_14,plain,
( situation(go(X0,X1))
| ~ situation(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_106) ).
cnf(c_77,plain,
( situation(go(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_113,plain,
( situation(go(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_134,plain,
( situation(go(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_113]) ).
cnf(c_423,plain,
( situation(go(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_134]) ).
cnf(c_471,plain,
( situation(go(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_423]) ).
cnf(c_635,plain,
( ~ at(f,X0)
| ~ situation(X0)
| sP0_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_629,c_471]) ).
cnf(c_636,plain,
( ~ at(f,X0)
| ~ situation(X0)
| sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_635]) ).
cnf(c_21,plain,
at(f,s0),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_113) ).
cnf(c_93,plain,
at(f,s0),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_119,plain,
at(f,s0),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_128,plain,
at(f,s0),
inference(copy,[status(esa)],[c_119]) ).
cnf(c_430,plain,
at(f,s0),
inference(copy,[status(esa)],[c_128]) ).
cnf(c_485,plain,
at(f,s0),
inference(copy,[status(esa)],[c_430]) ).
cnf(c_642,plain,
( ~ situation(s0)
| sP0_iProver_split ),
inference(resolution,[status(thm)],[c_636,c_485]) ).
cnf(c_643,plain,
( ~ situation(s0)
| sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_642]) ).
cnf(c_22,plain,
situation(s0),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_114) ).
cnf(c_95,plain,
situation(s0),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_120,plain,
situation(s0),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_127,plain,
situation(s0),
inference(copy,[status(esa)],[c_120]) ).
cnf(c_431,plain,
situation(s0),
inference(copy,[status(esa)],[c_127]) ).
cnf(c_487,plain,
situation(s0),
inference(copy,[status(esa)],[c_431]) ).
cnf(c_646,plain,
sP0_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_643,c_487]) ).
cnf(c_647,plain,
sP0_iProver_split,
inference(rewriting,[status(thm)],[c_646]) ).
cnf(c_42,plain,
( ~ situation(X0)
| cold(X0)
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_20]) ).
cnf(c_87,plain,
( ~ situation(X0)
| cold(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_121,plain,
( ~ situation(X0)
| cold(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_126,plain,
( ~ situation(X0)
| cold(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_121]) ).
cnf(c_2,plain,
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ situation(X0)
| ~ cold(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_94) ).
cnf(c_53,plain,
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ situation(X0)
| ~ cold(X0) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_103,plain,
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ situation(X0)
| ~ cold(X0) ),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_144,plain,
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ situation(X0)
| ~ cold(X0) ),
inference(copy,[status(esa)],[c_103]) ).
cnf(c_196,plain,
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ situation(X0)
| ~ sP0_iProver_split ),
inference(resolution,[status(thm)],[c_126,c_144]) ).
cnf(c_210,plain,
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ situation(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_196]) ).
cnf(c_220,plain,
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ situation(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_210]) ).
cnf(c_434,plain,
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ situation(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_220]) ).
cnf(c_493,plain,
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ situation(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_434]) ).
cnf(c_649,plain,
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ situation(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_647,c_493]) ).
cnf(c_650,plain,
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ situation(X0) ),
inference(rewriting,[status(thm)],[c_649]) ).
cnf(c_657,plain,
( ~ at(c,X0)
| ~ situation(skate(b,X0))
| ~ situation(X0) ),
inference(resolution,[status(thm)],[c_650,c_611]) ).
cnf(c_658,plain,
( ~ at(c,X0)
| ~ situation(skate(b,X0))
| ~ situation(X0) ),
inference(rewriting,[status(thm)],[c_657]) ).
cnf(c_15,plain,
( situation(skate(X0,X1))
| ~ situation(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_107) ).
cnf(c_79,plain,
( situation(skate(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_114,plain,
( situation(skate(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_133,plain,
( situation(skate(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_114]) ).
cnf(c_424,plain,
( situation(skate(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_133]) ).
cnf(c_473,plain,
( situation(skate(X0,X1))
| ~ situation(X1) ),
inference(copy,[status(esa)],[c_424]) ).
cnf(c_662,plain,
( ~ at(c,X0)
| ~ situation(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_658,c_473]) ).
cnf(c_663,plain,
( ~ at(c,X0)
| ~ situation(X0) ),
inference(rewriting,[status(thm)],[c_662]) ).
cnf(c_8,plain,
( ~ at(d,X0)
| at(c,go(c,X0))
| ~ situation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_60df05.p',c_0_100) ).
cnf(c_65,plain,
( ~ at(d,X0)
| at(c,go(c,X0))
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_109,plain,
( ~ at(d,X0)
| at(c,go(c,X0))
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_138,plain,
( ~ at(d,X0)
| at(c,go(c,X0))
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_109]) ).
cnf(c_419,plain,
( ~ at(d,X0)
| at(c,go(c,X0))
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_138]) ).
cnf(c_463,plain,
( ~ at(d,X0)
| at(c,go(c,X0))
| ~ situation(X0) ),
inference(copy,[status(esa)],[c_419]) ).
cnf(c_666,plain,
( ~ at(d,X0)
| ~ situation(go(c,X0))
| ~ situation(X0) ),
inference(resolution,[status(thm)],[c_663,c_463]) ).
cnf(c_669,plain,
( ~ at(d,X0)
| ~ situation(go(c,X0))
| ~ situation(X0) ),
inference(rewriting,[status(thm)],[c_666]) ).
cnf(c_680,plain,
( ~ at(d,X0)
| ~ situation(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_669,c_471]) ).
cnf(c_681,plain,
( ~ at(d,X0)
| ~ situation(X0) ),
inference(rewriting,[status(thm)],[c_680]) ).
cnf(c_684,plain,
( ~ at(f,X0)
| ~ situation(go(d,X0))
| ~ situation(X0) ),
inference(resolution,[status(thm)],[c_681,c_455]) ).
cnf(c_685,plain,
( ~ at(f,X0)
| ~ situation(go(d,X0))
| ~ situation(X0) ),
inference(rewriting,[status(thm)],[c_684]) ).
cnf(c_689,plain,
( ~ at(f,X0)
| ~ situation(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_685,c_471]) ).
cnf(c_690,plain,
( ~ at(f,X0)
| ~ situation(X0) ),
inference(rewriting,[status(thm)],[c_689]) ).
cnf(c_693,plain,
~ situation(s0),
inference(resolution,[status(thm)],[c_690,c_485]) ).
cnf(c_694,plain,
~ situation(s0),
inference(rewriting,[status(thm)],[c_693]) ).
cnf(c_696,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_694,c_487]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue May 31 19:32:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.12/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.41 % Orientation found
% 0.12/0.41 % 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/sandbox/tmp/iprover_proof_6c32a4.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_60df05.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_36e8a0 | grep -v "SZS"
% 0.21/0.43
% 0.21/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ iProver source info
% 0.21/0.43
% 0.21/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.43 % git: non_committed_changes: true
% 0.21/0.43 % git: last_make_outside_of_git: true
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_6c32a4.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44 % ------ Parsing...% successful
% 0.21/0.44
% 0.21/0.44 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 % ------ Problem Properties
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % EPR false
% 0.21/0.44 % Horn false
% 0.21/0.44 % Has equality false
% 0.21/0.44
% 0.21/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % % ------ Current options:
% 0.21/0.44
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.45 % --prep_res_sim true
% 0.21/0.45 % --prep_upred true
% 0.21/0.45 % --res_sim_input true
% 0.21/0.45 % --clause_weak_htbl true
% 0.21/0.45 % --gc_record_bc_elim false
% 0.21/0.45 % --symbol_type_check false
% 0.21/0.45 % --clausify_out false
% 0.21/0.45 % --large_theory_mode false
% 0.21/0.45 % --prep_sem_filter none
% 0.21/0.45 % --prep_sem_filter_out false
% 0.21/0.45 % --preprocessed_out false
% 0.21/0.45 % --sub_typing false
% 0.21/0.45 % --brand_transform false
% 0.21/0.45 % --pure_diseq_elim true
% 0.21/0.45 % --min_unsat_core false
% 0.21/0.45 % --pred_elim true
% 0.21/0.45 % --add_important_lit false
% 0.21/0.45 % --soft_assumptions false
% 0.21/0.45 % --reset_solvers false
% 0.21/0.45 % --bc_imp_inh []
% 0.21/0.45 % --conj_cone_tolerance 1.5
% 0.21/0.45 % --prolific_symb_bound 500
% 0.21/0.45 % --lt_threshold 2000
% 0.21/0.45
% 0.21/0.45 % ------ SAT Options
% 0.21/0.45
% 0.21/0.45 % --sat_mode false
% 0.21/0.45 % --sat_fm_restart_options ""
% 0.21/0.45 % --sat_gr_def false
% 0.21/0.45 % --sat_epr_types true
% 0.21/0.45 % --sat_non_cyclic_types false
% 0.21/0.45 % --sat_finite_models false
% 0.21/0.45 % --sat_fm_lemmas false
% 0.21/0.45 % --sat_fm_prep false
% 0.21/0.45 % --sat_fm_uc_incr true
% 0.21/0.45 % --sat_out_model small
% 0.21/0.45 % --sat_out_clauses false
% 0.21/0.45
% 0.21/0.45 % ------ QBF Options
% 0.21/0.45
% 0.21/0.45 % --qbf_mode false
% 0.21/0.45 % --qbf_elim_univ true
% 0.21/0.45 % --qbf_sk_in true
% 0.21/0.45 % --qbf_pred_elim true
% 0.21/0.45 % --qbf_split 32
% 0.21/0.45
% 0.21/0.45 % ------ BMC1 Options
% 0.21/0.45
% 0.21/0.45 % --bmc1_incremental false
% 0.21/0.45 % --bmc1_axioms reachable_all
% 0.21/0.45 % --bmc1_min_bound 0
% 0.21/0.45 % --bmc1_max_bound -1
% 0.21/0.45 % --bmc1_max_bound_default -1
% 0.21/0.45 % --bmc1_symbol_reachability true
% 0.21/0.45 % --bmc1_property_lemmas false
% 0.21/0.45 % --bmc1_k_induction false
% 0.21/0.45 % --bmc1_non_equiv_states false
% 0.21/0.45 % --bmc1_deadlock false
% 0.21/0.45 % --bmc1_ucm false
% 0.21/0.45 % --bmc1_add_unsat_core none
% 0.21/0.45 % --bmc1_unsat_core_children false
% 0.21/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.45 % --bmc1_out_stat full
% 0.21/0.45 % --bmc1_ground_init false
% 0.21/0.45 % --bmc1_pre_inst_next_state false
% 0.21/0.45 % --bmc1_pre_inst_state false
% 0.21/0.45 % --bmc1_pre_inst_reach_state false
% 0.21/0.45 % --bmc1_out_unsat_core false
% 0.21/0.45 % --bmc1_aig_witness_out false
% 0.21/0.45 % --bmc1_verbose false
% 0.21/0.45 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 0.21/0.45 % --inst_prop_sim_new false
% 0.21/0.45 % --inst_orphan_elimination true
% 0.21/0.45 % --inst_learning_loop_flag true
% 0.21/0.45 % --inst_learning_start 3000
% 0.21/0.45 % --inst_learning_factor 2
% 0.21/0.45 % --inst_start_prop_sim_after_learn 3
% 0.21/0.45 % --inst_sel_renew solver
% 0.21/0.45 % --inst_lit_activity_flag true
% 0.21/0.45 % --inst_out_proof true
% 0.21/0.45
% 0.21/0.45 % ------ Resolution Options
% 0.21/0.45
% 0.21/0.45 % --resolution_flag true
% 0.21/0.45 % --res_lit_sel kbo_max
% 0.21/0.45 % --res_to_prop_solver none
% 0.21/0.45 % --res_prop_simpl_new false
% 0.21/0.45 % --res_prop_simpl_given false
% 0.21/0.45 % --res_passive_queue_type priority_queues
% 0.21/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.45 % --res_passive_queues_freq [15;5]
% 0.21/0.45 % --res_forward_subs full
% 0.21/0.45 % --res_backward_subs full
% 0.21/0.45 % --res_forward_subs_resolution true
% 0.21/0.45 % --res_backward_subs_resolution true
% 0.21/0.45 % --res_orphan_elimination false
% 0.21/0.45 % --res_time_limit 1000.
% 0.21/0.45 % --res_out_proof true
% 0.21/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_6c32a4.s
% 0.21/0.45 % --modulo true
% 0.21/0.45
% 0.21/0.45 % ------ Combination Options
% 0.21/0.45
% 0.21/0.45 % --comb_res_mult 1000
% 0.21/0.45 % --comb_inst_mult 300
% 0.21/0.45 % ------
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % ------ Proving...
% 0.21/0.45 %
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % Resolution empty clause
% 0.21/0.45
% 0.21/0.45 % ------ Statistics
% 0.21/0.45
% 0.21/0.45 % ------ General
% 0.21/0.45
% 0.21/0.45 % num_of_input_clauses: 23
% 0.21/0.45 % num_of_input_neg_conjectures: 1
% 0.21/0.45 % num_of_splits: 2
% 0.21/0.45 % num_of_split_atoms: 2
% 0.21/0.45 % num_of_sem_filtered_clauses: 0
% 0.21/0.45 % num_of_subtypes: 0
% 0.21/0.45 % monotx_restored_types: 0
% 0.21/0.45 % sat_num_of_epr_types: 0
% 0.21/0.45 % sat_num_of_non_cyclic_types: 0
% 0.21/0.45 % sat_guarded_non_collapsed_types: 0
% 0.21/0.45 % is_epr: 0
% 0.21/0.45 % is_horn: 0
% 0.21/0.45 % has_eq: 0
% 0.21/0.45 % num_pure_diseq_elim: 0
% 0.21/0.45 % simp_replaced_by: 0
% 0.21/0.45 % res_preprocessed: 26
% 0.21/0.45 % prep_upred: 0
% 0.21/0.45 % prep_unflattend: 0
% 0.21/0.45 % pred_elim_cands: 4
% 0.21/0.45 % pred_elim: 3
% 0.21/0.45 % pred_elim_cl: 3
% 0.21/0.45 % pred_elim_cycles: 6
% 0.21/0.45 % forced_gc_time: 0
% 0.21/0.45 % gc_basic_clause_elim: 0
% 0.21/0.45 % parsing_time: 0.001
% 0.21/0.45 % sem_filter_time: 0.
% 0.21/0.45 % pred_elim_time: 0.005
% 0.21/0.45 % out_proof_time: 0.003
% 0.21/0.45 % monotx_time: 0.
% 0.21/0.45 % subtype_inf_time: 0.
% 0.21/0.45 % unif_index_cands_time: 0.
% 0.21/0.45 % unif_index_add_time: 0.
% 0.21/0.45 % total_time: 0.036
% 0.21/0.45 % num_of_symbols: 43
% 0.21/0.45 % num_of_terms: 174
% 0.21/0.45
% 0.21/0.45 % ------ Propositional Solver
% 0.21/0.45
% 0.21/0.45 % prop_solver_calls: 1
% 0.21/0.45 % prop_fast_solver_calls: 193
% 0.21/0.45 % prop_num_of_clauses: 67
% 0.21/0.45 % prop_preprocess_simplified: 334
% 0.21/0.45 % prop_fo_subsumed: 2
% 0.21/0.45 % prop_solver_time: 0.
% 0.21/0.45 % prop_fast_solver_time: 0.
% 0.21/0.45 % prop_unsat_core_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ QBF
% 0.21/0.45
% 0.21/0.45 % qbf_q_res: 0
% 0.21/0.45 % qbf_num_tautologies: 0
% 0.21/0.45 % qbf_prep_cycles: 0
% 0.21/0.45
% 0.21/0.45 % ------ BMC1
% 0.21/0.45
% 0.21/0.45 % bmc1_current_bound: -1
% 0.21/0.45 % bmc1_last_solved_bound: -1
% 0.21/0.45 % bmc1_unsat_core_size: -1
% 0.21/0.45 % bmc1_unsat_core_parents_size: -1
% 0.21/0.45 % bmc1_merge_next_fun: 0
% 0.21/0.45 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation
% 0.21/0.45
% 0.21/0.45 % inst_num_of_clauses: 20
% 0.21/0.45 % inst_num_in_passive: 0
% 0.21/0.45 % inst_num_in_active: 0
% 0.21/0.45 % inst_num_in_unprocessed: 20
% 0.21/0.45 % inst_num_of_loops: 0
% 0.21/0.45 % inst_num_of_learning_restarts: 0
% 0.21/0.45 % inst_num_moves_active_passive: 0
% 0.21/0.45 % inst_lit_activity: 0
% 0.21/0.45 % inst_lit_activity_moves: 0
% 0.21/0.45 % inst_num_tautologies: 0
% 0.21/0.45 % inst_num_prop_implied: 0
% 0.21/0.45 % inst_num_existing_simplified: 0
% 0.21/0.45 % inst_num_eq_res_simplified: 0
% 0.21/0.45 % inst_num_child_elim: 0
% 0.21/0.45 % inst_num_of_dismatching_blockings: 0
% 0.21/0.45 % inst_num_of_non_proper_insts: 0
% 0.21/0.45 % inst_num_of_duplicates: 0
% 0.21/0.45 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.45 % inst_dismatching_checking_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ Resolution
% 0.21/0.45
% 0.21/0.45 % res_num_of_clauses: 17
% 0.21/0.45 % res_num_in_passive: 3
% 0.21/0.45 % res_num_in_active: 14
% 0.21/0.45 % res_num_of_loops: 31
% 0.21/0.45 % res_forward_subset_subsumed: 0
% 0.21/0.45 % res_backward_subset_subsumed: 1
% 0.21/0.45 % res_forward_subsumed: 1
% 0.21/0.45 % res_backward_subsumed: 14
% 0.21/0.45 % res_forward_subsumption_resolution: 9
% 0.21/0.45 % res_backward_subsumption_resolution: 1
% 0.21/0.45 % res_clause_to_clause_subsumption: 33
% 0.21/0.45 % res_orphan_elimination: 0
% 0.21/0.45 % res_tautology_del: 0
% 0.21/0.45 % res_num_eq_res_simplified: 0
% 0.21/0.45 % res_num_sel_changes: 0
% 0.21/0.45 % res_moves_from_active_to_pass: 0
% 0.21/0.45
% 0.21/0.45 % Status Unsatisfiable
% 0.21/0.45 % SZS status Unsatisfiable
% 0.21/0.45 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------