%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT019-3 : 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 : n012.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:01:12 PM UTC 2026
% Result : Unsatisfiable 1.96s 1.06s
% Output : CNFRefutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 68 ( 50 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 69 ( 30 ~; 39 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 24 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0,X1] :
( X0 = X1
| there_exists(f1(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',indiscernibles1) ).
fof(f16,axiom,
! [X0,X1] :
( X0 = X1
| X1 = f1(X0,X1)
| X0 = f1(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',indiscernibles2) ).
fof(f17,plain,
! [X0,X1] :
( X0 = X1
| f1(X0,X1) = X1
| f1(X0,X1) = X0 ),
inference(reorient_equations,[],[f16]) ).
fof(f20,axiom,
! [X0] :
( b = X0
| a != X0
| ~ there_exists(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality_of_a_and_b1) ).
fof(f21,axiom,
! [X0] :
( b != X0
| a = X0
| ~ there_exists(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality_of_a_and_b2) ).
fof(f22,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_equals_b) ).
fof(f25,plain,
( a = b
| ~ there_exists(a) ),
inference(equality_resolution,[],[f20]) ).
fof(f26,plain,
( a = b
| ~ there_exists(b) ),
inference(equality_resolution,[],[f21]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i] :
( there_exists(f1(X0,X1))
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( f1(X0,X1) = X1 )
| ( f1(X0,X1) = X0 ) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_86,plain,
( ( a = b )
| ~ there_exists(a) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_87,plain,
( ( a = b )
| ~ there_exists(b) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_88,negated_conjecture,
a != b,
inference(cnf_transformation,[],[f22]) ).
tcf(c_345,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_347,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_348,plain,
! [X0: $i,X1: $i] :
( there_exists(X0)
| ~ there_exists(X1)
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_351,plain,
a = a,
inference(instantiation,[status(thm)],[c_345]) ).
tcf(c_610,plain,
( there_exists(f1(a,b))
| ( a = b ) ),
inference(instantiation,[status(thm)],[c_83]) ).
tcf(c_632,plain,
( ( a = b )
| ( f1(a,b) = b )
| ( f1(a,b) = a ) ),
inference(instantiation,[status(thm)],[c_84]) ).
tcf(c_652,plain,
! [X0: $i] :
( there_exists(X0)
| ~ there_exists(f1(a,b))
| ( X0 != f1(a,b) ) ),
inference(instantiation,[status(thm)],[c_348]) ).
tcf(c_653,plain,
( there_exists(a)
| ~ there_exists(f1(a,b))
| ( a != f1(a,b) ) ),
inference(instantiation,[status(thm)],[c_652]) ).
tcf(c_691,plain,
! [X0: $i,X1: $i] :
( ( b = X0 )
| ( b != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_347]) ).
tcf(c_748,plain,
! [X0: $i,X1: $i] :
( ( X1 = f1(a,b) )
| ( X1 != X0 )
| ( f1(a,b) != X0 ) ),
inference(instantiation,[status(thm)],[c_347]) ).
tcf(c_749,plain,
( ( a = f1(a,b) )
| ( a != a )
| ( f1(a,b) != a ) ),
inference(instantiation,[status(thm)],[c_748]) ).
tcf(c_953,plain,
! [X0: $i] :
( ( b = X0 )
| ( b != b )
| ( X0 != b ) ),
inference(instantiation,[status(thm)],[c_691]) ).
tcf(c_954,plain,
b = b,
inference(instantiation,[status(thm)],[c_345]) ).
tcf(c_1209,plain,
( there_exists(b)
| ~ there_exists(f1(a,b))
| ( b != f1(a,b) ) ),
inference(instantiation,[status(thm)],[c_652]) ).
tcf(c_1288,plain,
( ( b = f1(a,b) )
| ( b != b )
| ( f1(a,b) != b ) ),
inference(instantiation,[status(thm)],[c_953]) ).
tcf(c_1289,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1288,c_1209,c_954,c_749,c_653,c_632,c_610,c_351,c_86,c_87,c_88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : CAT019-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Fri Sep 25 06:58:05 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.03/0.33
% 0.03/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.33
% 0.03/0.33 % Detected problem language: tptp
% 0.07/0.33 % Proving...
% 1.96/1.06 % SZS status Started for theBenchmark.p
% 1.96/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 1.96/1.06
% 1.96/1.06 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.96/1.06
% 1.96/1.06 % ------ iProver source info
% 1.96/1.06
% 1.96/1.06 % git: date: 2026-07-19 20:42:38 +0200
% 1.96/1.06 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.96/1.06 % git: non_committed_changes: false
% 1.96/1.06
% 1.96/1.06 % ------ Parsing...% successful
% 1.96/1.06
% 1.96/1.06
% 1.96/1.06 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.96/1.06
% 1.96/1.06 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.96/1.06
% 1.96/1.06 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.96/1.06
% 1.96/1.06 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.96/1.06 % ------ Proving...
% 1.96/1.06 % ------ Problem Properties
% 1.96/1.06
% 1.96/1.06 %
% 1.96/1.06 % clauses 15
% 1.96/1.06 % conjectures 1
% 1.96/1.06 % EPR 3
% 1.96/1.06 % Horn 13
% 1.96/1.06 % unary 6
% 1.96/1.06 % binary 6
% 1.96/1.06 % lits 27
% 1.96/1.06 % lits eq 13
% 1.96/1.06 % fd_pure 0
% 1.96/1.06 % fd_pseudo 0
% 1.96/1.06 % fd_cond 0
% 1.96/1.06 % fd_pseudo_cond 2
% 1.96/1.06 % AC symbols 0
% 1.96/1.06
% 1.96/1.06 % ------ Schedule dynamic 5 is on
% 1.96/1.06
% 1.96/1.06 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.96/1.06
% 1.96/1.06
% 1.96/1.06 % ------
% 1.96/1.06 % Current options:
% 1.96/1.06 % ------
% 1.96/1.06
% 1.96/1.06
% 1.96/1.06 %
% 1.96/1.06
% 1.96/1.06 % ------ Proving...
% 1.96/1.06 %
% 1.96/1.06
% 1.96/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 1.96/1.06
% 1.96/1.06 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.96/1.06
% 1.96/1.06
%------------------------------------------------------------------------------