TSTP Solution File: PUZ060+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : PUZ060+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:49 EDT 2023
% Result : Theorem 0.74s 1.16s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 147 ( 0 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 171 ( 50 ~; 41 |; 64 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 99 ( 2 sgn; 68 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1,X2,X3,X4,X5] :
( ( ! [X7] :
( alive(X7)
=> ! [X6] : not_killed_by(X7,X6) )
& ! [X6] :
( eats(X2,X6)
=> eats(X3,X6) )
& alive(X2)
& eats(X2,X0)
& ! [X6] :
( ? [X7] :
( not_killed_by(X7,X6)
& eats(X7,X6) )
=> food(X6) )
& food(X5)
& food(X4)
& ! [X6] :
( food(X6)
=> likes(X1,X6) ) )
=> likes(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( ! [X7] :
( alive(X7)
=> ! [X6] : not_killed_by(X7,X6) )
& ! [X6] :
( eats(X2,X6)
=> eats(X3,X6) )
& alive(X2)
& eats(X2,X0)
& ! [X6] :
( ? [X7] :
( not_killed_by(X7,X6)
& eats(X7,X6) )
=> food(X6) )
& food(X5)
& food(X4)
& ! [X6] :
( food(X6)
=> likes(X1,X6) ) )
=> likes(X1,X0) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( ! [X6] :
( alive(X6)
=> ! [X7] : not_killed_by(X6,X7) )
& ! [X8] :
( eats(X2,X8)
=> eats(X3,X8) )
& alive(X2)
& eats(X2,X0)
& ! [X9] :
( ? [X10] :
( not_killed_by(X10,X9)
& eats(X10,X9) )
=> food(X9) )
& food(X5)
& food(X4)
& ! [X11] :
( food(X11)
=> likes(X1,X11) ) )
=> likes(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ likes(X1,X0)
& ! [X6] :
( ! [X7] : not_killed_by(X6,X7)
| ~ alive(X6) )
& ! [X8] :
( eats(X3,X8)
| ~ eats(X2,X8) )
& alive(X2)
& eats(X2,X0)
& ! [X9] :
( food(X9)
| ! [X10] :
( ~ not_killed_by(X10,X9)
| ~ eats(X10,X9) ) )
& food(X5)
& food(X4)
& ! [X11] :
( likes(X1,X11)
| ~ food(X11) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ likes(X1,X0)
& ! [X6] :
( ! [X7] : not_killed_by(X6,X7)
| ~ alive(X6) )
& ! [X8] :
( eats(X3,X8)
| ~ eats(X2,X8) )
& alive(X2)
& eats(X2,X0)
& ! [X9] :
( food(X9)
| ! [X10] :
( ~ not_killed_by(X10,X9)
| ~ eats(X10,X9) ) )
& food(X5)
& food(X4)
& ! [X11] :
( likes(X1,X11)
| ~ food(X11) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( ~ likes(X1,X0)
& ! [X6] :
( ! [X7] : not_killed_by(X6,X7)
| ~ alive(X6) )
& ! [X8] :
( eats(X3,X8)
| ~ eats(X2,X8) )
& alive(X2)
& eats(X2,X0)
& ! [X9] :
( food(X9)
| ! [X10] :
( ~ not_killed_by(X10,X9)
| ~ eats(X10,X9) ) )
& food(X5)
& food(X4)
& ! [X11] :
( likes(X1,X11)
| ~ food(X11) ) )
=> ( ~ likes(sK1,sK0)
& ! [X6] :
( ! [X7] : not_killed_by(X6,X7)
| ~ alive(X6) )
& ! [X8] :
( eats(sK3,X8)
| ~ eats(sK2,X8) )
& alive(sK2)
& eats(sK2,sK0)
& ! [X9] :
( food(X9)
| ! [X10] :
( ~ not_killed_by(X10,X9)
| ~ eats(X10,X9) ) )
& food(sK5)
& food(sK4)
& ! [X11] :
( likes(sK1,X11)
| ~ food(X11) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ~ likes(sK1,sK0)
& ! [X6] :
( ! [X7] : not_killed_by(X6,X7)
| ~ alive(X6) )
& ! [X8] :
( eats(sK3,X8)
| ~ eats(sK2,X8) )
& alive(sK2)
& eats(sK2,sK0)
& ! [X9] :
( food(X9)
| ! [X10] :
( ~ not_killed_by(X10,X9)
| ~ eats(X10,X9) ) )
& food(sK5)
& food(sK4)
& ! [X11] :
( likes(sK1,X11)
| ~ food(X11) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f5,f6]) ).
fof(f8,plain,
! [X11] :
( likes(sK1,X11)
| ~ food(X11) ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X10,X9] :
( food(X9)
| ~ not_killed_by(X10,X9)
| ~ eats(X10,X9) ),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
eats(sK2,sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
alive(sK2),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
! [X6,X7] :
( not_killed_by(X6,X7)
| ~ alive(X6) ),
inference(cnf_transformation,[],[f7]) ).
fof(f16,plain,
~ likes(sK1,sK0),
inference(cnf_transformation,[],[f7]) ).
cnf(c_49,negated_conjecture,
~ likes(sK1,sK0),
inference(cnf_transformation,[],[f16]) ).
cnf(c_50,negated_conjecture,
( ~ alive(X0)
| not_killed_by(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_52,negated_conjecture,
alive(sK2),
inference(cnf_transformation,[],[f13]) ).
cnf(c_53,negated_conjecture,
eats(sK2,sK0),
inference(cnf_transformation,[],[f12]) ).
cnf(c_54,negated_conjecture,
( ~ not_killed_by(X0,X1)
| ~ eats(X0,X1)
| food(X1) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_57,negated_conjecture,
( ~ food(X0)
| likes(sK1,X0) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_62,negated_conjecture,
( ~ food(X0_13)
| likes(sK1,X0_13) ),
inference(subtyping,[status(esa)],[c_57]) ).
cnf(c_65,negated_conjecture,
( ~ not_killed_by(X0_15,X0_13)
| ~ eats(X0_15,X0_13)
| food(X0_13) ),
inference(subtyping,[status(esa)],[c_54]) ).
cnf(c_69,negated_conjecture,
( ~ alive(X0_15)
| not_killed_by(X0_15,X0_13) ),
inference(subtyping,[status(esa)],[c_50]) ).
cnf(c_71,plain,
( ~ food(sK0)
| likes(sK1,sK0) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_72,plain,
( ~ alive(sK2)
| not_killed_by(sK2,sK0) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_74,plain,
( ~ not_killed_by(sK2,sK0)
| ~ eats(sK2,sK0)
| food(sK0) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_75,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_74,c_72,c_71,c_49,c_53,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ060+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n007.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 : 300
% 0.13/0.34 % DateTime : Sat Aug 26 22:23:42 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.74/1.16 % SZS status Started for theBenchmark.p
% 0.74/1.16 % SZS status Theorem for theBenchmark.p
% 0.74/1.16
% 0.74/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.74/1.16
% 0.74/1.16 ------ iProver source info
% 0.74/1.16
% 0.74/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.74/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.74/1.16 git: non_committed_changes: false
% 0.74/1.16 git: last_make_outside_of_git: false
% 0.74/1.16
% 0.74/1.16 ------ Parsing...
% 0.74/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.74/1.16
% 0.74/1.16 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.74/1.16 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.74/1.16 ------ Proving...
% 0.74/1.16 ------ Problem Properties
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16 clauses 9
% 0.74/1.16 conjectures 9
% 0.74/1.16 EPR 9
% 0.74/1.16 Horn 9
% 0.74/1.16 unary 5
% 0.74/1.16 binary 3
% 0.74/1.16 lits 14
% 0.74/1.16 lits eq 0
% 0.74/1.16 fd_pure 0
% 0.74/1.16 fd_pseudo 0
% 0.74/1.16 fd_cond 0
% 0.74/1.16 fd_pseudo_cond 0
% 0.74/1.16 AC symbols 0
% 0.74/1.16
% 0.74/1.16 ------ Schedule EPR Horn non eq is on
% 0.74/1.16
% 0.74/1.16 ------ no equalities: superposition off
% 0.74/1.16
% 0.74/1.16 ------ Option_epr_horn Time Limit: Unbounded
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16 ------
% 0.74/1.16 Current options:
% 0.74/1.16 ------
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16 ------ Proving...
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16 % SZS status Theorem for theBenchmark.p
% 0.74/1.16
% 0.74/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.74/1.16
% 0.74/1.16
%------------------------------------------------------------------------------