%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN072+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n004.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:39:06 PM UTC 2026
% Result : Theorem 2.32s 6.54s
% Output : CNFRefutation 2.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 18 unt; 0 def)
% Number of atoms : 83 ( 64 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 85 ( 44 ~; 41 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn 22 !; 3 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0,X1] :
! [X2] :
( X2 = X1
| X2 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel49_1) ).
fof(f2,axiom,
big_p(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel49_2) ).
fof(f3,axiom,
big_p(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel49_3) ).
fof(f4,axiom,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel49_4) ).
fof(f5,conjecture,
! [X0] : big_p(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel49) ).
fof(f6,negated_conjecture,
~ ! [X0] : big_p(X0),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
? [X0] : ~ big_p(X0),
inference(ennf_transformation,[],[f6]) ).
fof(f8,plain,
! [X2] :
( sK1 = X2
| sK0 = X2 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f1]) ).
fof(f9,plain,
~ big_p(sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f7]) ).
fof(f10,plain,
! [X2] :
( sK1 = X2
| sK0 = X2 ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
big_p(a),
inference(cnf_transformation,[],[f2]) ).
fof(f12,plain,
big_p(b),
inference(cnf_transformation,[],[f3]) ).
fof(f13,plain,
a != b,
inference(cnf_transformation,[],[f4]) ).
fof(f14,plain,
~ big_p(sK2),
inference(cnf_transformation,[],[f9]) ).
tcf(c_49,plain,
! [X0: $i] :
( ( X0 = sK1 )
| ( X0 = sK0 ) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_50,plain,
big_p(a),
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,plain,
big_p(b),
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,plain,
a != b,
inference(cnf_transformation,[],[f13]) ).
tcf(c_53,negated_conjecture,
~ big_p(sK2),
inference(cnf_transformation,[],[f14]) ).
tcf(c_54,plain,
( ( a = sK1 )
| ( a = sK0 ) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_61,plain,
a != sK2,
inference(resolution_lifted,[status(thm)],[c_50,c_53]) ).
tcf(c_65,plain,
b != sK2,
inference(resolution_lifted,[status(thm)],[c_51,c_53]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( big_p(X0)
| ~ big_p(X1)
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_78,plain,
! [X0: $i] :
( big_p(sK2)
| ~ big_p(X0)
| ( sK2 != X0 ) ),
inference(instantiation,[status(thm)],[c_75]) ).
tcf(c_79,plain,
( big_p(sK2)
| ~ big_p(a)
| ( sK2 != a ) ),
inference(instantiation,[status(thm)],[c_78]) ).
tcf(c_80,plain,
! [X0: $i] :
( ( a = b )
| ( b != X0 )
| ( a != X0 ) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_83,plain,
( ( sK2 = sK1 )
| ( sK2 = sK0 ) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i] :
( ( sK2 = X0 )
| ( sK2 != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_86,plain,
( ( a = b )
| ( b != sK0 )
| ( a != sK0 ) ),
inference(instantiation,[status(thm)],[c_80]) ).
tcf(c_87,plain,
( ( b = sK1 )
| ( b = sK0 ) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i] :
( ( b = X0 )
| ( b != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_97,plain,
! [X0: $i] :
( ( sK2 = X0 )
| ( sK2 != sK0 )
| ( X0 != sK0 ) ),
inference(instantiation,[status(thm)],[c_85]) ).
tcf(c_98,plain,
( ( sK2 = a )
| ( sK2 != sK0 )
| ( a != sK0 ) ),
inference(instantiation,[status(thm)],[c_97]) ).
tcf(c_110,plain,
! [X0: $i] :
( ( b = X0 )
| ( b != sK0 )
| ( X0 != sK0 ) ),
inference(instantiation,[status(thm)],[c_89]) ).
tcf(c_121,plain,
! [X0: $i,X1: $i] :
( ( X0 = sK2 )
| ( sK2 != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_139,plain,
( ( b = sK2 )
| ( sK2 != sK0 )
| ( b != sK0 ) ),
inference(instantiation,[status(thm)],[c_110]) ).
tcf(c_151,plain,
! [X0: $i] :
( ( X0 = sK2 )
| ( sK2 != sK1 )
| ( X0 != sK1 ) ),
inference(instantiation,[status(thm)],[c_121]) ).
tcf(c_154,plain,
( ( a = sK2 )
| ( sK2 != sK1 )
| ( a != sK1 ) ),
inference(instantiation,[status(thm)],[c_151]) ).
tcf(c_178,plain,
( ( a = b )
| ( b != sK1 )
| ( a != sK1 ) ),
inference(instantiation,[status(thm)],[c_80]) ).
tcf(c_197,plain,
( ( b = sK2 )
| ( sK2 != sK1 )
| ( b != sK1 ) ),
inference(instantiation,[status(thm)],[c_151]) ).
tcf(c_203,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_197,c_178,c_154,c_139,c_98,c_87,c_86,c_83,c_79,c_65,c_61,c_54,c_52,c_53,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN072+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.60 % Computer : n004.cluster.edu
% 0.10/5.60 % Model : x86_64 x86_64
% 0.10/5.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.60 % Memory : 8046.5625MB
% 0.10/5.60 % OS : Linux 6.8.0-71-generic
% 0.10/5.60 % CPULimit : 300
% 0.10/5.60 % WCLimit : 300
% 0.10/5.60 % DateTime : Fri Sep 25 00:04:13 UTC 2026
% 0.10/5.61 % CPUTime :
% 0.10/5.61 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.64 Running first-order theorem proving
% 0.10/5.64 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.10/5.66
% 0.10/5.66 % ======== iProver multi-core TPTP/SMT =========
% 0.10/5.66
% 0.10/5.66 % Detected problem language: tptp
% 0.10/5.67 % Proving...
% 2.32/6.54 % SZS status Started for theBenchmark.p
% 2.32/6.54 % SZS status Theorem for theBenchmark.p
% 2.32/6.54
% 2.32/6.54 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.32/6.54
% 2.32/6.54 % ------ iProver source info
% 2.32/6.54
% 2.32/6.54 % git: date: 2026-07-19 20:42:38 +0200
% 2.32/6.54 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.32/6.54 % git: non_committed_changes: false
% 2.32/6.54
% 2.32/6.54 % ------ Parsing...
% 2.32/6.54 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_eq
% 2.32/6.54 %
% 2.32/6.54
% 2.32/6.54 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.32/6.54
% 2.32/6.54 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_eq
% 2.32/6.54 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e % ------ preprocesses with Option_epr_non_horn_eq
% 2.32/6.54 %
% 2.32/6.54
% 2.32/6.54 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.32/6.54 % ------ Proving...
% 2.32/6.54 % ------ Problem Properties
% 2.32/6.54
% 2.32/6.54 %
% 2.32/6.54 % clauses 5
% 2.32/6.54 % conjectures 1
% 2.32/6.54 % EPR 5
% 2.32/6.54 % Horn 4
% 2.32/6.54 % unary 4
% 2.32/6.54 % binary 1
% 2.32/6.54 % lits 6
% 2.32/6.54 % lits eq 3
% 2.32/6.54 % fd_pure 1
% 2.32/6.54 % fd_pseudo 0
% 2.32/6.54 % fd_cond 0
% 2.32/6.54 % fd_pseudo_cond 0
% 2.32/6.54 % AC symbols 0
% 2.32/6.54
% 2.32/6.54 % ------ Schedule EPR non Horn eq is on
% 2.32/6.54
% 2.32/6.54 % ------ Option_epr_non_horn_eq Time Limit: Unbounded
% 2.32/6.54
% 2.32/6.54
% 2.32/6.54 % ------
% 2.32/6.54 % Current options:
% 2.32/6.54 % ------
% 2.32/6.54
% 2.32/6.54
% 2.32/6.54 %
% 2.32/6.54
% 2.32/6.54 % ------ Proving...
% 2.32/6.54 %
% 2.32/6.54
% 2.32/6.54 % SZS status Theorem for theBenchmark.p
% 2.32/6.54
% 2.32/6.54 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.32/6.54
% 2.32/6.54
%------------------------------------------------------------------------------