%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN071+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n019.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 1.27s 1.27s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 9 unt; 0 def)
% Number of atoms : 78 ( 77 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 84 ( 41 ~; 42 |; 1 &)
% ( 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn 15 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( c = d
| a = b ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel48_1) ).
fof(f2,axiom,
( b = d
| a = c ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel48_2) ).
fof(f3,conjecture,
( b = c
| a = d ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel48) ).
fof(f4,negated_conjecture,
~ ( b = c
| a = d ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
( b != c
& a != d ),
inference(ennf_transformation,[],[f4]) ).
fof(f6,plain,
( c = d
| a = b ),
inference(cnf_transformation,[],[f1]) ).
fof(f7,plain,
( b = d
| a = c ),
inference(cnf_transformation,[],[f2]) ).
fof(f8,plain,
b != c,
inference(cnf_transformation,[],[f5]) ).
fof(f9,plain,
a != d,
inference(cnf_transformation,[],[f5]) ).
tcf(c_49,plain,
( ( c = d )
| ( a = b ) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_50,plain,
( ( b = d )
| ( a = c ) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_51,negated_conjecture,
a != d,
inference(cnf_transformation,[],[f9]) ).
tcf(c_52,negated_conjecture,
b != c,
inference(cnf_transformation,[],[f8]) ).
tcf(c_63,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_66,plain,
! [X0: $i] :
( ( a = d )
| ( d != X0 )
| ( a != X0 ) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_68,plain,
! [X0: $i] :
( ( b = c )
| ( c != X0 )
| ( b != X0 ) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_69,plain,
( ( b = c )
| ( c != a )
| ( b != a ) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( ( d = X0 )
| ( d != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( ( c = X0 )
| ( c != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_74,plain,
! [X0: $i] :
( ( d = X0 )
| ( d != d )
| ( X0 != d ) ),
inference(instantiation,[status(thm)],[c_71]) ).
tcf(c_75,plain,
d = d,
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_77,plain,
! [X0: $i] :
( ( c = X0 )
| ( c != c )
| ( X0 != c ) ),
inference(instantiation,[status(thm)],[c_73]) ).
tcf(c_78,plain,
c = c,
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_79,plain,
( ( c = a )
| ( c != c )
| ( a != c ) ),
inference(instantiation,[status(thm)],[c_77]) ).
tcf(c_92,plain,
( ( d = b )
| ( d != d )
| ( b != d ) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_99,plain,
( ( a = d )
| ( d != b )
| ( a != b ) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_106,plain,
( ( d = c )
| ( d != d )
| ( c != d ) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_108,plain,
b = b,
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_109,plain,
! [X0: $i,X1: $i] :
( ( b = X0 )
| ( b != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_114,plain,
( ( a = d )
| ( d != c )
| ( a != c ) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_135,plain,
! [X0: $i] :
( ( b = X0 )
| ( b != b )
| ( X0 != b ) ),
inference(instantiation,[status(thm)],[c_109]) ).
tcf(c_136,plain,
( ( b = a )
| ( b != b )
| ( a != b ) ),
inference(instantiation,[status(thm)],[c_135]) ).
tcf(c_144,plain,
( ( b = c )
| ( c != d )
| ( b != d ) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_145,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_144,c_136,c_114,c_108,c_106,c_99,c_92,c_78,c_79,c_75,c_69,c_49,c_50,c_51,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN071+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 00:04:04 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 1.27/1.27 % SZS status Started for theBenchmark.p
% 1.27/1.27 % SZS status Theorem for theBenchmark.p
% 1.27/1.27
% 1.27/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.27/1.27
% 1.27/1.27 % ------ iProver source info
% 1.27/1.27
% 1.27/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.27/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.27/1.27 % git: non_committed_changes: false
% 1.27/1.27
% 1.27/1.27 % ------ Parsing...
% 1.27/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_eq
% 1.27/1.27 %
% 1.27/1.27
% 1.27/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.27/1.27
% 1.27/1.27 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_eq
% 1.27/1.27 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e % ------ preprocesses with Option_epr_non_horn_eq
% 1.27/1.27 %
% 1.27/1.27
% 1.27/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.27/1.27 % ------ Proving...
% 1.27/1.27 % ------ Problem Properties
% 1.27/1.27
% 1.27/1.27 %
% 1.27/1.27 % clauses 4
% 1.27/1.27 % conjectures 2
% 1.27/1.27 % EPR 4
% 1.27/1.27 % Horn 2
% 1.27/1.27 % unary 2
% 1.27/1.27 % binary 2
% 1.27/1.27 % lits 6
% 1.27/1.27 % lits eq 6
% 1.27/1.27 % fd_pure 0
% 1.27/1.27 % fd_pseudo 0
% 1.27/1.27 % fd_cond 0
% 1.27/1.27 % fd_pseudo_cond 0
% 1.27/1.27 % AC symbols 0
% 1.27/1.27
% 1.27/1.27 % ------ Schedule EPR non Horn eq is on
% 1.27/1.27
% 1.27/1.27 % ------ Option_epr_non_horn_eq Time Limit: Unbounded
% 1.27/1.27
% 1.27/1.27
% 1.27/1.27 % ------
% 1.27/1.27 % Current options:
% 1.27/1.27 % ------
% 1.27/1.27
% 1.27/1.27
% 1.27/1.27 %
% 1.27/1.27
% 1.27/1.27 % ------ Proving...
% 1.27/1.27 %
% 1.27/1.27
% 1.27/1.27 % SZS status Theorem for theBenchmark.p
% 1.27/1.27
% 1.27/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.27/1.28
% 1.27/1.28
%------------------------------------------------------------------------------