%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PUZ035-2 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:32:47 PM UTC 2026
% Result : Unsatisfiable 1.20s 1.23s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 53 ( 6 unt; 0 def)
% Number of atoms : 127 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 145 ( 71 ~; 74 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 32 ( 0 sgn 32 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( isa(X0,knave)
| isa(X0,knight)
| ~ person(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',everyone_a_knight_or_knave) ).
fof(f3,axiom,
! [X0] :
( tell_the_truth(X0)
| ~ isa(X0,knight) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knights_make_true_statements) ).
fof(f4,axiom,
! [X0] :
( lies(X0)
| ~ isa(X0,knave) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knaves_make_false_statements) ).
fof(f5,axiom,
! [X0] :
( ~ lies(X0)
| ~ tell_the_truth(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',statements_are_true_or_false) ).
fof(f6,axiom,
! [X0] :
( lies(X0)
| tell_the_truth(X0)
| ~ person(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',statements_are_true_or_false2) ).
fof(f8,axiom,
( ~ lies(asked)
| ~ response(no)
| isa(other,knight)
| isa(asked,knight) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lie_one_is_a_knight) ).
fof(f10,axiom,
! [X0] :
( ~ isa(X0,knight)
| ~ tell_the_truth(asked)
| ~ response(no) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knight_answers2) ).
fof(f11,axiom,
! [X0] :
( ~ isa(X0,knight)
| ~ tell_the_truth(asked)
| response(yes) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knight_answers3) ).
fof(f13,axiom,
( response(no)
| response(yes) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_answers) ).
fof(f14,axiom,
person(asked),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',asked_person) ).
fof(f15,axiom,
person(other),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',other_person) ).
fof(f16,negated_conjecture,
! [X2,X0,X1] :
( ~ isa(other,X2)
| ~ isa(asked,X1)
| ~ response(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_answer) ).
tcf(c_65,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ response(X2)
| ~ isa(other,X1)
| ~ isa(asked,X0) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_66,plain,
person(other),
inference(cnf_transformation,[],[f15]) ).
tcf(c_68,plain,
( isa(other,knight)
| isa(asked,knight)
| ~ response(no)
| ~ lies(asked) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_70,plain,
person(asked),
inference(cnf_transformation,[],[f14]) ).
tcf(c_71,plain,
! [X0: $i] :
( lies(X0)
| tell_the_truth(X0)
| ~ person(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_72,plain,
! [X0: $i] :
( isa(X0,knave)
| isa(X0,knight)
| ~ person(X0) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_73,plain,
! [X0: $i] :
( tell_the_truth(X0)
| ~ isa(X0,knight) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_74,plain,
! [X0: $i] :
( ~ lies(X0)
| ~ tell_the_truth(X0) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_75,plain,
( response(no)
| response(yes) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_76,plain,
! [X0: $i] :
( ~ response(no)
| ~ tell_the_truth(asked)
| ~ isa(X0,knight) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_78,plain,
! [X0: $i] :
( response(yes)
| ~ tell_the_truth(asked)
| ~ isa(X0,knight) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_79,plain,
! [X0: $i] :
( lies(X0)
| ~ isa(X0,knave) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_175,plain,
( lies(asked)
| tell_the_truth(asked) ),
inference(resolution,[status(thm)],[c_71,c_70]) ).
tcf(c_182,plain,
( isa(asked,knave)
| isa(asked,knight) ),
inference(resolution,[status(thm)],[c_72,c_70]) ).
tcf(c_196,plain,
( isa(other,knave)
| isa(other,knight) ),
inference(resolution,[status(thm)],[c_72,c_66]) ).
tcf(c_211,plain,
! [X0: $i] :
( ~ tell_the_truth(X0)
| ~ isa(X0,knave) ),
inference(resolution,[status(thm)],[c_79,c_74]) ).
tcf(c_230,plain,
( tell_the_truth(asked)
| isa(other,knight)
| isa(asked,knight)
| ~ response(no) ),
inference(resolution,[status(thm)],[c_175,c_68]) ).
tcf(c_239,plain,
( tell_the_truth(asked)
| isa(other,knight)
| ~ response(no) ),
inference(forward_subsumption_resolution,[status(thm)],[c_230,c_73]) ).
tcf(c_254,plain,
( isa(other,knight)
| isa(asked,knight)
| ~ response(no)
| ~ isa(asked,knave) ),
inference(resolution,[status(thm)],[c_79,c_68]) ).
tcf(c_255,plain,
( isa(other,knight)
| isa(asked,knight)
| ~ response(no) ),
inference(global_subsumption_just,[status(thm)],[c_254,c_182,c_254]) ).
tcf(c_285,plain,
! [X0: $i] :
( response(yes)
| isa(other,knight)
| ~ response(no)
| ~ isa(X0,knight) ),
inference(resolution,[status(thm)],[c_239,c_78]) ).
tcf(c_287,plain,
! [X0: $i] :
( response(yes)
| isa(other,knight)
| ~ isa(X0,knight) ),
inference(global_subsumption_just,[status(thm)],[c_285,c_75,c_285]) ).
tcf(c_299,plain,
! [X0: $i] :
( isa(other,knight)
| ~ response(no)
| ~ isa(X0,knight) ),
inference(resolution,[status(thm)],[c_239,c_76]) ).
tcf(c_343,plain,
! [X0: $i] :
( response(yes)
| ~ isa(asked,knight)
| ~ isa(X0,knight) ),
inference(resolution,[status(thm)],[c_73,c_78]) ).
tcf(c_354,plain,
! [X0: $i] :
( ~ response(no)
| ~ isa(asked,knight)
| ~ isa(X0,knight) ),
inference(resolution,[status(thm)],[c_73,c_76]) ).
tcf(c_366,plain,
( isa(other,knight)
| ~ response(no)
| ~ isa(asked,knave) ),
inference(resolution,[status(thm)],[c_211,c_239]) ).
tcf(c_373,plain,
( ~ response(no)
| ~ isa(asked,knave) ),
inference(forward_subsumption_resolution,[status(thm)],[c_366,c_65]) ).
tcf(c_381,plain,
( isa(other,knight)
| ~ response(no) ),
inference(backward_subsumption_resolution,[status(thm)],[c_255,c_299]) ).
tcf(c_398,plain,
! [X0: $i] :
( ~ response(no)
| ~ isa(X0,knight) ),
inference(global_subsumption_just,[status(thm)],[c_354,c_182,c_354,c_373]) ).
tcf(c_401,plain,
! [X0: $i] :
( response(yes)
| ~ isa(X0,knight) ),
inference(global_subsumption_just,[status(thm)],[c_343,c_75,c_398]) ).
tcf(c_409,plain,
( response(yes)
| isa(other,knight) ),
inference(global_subsumption_just,[status(thm)],[c_287,c_75,c_381]) ).
tcf(c_420,plain,
response(yes),
inference(forward_subsumption_resolution,[status(thm)],[c_409,c_401]) ).
tcf(c_456,plain,
! [X0: $i,X1: $i] :
( ~ isa(other,X1)
| ~ isa(asked,X0) ),
inference(resolution,[status(thm)],[c_420,c_65]) ).
tcf(c_490,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ isa(other,X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_456]) ).
tcf(c_491,plain,
! [X0: $i] :
( ~ iPr_def_11
| ~ isa(asked,X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_456]) ).
tcf(c_492,plain,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_456]) ).
tcf(c_493,plain,
( ~ iPr_def_10
| ~ isa(other,knight) ),
inference(instantiation,[status(thm)],[c_490]) ).
tcf(c_494,plain,
( ~ iPr_def_11
| ~ isa(asked,knight) ),
inference(instantiation,[status(thm)],[c_491]) ).
tcf(c_495,plain,
( ~ iPr_def_10
| ~ isa(other,knave) ),
inference(instantiation,[status(thm)],[c_490]) ).
tcf(c_496,plain,
( ~ iPr_def_11
| ~ isa(asked,knave) ),
inference(instantiation,[status(thm)],[c_491]) ).
tcf(c_497,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_496,c_495,c_494,c_493,c_492,c_196,c_182]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ035-2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.36 % Computer : n009.cluster.edu
% 0.07/0.36 % Model : x86_64 x86_64
% 0.07/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.36 % Memory : 8046.5625MB
% 0.07/0.36 % OS : Linux 6.8.0-71-generic
% 0.07/0.36 % CPULimit : 300
% 0.07/0.36 % WCLimit : 300
% 0.07/0.36 % DateTime : Thu Sep 24 06:44:28 UTC 2026
% 0.07/0.36 % CPUTime :
% 0.07/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.41 Running EPR theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s epr_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.43
% 0.14/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.43
% 0.14/0.43 % Detected problem language: tptp
% 0.14/0.45 % Proving...
% 1.20/1.23 % SZS status Started for theBenchmark.p
% 1.20/1.23 % SZS status Unsatisfiable for theBenchmark.p
% 1.20/1.23
% 1.20/1.23 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.20/1.23
% 1.20/1.23 % ------ iProver source info
% 1.20/1.23
% 1.20/1.23 % git: date: 2026-07-19 20:42:38 +0200
% 1.20/1.23 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.20/1.23 % git: non_committed_changes: false
% 1.20/1.23
% 1.20/1.23 % ------ Parsing...% successful
% 1.20/1.23
% 1.20/1.23
% 1.20/1.23 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.20/1.23 %
% 1.20/1.23
% 1.20/1.23 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.20/1.23
% 1.20/1.23 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.20/1.23 gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.20/1.23 % ------ Proving...
% 1.20/1.23 % ------ Problem Properties
% 1.20/1.23
% 1.20/1.23 %
% 1.20/1.23 % clauses 8
% 1.20/1.23 % conjectures 0
% 1.20/1.23 % EPR 8
% 1.20/1.23 % Horn 5
% 1.20/1.23 % unary 0
% 1.20/1.23 % binary 8
% 1.20/1.23 % lits 16
% 1.20/1.23 % lits eq 0
% 1.20/1.23 % fd_pure 0
% 1.20/1.23 % fd_pseudo 0
% 1.20/1.23 % fd_cond 0
% 1.20/1.23 % fd_pseudo_cond 0
% 1.20/1.23 % AC symbols 0
% 1.20/1.23
% 1.20/1.23 % ------ Schedule EPR non Horn non eq is on
% 1.20/1.23
% 1.20/1.23 % ------ no conjectures: strip conj schedule
% 1.20/1.23
% 1.20/1.23 % ------ no equalities: superposition off
% 1.20/1.23
% 1.20/1.23 % ------ Input Options "--resolution_flag false" stripped conjectures Time Limit: 70.
% 1.20/1.23
% 1.20/1.23
% 1.20/1.23 % ------
% 1.20/1.23 % Current options:
% 1.20/1.23 % ------
% 1.20/1.23
% 1.20/1.23
% 1.20/1.23 %
% 1.20/1.23
% 1.20/1.23 % ------ Proving...
% 1.20/1.23 %
% 1.20/1.23
% 1.20/1.23 % SZS status Unsatisfiable for theBenchmark.p
% 1.20/1.23
% 1.20/1.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.20/1.23
% 1.20/1.23
%------------------------------------------------------------------------------