%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PUZ035-7 : 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 : n008.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:48 PM UTC 2026
% Result : Unsatisfiable 1.69s 1.27s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 8 unt; 3 def)
% Number of atoms : 93 ( 3 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 73 ( 34 ~; 39 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 7 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 31 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( truth(isa(X0,knave))
| truth(isa(X0,knight)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',everyone_a_knight_or_knave) ).
fof(f3,axiom,
! [X0,X1] :
( ~ reply(X1,X0,yes)
| ~ truth(isa(X1,knight))
| truth(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knights_make_true_statements1) ).
fof(f7,axiom,
! [X0,X1] :
( reply(X0,X1,no)
| reply(X0,X1,yes) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yes_or_no) ).
fof(f14,negated_conjecture,
! [X2,X0,X1] :
( ~ truth(isa(other,X2))
| ~ truth(isa(asked,X1))
| ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_answer) ).
tcf(c_63,plain,
! [X0: $i] :
( truth(isa(X0,knave))
| truth(isa(X0,knight)) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( truth(X1)
| ~ truth(isa(X0,knight))
| ~ reply(X0,X1,yes) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] :
( reply(X0,X1,no)
| reply(X0,X1,yes) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_76,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ truth(isa(other,X2))
| ~ truth(isa(asked,X1))
| ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_92,plain,
! [X0: $i] :
( truth(isa(X0,knight))
| truth(isa(X0,knave)) ),
inference(prop_impl_just,[status(thm)],[c_63]) ).
tcf(c_93,plain,
! [X0: $i] :
( truth(isa(X0,knave))
| truth(isa(X0,knight)) ),
inference(renaming,[status(thm)],[c_92]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i] :
( reply(X0,X1,yes)
| reply(X0,X1,no) ),
inference(prop_impl_just,[status(thm)],[c_69]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i] :
( reply(X0,X1,no)
| reply(X0,X1,yes) ),
inference(renaming,[status(thm)],[c_96]) ).
tcf(c_136,plain,
! [X0: $i,X1: $i] :
( truth(X1)
| truth(isa(X0,knave))
| reply(X0,X1,no) ),
inference(bin_hyper_res,[status(thm)],[c_65,c_93,c_97]) ).
tcf(c_212,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| ~ truth(isa(asked,X0)) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_76]) ).
tcf(c_213,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_11
| ~ truth(isa(other,X0)) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_76]) ).
tcf(c_214,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_12
| ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_12])],[c_76]) ).
tcf(c_215,negated_conjecture,
( iPr_def_12
| iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_76]) ).
tcf(c_216,definition,
iPr_def_13 = isa(asked,knight),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_217,definition,
iPr_def_14 = isa(other,knight),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_218,definition,
iPr_def_15 = or(iPr_def_13,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_219,negated_conjecture,
( iPr_def_12
| iPr_def_11
| iPr_def_10 ),
inference(demodulation,[status(thm)],[c_215]) ).
tcf(c_220,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_12
| ~ reply(asked,iPr_def_15,X0) ),
inference(demodulation,[status(thm)],[c_214,c_217,c_216,c_218]) ).
tcf(c_221,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_11
| ~ truth(isa(other,X0)) ),
inference(demodulation,[status(thm)],[c_213]) ).
tcf(c_222,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| ~ truth(isa(asked,X0)) ),
inference(demodulation,[status(thm)],[c_212]) ).
tcf(c_657,plain,
( ~ iPr_def_10
| ~ truth(iPr_def_13) ),
inference(superposition,[status(thm)],[c_216,c_222]) ).
tcf(c_664,plain,
( ~ iPr_def_11
| ~ truth(iPr_def_14) ),
inference(superposition,[status(thm)],[c_217,c_221]) ).
tcf(c_673,plain,
( truth(iPr_def_15)
| truth(isa(asked,knave))
| ~ iPr_def_12 ),
inference(superposition,[status(thm)],[c_136,c_220]) ).
tcf(c_712,plain,
( truth(isa(asked,knight))
| ~ iPr_def_10 ),
inference(superposition,[status(thm)],[c_63,c_222]) ).
tcf(c_713,plain,
( truth(isa(other,knight))
| ~ iPr_def_11 ),
inference(superposition,[status(thm)],[c_63,c_221]) ).
tcf(c_714,plain,
( truth(iPr_def_14)
| ~ iPr_def_11 ),
inference(light_normalisation,[status(thm)],[c_713,c_217]) ).
tcf(c_717,plain,
( truth(iPr_def_13)
| ~ iPr_def_10 ),
inference(light_normalisation,[status(thm)],[c_712,c_216]) ).
tcf(c_720,plain,
( truth(iPr_def_15)
| truth(isa(asked,knave)) ),
inference(global_subsumption_just,[status(thm)],[c_673,c_219,c_657,c_664,c_673,c_717,c_714]) ).
tcf(c_726,plain,
( truth(iPr_def_15)
| ~ iPr_def_10 ),
inference(superposition,[status(thm)],[c_720,c_222]) ).
tcf(c_729,plain,
~ iPr_def_10,
inference(global_subsumption_just,[status(thm)],[c_726,c_657,c_717]) ).
tcf(c_731,plain,
( iPr_def_12
| iPr_def_11 ),
inference(backward_subsumption_resolution,[status(thm)],[c_219,c_729]) ).
tcf(c_734,plain,
iPr_def_12,
inference(global_subsumption_just,[status(thm)],[c_731,c_219,c_664,c_714,c_729]) ).
tcf(c_736,plain,
! [X0: $i] : ~ reply(asked,iPr_def_15,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_220,c_734]) ).
tcf(c_745,plain,
reply(asked,iPr_def_15,yes),
inference(superposition,[status(thm)],[c_69,c_736]) ).
tcf(c_746,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_745,c_736]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ035-7 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n008.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 06:45:09 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 1.69/1.27 % SZS status Started for theBenchmark.p
% 1.69/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.69/1.27
% 1.69/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.69/1.27
% 1.69/1.27 % ------ iProver source info
% 1.69/1.27
% 1.69/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.69/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.69/1.27 % git: non_committed_changes: false
% 1.69/1.27
% 1.69/1.27 % ------ Parsing...% successful
% 1.69/1.27
% 1.69/1.27
% 1.69/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.69/1.27
% 1.69/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.69/1.27
% 1.69/1.27 % ------ Preprocessing... gs_s sp: 3 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.69/1.27
% 1.69/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.69/1.27 % ------ Proving...
% 1.69/1.27 % ------ Problem Properties
% 1.69/1.27
% 1.69/1.27 %
% 1.69/1.27 % clauses 20
% 1.69/1.27 % conjectures 4
% 1.69/1.27 % EPR 4
% 1.69/1.27 % Horn 14
% 1.69/1.27 % unary 3
% 1.69/1.27 % binary 11
% 1.69/1.27 % lits 43
% 1.69/1.27 % lits eq 3
% 1.69/1.27 % fd_pure 0
% 1.69/1.27 % fd_pseudo 0
% 1.69/1.27 % fd_cond 0
% 1.69/1.27 % fd_pseudo_cond 0
% 1.69/1.27 % AC symbols 0
% 1.69/1.27
% 1.69/1.27 % ------ Schedule dynamic 5 is on
% 1.69/1.27
% 1.69/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.69/1.27
% 1.69/1.27
% 1.69/1.27 % ------
% 1.69/1.27 % Current options:
% 1.69/1.27 % ------
% 1.69/1.27
% 1.69/1.27
% 1.69/1.27 %
% 1.69/1.27
% 1.69/1.27 % ------ Proving...
% 1.69/1.27 %
% 1.69/1.27
% 1.69/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.69/1.27
% 1.69/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.69/1.27
% 1.69/1.27
%------------------------------------------------------------------------------