%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN080+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 : n017.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:08 PM UTC 2026
% Result : Theorem 1.48s 1.28s
% Output : CNFRefutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 19 unt; 4 def)
% Number of atoms : 34 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 13 ( 0 sgn 11 !; 2 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : f(X0) = g(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel58_1) ).
fof(f2,conjecture,
! [X0,X1] : f(f(X0)) = f(g(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel58) ).
fof(f3,negated_conjecture,
~ ! [X0,X1] : f(f(X0)) = f(g(X1)),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
? [X0,X1] : f(f(X0)) != f(g(X1)),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
f(f(sK0)) != f(g(sK1)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f4]) ).
fof(f6,plain,
! [X0,X1] : f(X0) = g(X1),
inference(cnf_transformation,[],[f1]) ).
fof(f7,plain,
f(f(sK0)) != f(g(sK1)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : f(X0) = g(X1),
inference(cnf_transformation,[],[f6]) ).
tcf(c_50,negated_conjecture,
f(f(sK0)) != f(g(sK1)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_60,definition,
iPr_def_10 = f(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_61,definition,
iPr_def_11 = f(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_62,definition,
iPr_def_12 = g(sK1),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_63,definition,
iPr_def_13 = f(iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_64,negated_conjecture,
iPr_def_11 != iPr_def_13,
inference(demodulation,[status(thm)],[c_50,c_62,c_63,c_60,c_61]) ).
tcf(c_105,plain,
! [X0: $i] : f(X0) = iPr_def_12,
inference(superposition,[status(thm)],[c_49,c_62]) ).
tcf(c_108,plain,
iPr_def_11 = iPr_def_12,
inference(demodulation,[status(thm)],[c_61,c_105]) ).
tcf(c_109,plain,
iPr_def_12 = iPr_def_13,
inference(demodulation,[status(thm)],[c_63,c_105]) ).
tcf(c_110,plain,
iPr_def_11 != iPr_def_12,
inference(demodulation,[status(thm)],[c_64,c_109]) ).
tcf(c_111,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_108,c_110]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN080+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.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 00:02:31 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 1.48/1.28 % SZS status Started for theBenchmark.p
% 1.48/1.28 % SZS status Theorem for theBenchmark.p
% 1.48/1.28
% 1.48/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.48/1.28
% 1.48/1.28 % ------ iProver source info
% 1.48/1.28
% 1.48/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.48/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.48/1.28 % git: non_committed_changes: false
% 1.48/1.28
% 1.48/1.28 % ------ Parsing...
% 1.48/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_UEQ
% 1.48/1.28 %
% 1.48/1.28
% 1.48/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.48/1.28
% 1.48/1.28 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 1.48/1.28 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.48/1.28
% 1.48/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.48/1.28 % ------ Proving...
% 1.48/1.28 % ------ Problem Properties
% 1.48/1.28
% 1.48/1.28 %
% 1.48/1.28 % clauses 6
% 1.48/1.28 % conjectures 1
% 1.48/1.28 % EPR 1
% 1.48/1.28 % Horn 6
% 1.48/1.28 % unary 6
% 1.48/1.28 % binary 0
% 1.48/1.28 % lits 6
% 1.48/1.28 % lits eq 6
% 1.48/1.28 % fd_pure 0
% 1.48/1.28 % fd_pseudo 0
% 1.48/1.28 % fd_cond 0
% 1.48/1.28 % fd_pseudo_cond 0
% 1.48/1.28 % AC symbols 0
% 1.48/1.28
% 1.48/1.28 % ------ Schedule UEQ
% 1.48/1.28
% 1.48/1.28 % ------ Option_UEQ Time Limit: 10.
% 1.48/1.28
% 1.48/1.28
% 1.48/1.28 % ------
% 1.48/1.28 % Current options:
% 1.48/1.28 % ------
% 1.48/1.28
% 1.48/1.28
% 1.48/1.28 %
% 1.48/1.28
% 1.48/1.28 % ------ Proving...
% 1.48/1.28 %
% 1.48/1.28
% 1.48/1.28 % SZS status Theorem for theBenchmark.p
% 1.48/1.28
% 1.48/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.48/1.28
% 1.48/1.28
%------------------------------------------------------------------------------