%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COL054-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 : n014.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.94s 1.32s
% Output : CNFRefutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 11 unt; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 7 ~; 1 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : response(mocking_bird,X0) = response(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mocking_bird_exists) ).
fof(f2,axiom,
! [X2,X0,X1] : response(compose(X0,X1),X2) = response(X0,response(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composer_exists) ).
fof(f3,negated_conjecture,
! [X0,X1] :
( response(b,X1) != X0
| response(a,X0) != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_birds_are_compatible) ).
fof(f4,plain,
! [X0] : response(b,response(a,X0)) != X0,
inference(equality_resolution,[],[f3]) ).
tcf(c_52,plain,
! [X0: $i] : response(X0,X0) = response(mocking_bird,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : response(compose(X0,X1),X2) = response(X0,response(X1,X2)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] : response(b,response(a,X0)) != X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_67,negated_conjecture,
! [X0: $i] : response(b,response(a,X0)) != X0,
inference(demodulation,[status(thm)],[c_54]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i] : response(X0,response(X1,compose(X0,X1))) = response(mocking_bird,compose(X0,X1)),
inference(superposition,[status(thm)],[c_52,c_53]) ).
tcf(c_100,plain,
! [X0: $i] : response(b,response(mocking_bird,compose(a,X0))) != response(X0,compose(a,X0)),
inference(superposition,[status(thm)],[c_94,c_67]) ).
tcf(c_103,plain,
! [X0: $i,X1: $i] : response(X0,response(X1,compose(a,compose(X0,X1)))) != response(b,response(mocking_bird,compose(a,compose(X0,X1)))),
inference(superposition,[status(thm)],[c_53,c_100]) ).
tcf(c_107,plain,
$false,
inference(equality_resolution,[status(thm)],[c_103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL054-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.39 % Computer : n014.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Fri Sep 25 07:21:47 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.45
% 0.11/0.45 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.45
% 0.11/0.45 % Detected problem language: tptp
% 0.11/0.46 % Proving...
% 1.94/1.32 % SZS status Started for theBenchmark.p
% 1.94/1.32 % SZS status Unsatisfiable for theBenchmark.p
% 1.94/1.32
% 1.94/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.94/1.32
% 1.94/1.32 % ------ iProver source info
% 1.94/1.32
% 1.94/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 1.94/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.94/1.32 % git: non_committed_changes: false
% 1.94/1.32
% 1.94/1.32 % ------ Parsing...% successful
% 1.94/1.32
% 1.94/1.32
% 1.94/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_UEQ
% 1.94/1.32 %
% 1.94/1.32
% 1.94/1.32 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.94/1.32
% 1.94/1.32 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 1.94/1.32 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.94/1.32
% 1.94/1.32 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.94/1.32 % ------ Proving...
% 1.94/1.32 % ------ Problem Properties
% 1.94/1.32
% 1.94/1.32 %
% 1.94/1.32 % clauses 3
% 1.94/1.32 % conjectures 1
% 1.94/1.32 % EPR 0
% 1.94/1.32 % Horn 3
% 1.94/1.32 % unary 3
% 1.94/1.32 % binary 0
% 1.94/1.32 % lits 3
% 1.94/1.32 % lits eq 3
% 1.94/1.32 % fd_pure 0
% 1.94/1.32 % fd_pseudo 0
% 1.94/1.32 % fd_cond 0
% 1.94/1.32 % fd_pseudo_cond 0
% 1.94/1.32 % AC symbols 0
% 1.94/1.32
% 1.94/1.32 % ------ Schedule UEQ
% 1.94/1.32
% 1.94/1.32 % ------ Option_UEQ Time Limit: 10.
% 1.94/1.32
% 1.94/1.32
% 1.94/1.32 % ------
% 1.94/1.32 % Current options:
% 1.94/1.32 % ------
% 1.94/1.32
% 1.94/1.32
% 1.94/1.32 %
% 1.94/1.32
% 1.94/1.32 % ------ Proving...
% 1.94/1.32 %
% 1.94/1.32
% 1.94/1.32 % SZS status Unsatisfiable for theBenchmark.p
% 1.94/1.32
% 1.94/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.94/1.32
% 1.94/1.32
%------------------------------------------------------------------------------