%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COL058-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n012.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 01:02:41 PM UTC 2026
% Result : Unsatisfiable 1.38s 1.06s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 9 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : response(response(lark,X0),X1) = response(X0,response(X1,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lark_exists) ).
fof(f2,negated_conjecture,
! [X0] : response(X0,X0) != X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_the_bird_exists) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : response(X0,response(X1,X1)) = response(response(lark,X0),X1),
inference(cnf_transformation,[],[f1]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] : response(X0,X0) != X0,
inference(cnf_transformation,[],[f2]) ).
tcf(c_89,plain,
! [X0: $i] : response(response(lark,response(X0,X0)),X0) != response(X0,X0),
inference(superposition,[status(thm)],[c_51,c_52]) ).
tcf(c_95,plain,
! [X0: $i] : response(response(response(lark,lark),X0),X0) != response(X0,X0),
inference(superposition,[status(thm)],[c_51,c_89]) ).
tcf(c_102,plain,
! [X0: $i] : response(response(response(lark,response(lark,lark)),X0),response(X0,X0)) != response(response(X0,X0),response(X0,X0)),
inference(superposition,[status(thm)],[c_51,c_95]) ).
tcf(c_153,plain,
$false,
inference(equality_resolution,[status(thm)],[c_102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : COL058-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Fri Sep 25 07:22:05 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.31 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.32 Running UEQ theorem proving
% 0.04/0.32 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.33
% 0.07/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.33
% 0.07/0.33 % Detected problem language: tptp
% 0.07/0.34 % Proving...
% 1.38/1.06 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.38/1.06 % SZS status Started for theBenchmark.p
% 1.38/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 1.38/1.06
% 1.38/1.06 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.38/1.06
% 1.38/1.06 % ------ iProver source info
% 1.38/1.06
% 1.38/1.06 % git: date: 2026-07-19 20:42:38 +0200
% 1.38/1.06 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.38/1.06 % git: non_committed_changes: false
% 1.38/1.06
% 1.38/1.06 % ------ Parsing...% successful
% 1.38/1.06
% 1.38/1.06
% 1.38/1.06 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.38/1.06
% 1.38/1.06 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.38/1.06
% 1.38/1.06 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.38/1.06
% 1.38/1.06 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.38/1.06 % ------ Proving...
% 1.38/1.06 % ------ Problem Properties
% 1.38/1.06
% 1.38/1.06 %
% 1.38/1.06 % clauses 2
% 1.38/1.06 % conjectures 1
% 1.38/1.06 % EPR 0
% 1.38/1.06 % Horn 2
% 1.38/1.06 % unary 2
% 1.38/1.06 % binary 0
% 1.38/1.06 % lits 2
% 1.38/1.06 % lits eq 2
% 1.38/1.06 % fd_pure 0
% 1.38/1.06 % fd_pseudo 0
% 1.38/1.06 % fd_cond 0
% 1.38/1.06 % fd_pseudo_cond 0
% 1.38/1.06 % AC symbols 0
% 1.38/1.06
% 1.38/1.06 % ------ Input Options Time Limit: Unbounded
% 1.38/1.06
% 1.38/1.06
% 1.38/1.06 % ------
% 1.38/1.06 % Current options:
% 1.38/1.06 % ------
% 1.38/1.06
% 1.38/1.06
% 1.38/1.06 %
% 1.38/1.06
% 1.38/1.06 % ------ Proving...
% 1.38/1.06 %
% 1.38/1.06
% 1.38/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 1.38/1.06
% 1.38/1.06 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.38/1.06
% 1.38/1.06
%------------------------------------------------------------------------------