%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT115+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n003.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:13:06 PM UTC 2026
% Result : Theorem 1.39s 1.16s
% Output : CNFRefutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 14 unt; 2 def)
% Number of atoms : 30 ( 23 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn 9 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( issue(X0) = issue(X1)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',issue_injective) ).
fof(f4,axiom,
pi1 != pi2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pi1_neq_pi2) ).
fof(f5,conjecture,
issue(pi1) != issue(pi2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture) ).
fof(f6,negated_conjecture,
~ ( issue(pi1) != issue(pi2) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
issue(pi1) = issue(pi2),
inference(flattening,[],[f6]) ).
fof(f10,plain,
! [X0,X1] :
( issue(X0) != issue(X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0,X1] :
( issue(X0) != issue(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f10]) ).
fof(f12,plain,
pi1 != pi2,
inference(cnf_transformation,[],[f4]) ).
fof(f13,plain,
issue(pi1) = issue(pi2),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( issue(X0) != issue(X1) ) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_50,plain,
pi1 != pi2,
inference(cnf_transformation,[],[f12]) ).
tcf(c_51,negated_conjecture,
issue(pi1) = issue(pi2),
inference(cnf_transformation,[],[f13]) ).
tcf(c_66,definition,
iPr_def_10 = issue(pi1),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_67,definition,
iPr_def_11 = issue(pi2),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_68,negated_conjecture,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_51,c_67,c_66]) ).
tcf(c_115,plain,
issue(pi2) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_67,c_68]) ).
tcf(c_121,plain,
! [X0: $i] :
( ( X0 = pi2 )
| ( issue(X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_115,c_49]) ).
tcf(c_132,plain,
pi1 = pi2,
inference(superposition,[status(thm)],[c_66,c_121]) ).
tcf(c_134,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_132,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT115+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n003.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 01:27:05 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.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.39/1.16 % SZS status Started for theBenchmark.p
% 1.39/1.16 % SZS status Theorem for theBenchmark.p
% 1.39/1.16
% 1.39/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.39/1.16
% 1.39/1.16 % ------ iProver source info
% 1.39/1.16
% 1.39/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 1.39/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.39/1.16 % git: non_committed_changes: false
% 1.39/1.16
% 1.39/1.16 % ------ Parsing...
% 1.39/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.39/1.16
% 1.39/1.16 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.39/1.16
% 1.39/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.39/1.16
% 1.39/1.16 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.39/1.16 % ------ Proving...
% 1.39/1.16 % ------ Problem Properties
% 1.39/1.16
% 1.39/1.16 %
% 1.39/1.16 % clauses 5
% 1.39/1.16 % conjectures 1
% 1.39/1.16 % EPR 2
% 1.39/1.16 % Horn 5
% 1.39/1.16 % unary 4
% 1.39/1.16 % binary 1
% 1.39/1.16 % lits 6
% 1.39/1.16 % lits eq 6
% 1.39/1.16 % fd_pure 0
% 1.39/1.16 % fd_pseudo 0
% 1.39/1.16 % fd_cond 0
% 1.39/1.16 % fd_pseudo_cond 1
% 1.39/1.16 % AC symbols 0
% 1.39/1.16
% 1.39/1.16 % ------ Schedule dynamic 5 is on
% 1.39/1.16
% 1.39/1.16 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.39/1.16
% 1.39/1.16
% 1.39/1.16 % ------
% 1.39/1.16 % Current options:
% 1.39/1.16 % ------
% 1.39/1.16
% 1.39/1.16
% 1.39/1.16 %
% 1.39/1.16
% 1.39/1.16 % ------ Proving...
% 1.39/1.16 %
% 1.39/1.16
% 1.39/1.16 % SZS status Theorem for theBenchmark.p
% 1.39/1.16
% 1.39/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.39/1.16
% 1.39/1.16
%------------------------------------------------------------------------------