%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN071-1 : 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 : n005.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 : Unsatisfiable 1.54s 1.42s
% Output : CNFRefutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 9 unt; 0 def)
% Number of atoms : 68 ( 67 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 76 ( 38 ~; 38 |; 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 : 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/sandbox/benchmark/theBenchmark.p',clause_1) ).
fof(f2,axiom,
( b = d
| a = c ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
fof(f3,negated_conjecture,
a != d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
fof(f4,negated_conjecture,
b != c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
tcf(c_53,negated_conjecture,
a != d,
inference(cnf_transformation,[],[f3]) ).
tcf(c_54,negated_conjecture,
b != c,
inference(cnf_transformation,[],[f4]) ).
tcf(c_55,plain,
( ( b = d )
| ( a = c ) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,plain,
( ( c = d )
| ( a = b ) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_65,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_68,plain,
! [X0: $i] :
( ( a = d )
| ( d != X0 )
| ( a != X0 ) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_70,plain,
! [X0: $i] :
( ( b = c )
| ( c != X0 )
| ( b != X0 ) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_71,plain,
( ( b = c )
| ( c != a )
| ( b != a ) ),
inference(instantiation,[status(thm)],[c_70]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( ( d = X0 )
| ( d != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( ( c = X0 )
| ( c != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_76,plain,
! [X0: $i] :
( ( d = X0 )
| ( d != d )
| ( X0 != d ) ),
inference(instantiation,[status(thm)],[c_73]) ).
tcf(c_77,plain,
d = d,
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_79,plain,
! [X0: $i] :
( ( c = X0 )
| ( c != c )
| ( X0 != c ) ),
inference(instantiation,[status(thm)],[c_75]) ).
tcf(c_80,plain,
c = c,
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_81,plain,
( ( c = a )
| ( c != c )
| ( a != c ) ),
inference(instantiation,[status(thm)],[c_79]) ).
tcf(c_94,plain,
( ( d = b )
| ( d != d )
| ( b != d ) ),
inference(instantiation,[status(thm)],[c_76]) ).
tcf(c_101,plain,
( ( a = d )
| ( d != b )
| ( a != b ) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_108,plain,
( ( d = c )
| ( d != d )
| ( c != d ) ),
inference(instantiation,[status(thm)],[c_76]) ).
tcf(c_110,plain,
b = b,
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i] :
( ( b = X0 )
| ( b != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_116,plain,
( ( a = d )
| ( d != c )
| ( a != c ) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_137,plain,
! [X0: $i] :
( ( b = X0 )
| ( b != b )
| ( X0 != b ) ),
inference(instantiation,[status(thm)],[c_111]) ).
tcf(c_138,plain,
( ( b = a )
| ( b != b )
| ( a != b ) ),
inference(instantiation,[status(thm)],[c_137]) ).
tcf(c_146,plain,
( ( b = c )
| ( c != d )
| ( b != d ) ),
inference(instantiation,[status(thm)],[c_70]) ).
tcf(c_147,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_146,c_138,c_116,c_110,c_108,c_101,c_94,c_80,c_81,c_77,c_71,c_55,c_56,c_53,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN071-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.58 % Computer : n005.cluster.edu
% 0.09/0.58 % Model : x86_64 x86_64
% 0.09/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.58 % Memory : 8046.5625MB
% 0.09/0.58 % OS : Linux 6.8.0-71-generic
% 0.09/0.58 % CPULimit : 300
% 0.09/0.58 % WCLimit : 300
% 0.09/0.58 % DateTime : Fri Sep 25 00:04:03 UTC 2026
% 0.09/0.58 % CPUTime :
% 0.09/0.58 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.61 Running EPR theorem proving
% 0.09/0.62 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s epr_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.63
% 0.13/0.63 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.63
% 0.13/0.63 % Detected problem language: tptp
% 0.13/0.64 % Proving...
% 1.54/1.42 % SZS status Started for theBenchmark.p
% 1.54/1.42 % SZS status Unsatisfiable for theBenchmark.p
% 1.54/1.42
% 1.54/1.42 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.54/1.42
% 1.54/1.42 % ------ iProver source info
% 1.54/1.42
% 1.54/1.42 % git: date: 2026-07-19 20:42:38 +0200
% 1.54/1.42 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.54/1.42 % git: non_committed_changes: false
% 1.54/1.42
% 1.54/1.42 % ------ Parsing...% successful
% 1.54/1.42
% 1.54/1.42
% 1.54/1.42 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_eq
% 1.54/1.42 %
% 1.54/1.42
% 1.54/1.42 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.54/1.42
% 1.54/1.42 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_eq
% 1.54/1.42 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e % ------ preprocesses with Option_epr_non_horn_eq
% 1.54/1.42 %
% 1.54/1.42
% 1.54/1.42 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.54/1.42 % ------ Proving...
% 1.54/1.42 % ------ Problem Properties
% 1.54/1.42
% 1.54/1.42 %
% 1.54/1.42 % clauses 4
% 1.54/1.42 % conjectures 2
% 1.54/1.42 % EPR 4
% 1.54/1.42 % Horn 2
% 1.54/1.42 % unary 2
% 1.54/1.42 % binary 2
% 1.54/1.42 % lits 6
% 1.54/1.42 % lits eq 6
% 1.54/1.42 % fd_pure 0
% 1.54/1.42 % fd_pseudo 0
% 1.54/1.42 % fd_cond 0
% 1.54/1.42 % fd_pseudo_cond 0
% 1.54/1.42 % AC symbols 0
% 1.54/1.42
% 1.54/1.42 % ------ Schedule EPR non Horn eq is on
% 1.54/1.42
% 1.54/1.42 % ------ Option_epr_non_horn_eq Time Limit: Unbounded
% 1.54/1.42
% 1.54/1.42
% 1.54/1.42 % ------
% 1.54/1.42 % Current options:
% 1.54/1.42 % ------
% 1.54/1.42
% 1.54/1.42
% 1.54/1.42 %
% 1.54/1.42
% 1.54/1.42 % ------ Proving...
% 1.54/1.42 %
% 1.54/1.42
% 1.54/1.42 % SZS status Unsatisfiable for theBenchmark.p
% 1.54/1.42
% 1.54/1.42 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.54/1.42
% 1.54/1.42
%------------------------------------------------------------------------------