TSTP Solution File: PUZ001+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : PUZ001+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:23 EDT 2023
% Result : Theorem 1.78s 1.15s
% Output : CNFRefutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 70 ( 25 unt; 0 def)
% Number of atoms : 133 ( 46 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 117 ( 54 ~; 50 |; 4 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 53 ( 0 sgn; 32 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
( killed(X0,agatha)
& lives(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_1) ).
fof(f5,axiom,
! [X0] :
( lives(X0)
=> ( charles = X0
| butler = X0
| agatha = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_3) ).
fof(f6,axiom,
! [X0,X1] :
( killed(X0,X1)
=> hates(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_4) ).
fof(f7,axiom,
! [X0,X1] :
( killed(X0,X1)
=> ~ richer(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_5) ).
fof(f8,axiom,
! [X0] :
( hates(agatha,X0)
=> ~ hates(charles,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_6) ).
fof(f9,axiom,
! [X0] :
( butler != X0
=> hates(agatha,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_7) ).
fof(f10,axiom,
! [X0] :
( ~ richer(X0,agatha)
=> hates(butler,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_8) ).
fof(f11,axiom,
! [X0] :
( hates(agatha,X0)
=> hates(butler,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_9) ).
fof(f12,axiom,
! [X0] :
? [X1] : ~ hates(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_10) ).
fof(f13,axiom,
agatha != butler,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_11) ).
fof(f14,conjecture,
killed(agatha,agatha),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55) ).
fof(f15,negated_conjecture,
~ killed(agatha,agatha),
inference(negated_conjecture,[],[f14]) ).
fof(f16,plain,
~ killed(agatha,agatha),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0] :
( charles = X0
| butler = X0
| agatha = X0
| ~ lives(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f18,plain,
! [X0] :
( charles = X0
| butler = X0
| agatha = X0
| ~ lives(X0) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( hates(X0,X1)
| ~ killed(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f20,plain,
! [X0,X1] :
( ~ richer(X0,X1)
| ~ killed(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f21,plain,
! [X0] :
( ~ hates(charles,X0)
| ~ hates(agatha,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f22,plain,
! [X0] :
( hates(agatha,X0)
| butler = X0 ),
inference(ennf_transformation,[],[f9]) ).
fof(f23,plain,
! [X0] :
( hates(butler,X0)
| richer(X0,agatha) ),
inference(ennf_transformation,[],[f10]) ).
fof(f24,plain,
! [X0] :
( hates(butler,X0)
| ~ hates(agatha,X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f25,plain,
( ? [X0] :
( killed(X0,agatha)
& lives(X0) )
=> ( killed(sK0,agatha)
& lives(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
( killed(sK0,agatha)
& lives(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f25]) ).
fof(f27,plain,
! [X0] :
( ? [X1] : ~ hates(X0,X1)
=> ~ hates(X0,sK1(X0)) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
! [X0] : ~ hates(X0,sK1(X0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f12,f27]) ).
fof(f29,plain,
lives(sK0),
inference(cnf_transformation,[],[f26]) ).
fof(f30,plain,
killed(sK0,agatha),
inference(cnf_transformation,[],[f26]) ).
fof(f34,plain,
! [X0] :
( charles = X0
| butler = X0
| agatha = X0
| ~ lives(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f35,plain,
! [X0,X1] :
( hates(X0,X1)
| ~ killed(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f36,plain,
! [X0,X1] :
( ~ richer(X0,X1)
| ~ killed(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f37,plain,
! [X0] :
( ~ hates(charles,X0)
| ~ hates(agatha,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f38,plain,
! [X0] :
( hates(agatha,X0)
| butler = X0 ),
inference(cnf_transformation,[],[f22]) ).
fof(f39,plain,
! [X0] :
( hates(butler,X0)
| richer(X0,agatha) ),
inference(cnf_transformation,[],[f23]) ).
fof(f40,plain,
! [X0] :
( hates(butler,X0)
| ~ hates(agatha,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f41,plain,
! [X0] : ~ hates(X0,sK1(X0)),
inference(cnf_transformation,[],[f28]) ).
fof(f42,plain,
agatha != butler,
inference(cnf_transformation,[],[f13]) ).
fof(f43,plain,
~ killed(agatha,agatha),
inference(cnf_transformation,[],[f16]) ).
cnf(c_49,plain,
killed(sK0,agatha),
inference(cnf_transformation,[],[f30]) ).
cnf(c_50,plain,
lives(sK0),
inference(cnf_transformation,[],[f29]) ).
cnf(c_54,plain,
( ~ lives(X0)
| X0 = agatha
| X0 = butler
| X0 = charles ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_55,plain,
( ~ killed(X0,X1)
| hates(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_56,plain,
( ~ killed(X0,X1)
| ~ richer(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_57,plain,
( ~ hates(agatha,X0)
| ~ hates(charles,X0) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_58,plain,
( X0 = butler
| hates(agatha,X0) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_59,plain,
( hates(butler,X0)
| richer(X0,agatha) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_60,plain,
( ~ hates(agatha,X0)
| hates(butler,X0) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_61,plain,
~ hates(X0,sK1(X0)),
inference(cnf_transformation,[],[f41]) ).
cnf(c_62,plain,
agatha != butler,
inference(cnf_transformation,[],[f42]) ).
cnf(c_63,negated_conjecture,
~ killed(agatha,agatha),
inference(cnf_transformation,[],[f43]) ).
cnf(c_67,plain,
( agatha = butler
| hates(agatha,agatha) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_68,plain,
( ~ hates(agatha,agatha)
| ~ hates(charles,agatha) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_155,plain,
( X0 != sK0
| X1 != agatha
| ~ richer(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_49,c_56]) ).
cnf(c_156,plain,
~ richer(sK0,agatha),
inference(unflattening,[status(thm)],[c_155]) ).
cnf(c_160,plain,
( X0 != sK0
| X1 != agatha
| hates(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_49,c_55]) ).
cnf(c_161,plain,
hates(sK0,agatha),
inference(unflattening,[status(thm)],[c_160]) ).
cnf(c_165,plain,
( sK0 != agatha
| agatha != agatha ),
inference(resolution_lifted,[status(thm)],[c_49,c_63]) ).
cnf(c_176,plain,
( X0 != sK0
| agatha != agatha
| hates(butler,X0) ),
inference(resolution_lifted,[status(thm)],[c_59,c_156]) ).
cnf(c_177,plain,
hates(butler,sK0),
inference(unflattening,[status(thm)],[c_176]) ).
cnf(c_182,plain,
( X0 != sK0
| X0 = agatha
| X0 = butler
| X0 = charles ),
inference(resolution_lifted,[status(thm)],[c_50,c_54]) ).
cnf(c_183,plain,
( sK0 = agatha
| sK0 = butler
| sK0 = charles ),
inference(unflattening,[status(thm)],[c_182]) ).
cnf(c_202,plain,
sK0 != agatha,
inference(equality_resolution_simp,[status(thm)],[c_165]) ).
cnf(c_203,plain,
( sK0 = butler
| sK0 = charles ),
inference(global_subsumption_just,[status(thm)],[c_183,c_183,c_202]) ).
cnf(c_350,plain,
( sK0 = butler
| hates(butler,charles) ),
inference(superposition,[status(thm)],[c_203,c_177]) ).
cnf(c_351,plain,
( sK0 = butler
| hates(charles,agatha) ),
inference(superposition,[status(thm)],[c_203,c_161]) ).
cnf(c_363,plain,
( X0 = butler
| hates(butler,X0) ),
inference(superposition,[status(thm)],[c_58,c_60]) ).
cnf(c_375,plain,
sK1(butler) = butler,
inference(superposition,[status(thm)],[c_363,c_61]) ).
cnf(c_376,plain,
~ hates(butler,butler),
inference(superposition,[status(thm)],[c_375,c_61]) ).
cnf(c_378,plain,
sK0 = butler,
inference(global_subsumption_just,[status(thm)],[c_350,c_62,c_67,c_68,c_351]) ).
cnf(c_380,plain,
hates(butler,butler),
inference(demodulation,[status(thm)],[c_177,c_378]) ).
cnf(c_383,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_380,c_376]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ001+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.16/0.34 % Computer : n026.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Sat Aug 26 22:32:19 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.78/1.15 % SZS status Started for theBenchmark.p
% 1.78/1.15 % SZS status Theorem for theBenchmark.p
% 1.78/1.15
% 1.78/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.78/1.15
% 1.78/1.15 ------ iProver source info
% 1.78/1.15
% 1.78/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.78/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.78/1.15 git: non_committed_changes: false
% 1.78/1.15 git: last_make_outside_of_git: false
% 1.78/1.15
% 1.78/1.15 ------ Parsing...
% 1.78/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.78/1.15
% 1.78/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 1.78/1.15
% 1.78/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.78/1.15
% 1.78/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.78/1.15 ------ Proving...
% 1.78/1.15 ------ Problem Properties
% 1.78/1.15
% 1.78/1.15
% 1.78/1.15 clauses 9
% 1.78/1.15 conjectures 0
% 1.78/1.15 EPR 8
% 1.78/1.15 Horn 7
% 1.78/1.15 unary 5
% 1.78/1.15 binary 4
% 1.78/1.15 lits 13
% 1.78/1.15 lits eq 5
% 1.78/1.15 fd_pure 0
% 1.78/1.15 fd_pseudo 0
% 1.78/1.15 fd_cond 1
% 1.78/1.15 fd_pseudo_cond 0
% 1.78/1.15 AC symbols 0
% 1.78/1.15
% 1.78/1.15 ------ Schedule dynamic 5 is on
% 1.78/1.15
% 1.78/1.15 ------ no conjectures: strip conj schedule
% 1.78/1.15
% 1.78/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.78/1.15
% 1.78/1.15
% 1.78/1.15 ------
% 1.78/1.15 Current options:
% 1.78/1.15 ------
% 1.78/1.15
% 1.78/1.15
% 1.78/1.15
% 1.78/1.15
% 1.78/1.15 ------ Proving...
% 1.78/1.15
% 1.78/1.15
% 1.78/1.15 % SZS status Theorem for theBenchmark.p
% 1.78/1.15
% 1.78/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.78/1.15
% 1.78/1.15
%------------------------------------------------------------------------------