TSTP Solution File: PUZ008-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : PUZ008-3 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 13:19:26 EDT 2023
% Result : Unsatisfiable 0.48s 1.16s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 12
% Syntax : Number of clauses : 76 ( 12 unt; 0 nHn; 71 RR)
% Number of literals : 256 ( 0 equ; 191 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
safe(n0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_missionaries_is_safe) ).
cnf(c_50,plain,
( ~ greater_or_equal(X0,X1)
| safe(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe) ).
cnf(c_51,plain,
greater_or_equal(X0,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',great_eq_base) ).
cnf(c_52,plain,
( ~ greater_or_equal(X0,X1)
| greater_or_equal(s(X0),s(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',great_eq_recursive) ).
cnf(c_54,plain,
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3))))
| ~ safe(X0,s(X1))
| ~ safe(X2,X3)
| achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cannibal_east_to_west) ).
cnf(c_55,plain,
( ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3)))
| ~ safe(X2,s(s(X3)))
| ~ safe(X0,X1)
| achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3))))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',two_cannibals_west_to_east) ).
cnf(c_58,plain,
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(X3)))
| ~ safe(s(X0),X1)
| ~ safe(X2,X3)
| achievable(west(m(s(X0)),c(X1)),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',missionary_east_to_west) ).
cnf(c_59,plain,
( ~ achievable(west(m(s(s(X0))),c(X1)),boatonwest,east(m(X2),c(X3)))
| ~ safe(s(s(X2)),X3)
| ~ safe(X0,X1)
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(s(X2))),c(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',two_missionaries_west_to_east) ).
cnf(c_61,plain,
( ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| ~ safe(s(X2),s(X3))
| ~ safe(X0,X1)
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',missionary_and_cannibal_west_to_east) ).
cnf(c_62,plain,
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
| ~ safe(s(X0),s(X1))
| ~ safe(X2,X3)
| achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',missionary_and_cannibal_east_to_west) ).
cnf(c_63,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',start_on_west_bank) ).
cnf(c_64,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_can_get_to_east_bank) ).
cnf(c_176,plain,
( ~ greater_or_equal(X0,n0)
| greater_or_equal(s(X0),s(n0)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_200,plain,
( ~ greater_or_equal(s(X0),s(n0))
| safe(s(X0),s(n0)) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_286,plain,
( ~ greater_or_equal(s(s(X0)),s(n0))
| safe(s(s(X0)),s(n0)) ),
inference(instantiation,[status(thm)],[c_200]) ).
cnf(c_392,plain,
safe(X0,n0),
inference(superposition,[status(thm)],[c_51,c_50]) ).
cnf(c_396,plain,
safe(X0,n0),
inference(superposition,[status(thm)],[c_51,c_50]) ).
cnf(c_397,plain,
( ~ greater_or_equal(s(X0),n0)
| greater_or_equal(s(s(X0)),s(n0)) ),
inference(instantiation,[status(thm)],[c_176]) ).
cnf(c_463,plain,
( ~ greater_or_equal(X0,X1)
| safe(s(X0),s(X1)) ),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_471,plain,
( ~ greater_or_equal(X0,X1)
| safe(s(X0),s(X1)) ),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_570,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
inference(superposition,[status(thm)],[c_63,c_55]) ).
cnf(c_571,plain,
( ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_570,c_49]) ).
cnf(c_582,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
inference(superposition,[status(thm)],[c_63,c_55]) ).
cnf(c_583,plain,
( ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_582,c_49]) ).
cnf(c_590,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
inference(superposition,[status(thm)],[c_571,c_54]) ).
cnf(c_591,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_590,c_49]) ).
cnf(c_599,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
inference(superposition,[status(thm)],[c_583,c_54]) ).
cnf(c_600,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_599,c_49]) ).
cnf(c_631,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(s(n0))))
| achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
inference(superposition,[status(thm)],[c_591,c_55]) ).
cnf(c_639,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_631,c_49,c_392]) ).
cnf(c_650,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(s(n0))))
| achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
inference(superposition,[status(thm)],[c_600,c_55]) ).
cnf(c_658,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_650,c_49,c_396]) ).
cnf(c_669,plain,
greater_or_equal(s(X0),n0),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_686,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
inference(superposition,[status(thm)],[c_639,c_54]) ).
cnf(c_687,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_686,c_49]) ).
cnf(c_697,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
inference(superposition,[status(thm)],[c_658,c_54]) ).
cnf(c_698,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_697,c_49]) ).
cnf(c_801,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(superposition,[status(thm)],[c_687,c_59]) ).
cnf(c_825,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(superposition,[status(thm)],[c_698,c_59]) ).
cnf(c_1552,plain,
( ~ greater_or_equal(s(s(s(n0))),s(n0))
| safe(s(s(s(n0))),s(n0)) ),
inference(instantiation,[status(thm)],[c_286]) ).
cnf(c_2211,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
inference(superposition,[status(thm)],[c_801,c_62]) ).
cnf(c_2253,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
inference(superposition,[status(thm)],[c_825,c_62]) ).
cnf(c_2322,plain,
( ~ greater_or_equal(s(s(n0)),n0)
| greater_or_equal(s(s(s(n0))),s(n0)) ),
inference(instantiation,[status(thm)],[c_397]) ).
cnf(c_2323,plain,
( ~ greater_or_equal(s(n0),s(n0))
| safe(s(n0),s(n0)) ),
inference(instantiation,[status(thm)],[c_200]) ).
cnf(c_2683,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
inference(superposition,[status(thm)],[c_2211,c_59]) ).
cnf(c_2685,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2683,c_49]) ).
cnf(c_2737,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
inference(superposition,[status(thm)],[c_2253,c_59]) ).
cnf(c_2739,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2737,c_49]) ).
cnf(c_2943,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(s(n0))))
| ~ safe(s(n0),s(n0))
| achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
inference(superposition,[status(thm)],[c_2685,c_54]) ).
cnf(c_2948,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2943,c_49,c_392]) ).
cnf(c_2964,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(s(n0))))
| ~ safe(s(n0),s(n0))
| achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
inference(superposition,[status(thm)],[c_2739,c_54]) ).
cnf(c_2969,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2964,c_49,c_396]) ).
cnf(c_3209,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,s(n0))
| achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
inference(superposition,[status(thm)],[c_2948,c_55]) ).
cnf(c_3210,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3209,c_49]) ).
cnf(c_3228,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,s(n0))
| achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
inference(superposition,[status(thm)],[c_2969,c_55]) ).
cnf(c_3229,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3228,c_49]) ).
cnf(c_3291,plain,
greater_or_equal(s(s(n0)),n0),
inference(instantiation,[status(thm)],[c_669]) ).
cnf(c_3293,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
inference(global_subsumption_just,[status(thm)],[c_3210,c_1552,c_2322,c_3210,c_3291]) ).
cnf(c_3305,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(superposition,[status(thm)],[c_3293,c_58]) ).
cnf(c_3335,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
inference(global_subsumption_just,[status(thm)],[c_3229,c_1552,c_2322,c_3210,c_3291]) ).
cnf(c_3347,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(superposition,[status(thm)],[c_3335,c_58]) ).
cnf(c_3379,plain,
greater_or_equal(s(n0),n0),
inference(instantiation,[status(thm)],[c_669]) ).
cnf(c_3447,plain,
( ~ greater_or_equal(s(n0),n0)
| greater_or_equal(s(s(n0)),s(n0)) ),
inference(instantiation,[status(thm)],[c_397]) ).
cnf(c_3598,plain,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,n0)
| achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
inference(superposition,[status(thm)],[c_3305,c_61]) ).
cnf(c_3600,plain,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3598,c_64,c_49]) ).
cnf(c_3621,plain,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,n0)
| achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
inference(superposition,[status(thm)],[c_3347,c_61]) ).
cnf(c_3623,plain,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3621,c_64,c_49]) ).
cnf(c_3642,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ greater_or_equal(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(superposition,[status(thm)],[c_463,c_3600]) ).
cnf(c_3655,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ greater_or_equal(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(superposition,[status(thm)],[c_471,c_3623]) ).
cnf(c_3664,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ greater_or_equal(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3642,c_50]) ).
cnf(c_3668,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ safe(s(n0),s(n0)) ),
inference(superposition,[status(thm)],[c_463,c_3664]) ).
cnf(c_3672,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(global_subsumption_just,[status(thm)],[c_3655,c_3379,c_3447,c_3668]) ).
cnf(c_3678,plain,
( ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(superposition,[status(thm)],[c_52,c_3672]) ).
cnf(c_3690,plain,
~ greater_or_equal(s(n0),s(n0)),
inference(global_subsumption_just,[status(thm)],[c_3678,c_2323,c_3678]) ).
cnf(c_3692,plain,
~ greater_or_equal(n0,n0),
inference(superposition,[status(thm)],[c_52,c_3690]) ).
cnf(c_3693,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3692,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : PUZ008-3 : TPTP v8.1.2. Released v1.2.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Aug 26 22:30:50 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.16 % SZS status Started for theBenchmark.p
% 0.48/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.16
% 0.48/1.16 ------ iProver source info
% 0.48/1.16
% 0.48/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.16 git: non_committed_changes: false
% 0.48/1.16 git: last_make_outside_of_git: false
% 0.48/1.16
% 0.48/1.16 ------ Parsing...successful
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.16 ------ Proving...
% 0.48/1.16 ------ Problem Properties
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 clauses 16
% 0.48/1.16 conjectures 1
% 0.48/1.16 EPR 3
% 0.48/1.16 Horn 16
% 0.48/1.16 unary 4
% 0.48/1.16 binary 2
% 0.48/1.16 lits 48
% 0.48/1.16 lits eq 0
% 0.48/1.16 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 0.48/1.16 fd_cond 0
% 0.48/1.16 fd_pseudo_cond 0
% 0.48/1.16 AC symbols 0
% 0.48/1.16
% 0.48/1.16 ------ Schedule dynamic 5 is on
% 0.48/1.16
% 0.48/1.16 ------ no equalities: superposition off
% 0.48/1.16
% 0.48/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------
% 0.48/1.16 Current options:
% 0.48/1.16 ------
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Proving...
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.16
% 0.48/1.17
%------------------------------------------------------------------------------