%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD030-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n016.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:15:41 PM UTC 2026
% Result : Unsatisfiable 2.94s 1.28s
% Output : CNFRefutation 2.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 27 ( 15 unt; 2 def)
% Number of atoms : 66 ( 2 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 41 ( 22 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 19 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f22,axiom,
! [X0,X1] :
( ~ equalish(X1,X0)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
fof(f23,axiom,
! [X2,X0,X1] :
( ~ equalish(X2,X1)
| ~ equalish(X0,X2)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
fof(f25,axiom,
! [X2,X0,X1] :
( ~ equalish(X0,X2)
| ~ defined(X1)
| equalish(multiply(X0,X1),multiply(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
fof(f29,axiom,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
fof(f32,negated_conjecture,
equalish(multiply(a,b),c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_equals_c_5) ).
fof(f33,negated_conjecture,
equalish(a,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_d_6) ).
fof(f34,negated_conjecture,
~ equalish(multiply(d,b),c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_not_equal_to_c_7) ).
tcf(c_104,plain,
! [X0: $i,X1: $i] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_105,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(X0,X2)
| ~ equalish(X1,X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_107,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(multiply(X0,X2),multiply(X1,X2))
| ~ defined(X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_111,plain,
defined(b),
inference(cnf_transformation,[],[f29]) ).
tcf(c_114,negated_conjecture,
equalish(multiply(a,b),c),
inference(cnf_transformation,[],[f32]) ).
tcf(c_115,negated_conjecture,
equalish(a,d),
inference(cnf_transformation,[],[f33]) ).
tcf(c_116,negated_conjecture,
~ equalish(multiply(d,b),c),
inference(cnf_transformation,[],[f34]) ).
tcf(c_295,definition,
iPr_def_10 = multiply(d,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_296,definition,
iPr_def_11 = multiply(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_297,negated_conjecture,
~ equalish(iPr_def_10,c),
inference(demodulation,[status(thm)],[c_116,c_295]) ).
tcf(c_298,negated_conjecture,
equalish(a,d),
inference(demodulation,[status(thm)],[c_115]) ).
tcf(c_299,negated_conjecture,
equalish(iPr_def_11,c),
inference(demodulation,[status(thm)],[c_114,c_296]) ).
tcf(c_1062,plain,
! [X0: $i] :
( equalish(iPr_def_10,c)
| ~ equalish(iPr_def_10,X0)
| ~ equalish(X0,c) ),
inference(instantiation,[status(thm)],[c_105]) ).
tcf(c_1134,plain,
( equalish(iPr_def_10,c)
| ~ equalish(iPr_def_11,c)
| ~ equalish(iPr_def_10,iPr_def_11) ),
inference(instantiation,[status(thm)],[c_1062]) ).
tcf(c_1371,plain,
( equalish(iPr_def_10,iPr_def_11)
| ~ equalish(iPr_def_11,iPr_def_10) ),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_1775,plain,
! [X0: $i] :
( equalish(multiply(X0,b),iPr_def_10)
| ~ defined(b)
| ~ equalish(X0,d) ),
inference(superposition,[status(thm)],[c_295,c_107]) ).
tcf(c_1783,plain,
! [X0: $i] :
( equalish(multiply(X0,b),iPr_def_10)
| ~ equalish(X0,d) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1775,c_111]) ).
tcf(c_7254,plain,
( equalish(iPr_def_11,iPr_def_10)
| ~ equalish(a,d) ),
inference(superposition,[status(thm)],[c_296,c_1783]) ).
tcf(c_7260,plain,
equalish(iPr_def_11,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_7254,c_298]) ).
tcf(c_7269,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_7260,c_1371,c_1134,c_299,c_297]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD030-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n016.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Fri Sep 25 10:49:13 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/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.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...
% 2.94/1.28 % SZS status Started for theBenchmark.p
% 2.94/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.94/1.28
% 2.94/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.94/1.28
% 2.94/1.28 % ------ iProver source info
% 2.94/1.28
% 2.94/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.94/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.94/1.28 % git: non_committed_changes: false
% 2.94/1.28
% 2.94/1.28 % ------ Parsing...% successful
% 2.94/1.28
% 2.94/1.28
% 2.94/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.94/1.28
% 2.94/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.94/1.28
% 2.94/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.94/1.28
% 2.94/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.94/1.28 % ------ Proving...
% 2.94/1.28 % ------ Problem Properties
% 2.94/1.28
% 2.94/1.28 %
% 2.94/1.28 % clauses 36
% 2.94/1.28 % conjectures 3
% 2.94/1.28 % EPR 17
% 2.94/1.28 % Horn 33
% 2.94/1.28 % unary 12
% 2.94/1.28 % binary 6
% 2.94/1.28 % lits 82
% 2.94/1.28 % lits eq 2
% 2.94/1.28 % fd_pure 0
% 2.94/1.28 % fd_pseudo 0
% 2.94/1.28 % fd_cond 0
% 2.94/1.28 % fd_pseudo_cond 0
% 2.94/1.28 % AC symbols 0
% 2.94/1.28
% 2.94/1.28 % ------ Schedule dynamic 5 is on
% 2.94/1.28
% 2.94/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.94/1.28
% 2.94/1.28
% 2.94/1.28 % ------
% 2.94/1.28 % Current options:
% 2.94/1.28 % ------
% 2.94/1.28
% 2.94/1.28
% 2.94/1.28 %
% 2.94/1.28
% 2.94/1.28 % ------ Proving...
% 2.94/1.28 %
% 2.94/1.28
% 2.94/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.94/1.28
% 2.94/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.94/1.28
% 2.94/1.28
%------------------------------------------------------------------------------