%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN563-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n005.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 03:41:06 PM UTC 2026
% Result : Unsatisfiable 2.67s 1.39s
% Output : CNFRefutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 40 ( 14 unt; 0 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 86 ( 44 ~; 42 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 44 ( 0 sgn 44 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X0] : p2(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_1) ).
fof(f2,negated_conjecture,
! [X0] : p6(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_2) ).
fof(f4,negated_conjecture,
p2(f4(c7),f4(c8)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_4) ).
fof(f5,negated_conjecture,
~ p6(f4(c7),f3(f4(c8))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p6_5) ).
fof(f7,negated_conjecture,
! [X0] : p5(f3(f3(X0)),f3(f4(X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p5_7) ).
fof(f9,negated_conjecture,
! [X0] :
( ~ p6(c7,X0)
| p6(c7,f3(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_9) ).
fof(f10,negated_conjecture,
! [X0,X1] :
( ~ p5(X0,X1)
| p6(f4(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_10) ).
fof(f11,negated_conjecture,
! [X0,X1] :
( ~ p2(X0,X1)
| p2(f3(X0),f3(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_11) ).
fof(f12,negated_conjecture,
! [X0,X1] :
( ~ p2(X0,X1)
| p2(f4(X0),f4(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_12) ).
fof(f15,negated_conjecture,
! [X2,X0,X1] :
( ~ p6(X0,X2)
| ~ p5(X2,X1)
| p5(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p5_15) ).
fof(f16,negated_conjecture,
! [X2,X3,X0,X1] :
( ~ p2(X3,X1)
| ~ p6(X2,X3)
| ~ p2(X2,X0)
| p6(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_16) ).
tcf(c_66,negated_conjecture,
! [X0: $i] : p2(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_67,negated_conjecture,
! [X0: $i] : p6(X0,X0),
inference(cnf_transformation,[],[f2]) ).
tcf(c_69,negated_conjecture,
p2(f4(c7),f4(c8)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_70,negated_conjecture,
~ p6(f4(c7),f3(f4(c8))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_72,negated_conjecture,
! [X0: $i] : p5(f3(f3(X0)),f3(f4(X0))),
inference(cnf_transformation,[],[f7]) ).
tcf(c_74,negated_conjecture,
! [X0: $i] :
( p6(c7,f3(X0))
| ~ p6(c7,X0) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_75,negated_conjecture,
! [X0: $i,X1: $i] :
( p6(f4(X0),X1)
| ~ p5(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_76,negated_conjecture,
! [X0: $i,X1: $i] :
( p2(f3(X0),f3(X1))
| ~ p2(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_77,negated_conjecture,
! [X0: $i,X1: $i] :
( p2(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_80,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( p5(X0,X2)
| ~ p5(X1,X2)
| ~ p6(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_81,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( p6(X3,X1)
| ~ p6(X2,X0)
| ~ p2(X2,X3)
| ~ p2(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_83,plain,
p6(c7,c7),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_84,plain,
p2(c7,c7),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_85,plain,
p5(f3(f3(c7)),f3(f4(c7))),
inference(instantiation,[status(thm)],[c_72]) ).
tcf(c_87,plain,
( p6(c7,f3(c7))
| ~ p6(c7,c7) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_89,plain,
( p2(f4(c7),f4(c7))
| ~ p2(c7,c7) ),
inference(instantiation,[status(thm)],[c_77]) ).
tcf(c_226,plain,
! [X0: $i,X1: $i] :
( p5(X1,f3(f4(X0)))
| ~ p6(X1,f3(f3(X0)))
| ~ p5(f3(f3(X0)),f3(f4(X0))) ),
inference(instantiation,[status(thm)],[c_80]) ).
tcf(c_227,plain,
( p5(c7,f3(f4(c7)))
| ~ p6(c7,f3(f3(c7)))
| ~ p5(f3(f3(c7)),f3(f4(c7))) ),
inference(instantiation,[status(thm)],[c_226]) ).
tcf(c_230,plain,
! [X0: $i,X1: $i] :
( p6(f4(c7),f3(f4(c8)))
| ~ p6(X1,X0)
| ~ p2(X1,f4(c7))
| ~ p2(X0,f3(f4(c8))) ),
inference(instantiation,[status(thm)],[c_81]) ).
tcf(c_268,plain,
! [X0: $i] :
( p6(f4(c7),f3(f4(c8)))
| ~ p6(f4(c7),X0)
| ~ p2(f4(c7),f4(c7))
| ~ p2(X0,f3(f4(c8))) ),
inference(instantiation,[status(thm)],[c_230]) ).
tcf(c_278,plain,
! [X0: $i] :
( p6(c7,f3(f3(X0)))
| ~ p6(c7,f3(X0)) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_279,plain,
( p6(c7,f3(f3(c7)))
| ~ p6(c7,f3(c7)) ),
inference(instantiation,[status(thm)],[c_278]) ).
tcf(c_294,plain,
! [X0: $i,X1: $i] :
( p2(f3(f4(X0)),f3(X1))
| ~ p2(f4(X0),X1) ),
inference(instantiation,[status(thm)],[c_76]) ).
tcf(c_352,plain,
! [X0: $i] :
( p6(f4(c7),f3(f4(X0)))
| ~ p5(c7,f3(f4(X0))) ),
inference(instantiation,[status(thm)],[c_75]) ).
tcf(c_353,plain,
( p6(f4(c7),f3(f4(c7)))
| ~ p5(c7,f3(f4(c7))) ),
inference(instantiation,[status(thm)],[c_352]) ).
tcf(c_367,plain,
( p2(f3(f4(c7)),f3(f4(c8)))
| ~ p2(f4(c7),f4(c8)) ),
inference(instantiation,[status(thm)],[c_294]) ).
tcf(c_625,plain,
! [X0: $i] :
( p6(f4(c7),f3(f4(c8)))
| ~ p2(f4(c7),f4(c7))
| ~ p6(f4(c7),f3(f4(X0)))
| ~ p2(f3(f4(X0)),f3(f4(c8))) ),
inference(instantiation,[status(thm)],[c_268]) ).
tcf(c_628,plain,
( p6(f4(c7),f3(f4(c8)))
| ~ p2(f4(c7),f4(c7))
| ~ p6(f4(c7),f3(f4(c7)))
| ~ p2(f3(f4(c7)),f3(f4(c8))) ),
inference(instantiation,[status(thm)],[c_625]) ).
tcf(c_629,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_628,c_367,c_353,c_279,c_227,c_89,c_87,c_70,c_85,c_69,c_84,c_83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN563-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.58 % Computer : n005.cluster.edu
% 0.09/0.58 % Model : x86_64 x86_64
% 0.09/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.58 % Memory : 8046.5625MB
% 0.09/0.58 % OS : Linux 6.8.0-71-generic
% 0.09/0.58 % CPULimit : 300
% 0.09/0.58 % WCLimit : 300
% 0.09/0.58 % DateTime : Fri Sep 25 01:44:47 UTC 2026
% 0.09/0.58 % CPUTime :
% 0.09/0.58 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.62 Running first-order theorem proving
% 0.09/0.62 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.15/0.63
% 0.15/0.63 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.63
% 0.15/0.63 % Detected problem language: tptp
% 0.15/0.64 % Proving...
% 2.67/1.39 % SZS status Started for theBenchmark.p
% 2.67/1.39 % SZS status Unsatisfiable for theBenchmark.p
% 2.67/1.39
% 2.67/1.39 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.67/1.39
% 2.67/1.39 % ------ iProver source info
% 2.67/1.39
% 2.67/1.39 % git: date: 2026-07-19 20:42:38 +0200
% 2.67/1.39 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.67/1.39 % git: non_committed_changes: false
% 2.67/1.39
% 2.67/1.39 % ------ Parsing...% successful
% 2.67/1.39
% 2.67/1.39
% 2.67/1.39 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.67/1.39
% 2.67/1.39 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.67/1.39
% 2.67/1.39 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.67/1.39 % ------ Proving...
% 2.67/1.39 % ------ Problem Properties
% 2.67/1.39
% 2.67/1.39 %
% 2.67/1.39 % clauses 17
% 2.67/1.39 % conjectures 17
% 2.67/1.39 % EPR 8
% 2.67/1.39 % Horn 17
% 2.67/1.39 % unary 6
% 2.67/1.39 % binary 6
% 2.67/1.39 % lits 35
% 2.67/1.39 % lits eq 0
% 2.67/1.39 % fd_pure 0
% 2.67/1.39 % fd_pseudo 0
% 2.67/1.39 % fd_cond 0
% 2.67/1.39 % fd_pseudo_cond 0
% 2.67/1.39 % AC symbols 0
% 2.67/1.39
% 2.67/1.39 % ------ Schedule dynamic 5 is on
% 2.67/1.39
% 2.67/1.39 % ------ no equalities: superposition off
% 2.67/1.39
% 2.67/1.39 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.67/1.39
% 2.67/1.39
% 2.67/1.39 % ------
% 2.67/1.39 % Current options:
% 2.67/1.39 % ------
% 2.67/1.39
% 2.67/1.39
% 2.67/1.39 %
% 2.67/1.39
% 2.67/1.39 % ------ Proving...
% 2.67/1.39 %
% 2.67/1.39
% 2.67/1.39 % SZS status Unsatisfiable for theBenchmark.p
% 2.67/1.39
% 2.67/1.39 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.67/1.39
% 2.67/1.39
%------------------------------------------------------------------------------