%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD025-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n002.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:40 PM UTC 2026
% Result : Unsatisfiable 6.90s 1.75s
% Output : CNFRefutation 6.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 40 ( 15 unt; 0 def)
% Number of atoms : 87 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 96 ( 49 ~; 47 |; 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 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 32 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( ~ defined(X1)
| ~ defined(X0)
| equalish(multiply(X0,X1),multiply(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_multiplication) ).
fof(f22,axiom,
! [X0,X1] :
( ~ equalish(X1,X0)
| equalish(X0,X1) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
fof(f29,axiom,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
fof(f30,axiom,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
fof(f34,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b_7) ).
fof(f35,negated_conjecture,
equalish(c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_equals_d_8) ).
fof(f36,negated_conjecture,
equalish(multiply(a,c),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_u_9) ).
fof(f37,negated_conjecture,
equalish(multiply(d,b),v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_v_10) ).
fof(f38,negated_conjecture,
~ equalish(v,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_not_equal_to_u_11) ).
tcf(c_88,plain,
defined(b),
inference(cnf_transformation,[],[f29]) ).
tcf(c_89,plain,
defined(c),
inference(cnf_transformation,[],[f30]) ).
tcf(c_93,negated_conjecture,
equalish(a,b),
inference(cnf_transformation,[],[f34]) ).
tcf(c_94,negated_conjecture,
equalish(c,d),
inference(cnf_transformation,[],[f35]) ).
tcf(c_95,negated_conjecture,
equalish(multiply(a,c),u),
inference(cnf_transformation,[],[f36]) ).
tcf(c_96,negated_conjecture,
equalish(multiply(d,b),v),
inference(cnf_transformation,[],[f37]) ).
tcf(c_97,negated_conjecture,
~ equalish(v,u),
inference(cnf_transformation,[],[f38]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(X0,X2)
| ~ equalish(X1,X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_101,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_104,plain,
! [X0: $i,X1: $i] :
( equalish(multiply(X0,X1),multiply(X1,X0))
| ~ defined(X1)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_274,plain,
! [X0: $i] :
( equalish(v,u)
| ~ equalish(v,X0)
| ~ equalish(X0,u) ),
inference(instantiation,[status(thm)],[c_99]) ).
tcf(c_286,plain,
( equalish(v,u)
| ~ equalish(v,multiply(a,c))
| ~ equalish(multiply(a,c),u) ),
inference(instantiation,[status(thm)],[c_274]) ).
tcf(c_296,plain,
( equalish(v,multiply(a,c))
| ~ equalish(multiply(a,c),v) ),
inference(instantiation,[status(thm)],[c_100]) ).
tcf(c_320,plain,
! [X0: $i,X1: $i] :
( equalish(X0,v)
| ~ equalish(X1,v)
| ~ equalish(X0,X1) ),
inference(instantiation,[status(thm)],[c_99]) ).
tcf(c_437,plain,
! [X0: $i] :
( equalish(X0,v)
| ~ equalish(multiply(d,b),v)
| ~ equalish(X0,multiply(d,b)) ),
inference(instantiation,[status(thm)],[c_320]) ).
tcf(c_476,plain,
! [X0: $i,X1: $i] :
( equalish(X1,multiply(d,b))
| ~ equalish(X1,X0)
| ~ equalish(X0,multiply(d,b)) ),
inference(instantiation,[status(thm)],[c_99]) ).
tcf(c_478,plain,
! [X0: $i] :
( equalish(multiply(X0,b),multiply(d,b))
| ~ defined(b)
| ~ equalish(X0,d) ),
inference(instantiation,[status(thm)],[c_101]) ).
tcf(c_499,plain,
! [X0: $i,X1: $i] :
( equalish(multiply(a,c),X1)
| ~ equalish(X0,X1)
| ~ equalish(multiply(a,c),X0) ),
inference(instantiation,[status(thm)],[c_99]) ).
tcf(c_501,plain,
! [X0: $i] :
( equalish(multiply(a,c),multiply(X0,c))
| ~ defined(c)
| ~ equalish(a,X0) ),
inference(instantiation,[status(thm)],[c_101]) ).
tcf(c_904,plain,
( equalish(multiply(c,b),multiply(d,b))
| ~ defined(b)
| ~ equalish(c,d) ),
inference(instantiation,[status(thm)],[c_478]) ).
tcf(c_1069,plain,
( equalish(multiply(a,c),multiply(b,c))
| ~ defined(c)
| ~ equalish(a,b) ),
inference(instantiation,[status(thm)],[c_501]) ).
tcf(c_1977,plain,
! [X0: $i] :
( equalish(X0,multiply(d,b))
| ~ equalish(X0,multiply(c,b))
| ~ equalish(multiply(c,b),multiply(d,b)) ),
inference(instantiation,[status(thm)],[c_476]) ).
tcf(c_1989,plain,
! [X0: $i] :
( equalish(multiply(a,c),X0)
| ~ equalish(multiply(b,c),X0)
| ~ equalish(multiply(a,c),multiply(b,c)) ),
inference(instantiation,[status(thm)],[c_499]) ).
tcf(c_5399,plain,
( equalish(multiply(b,c),multiply(d,b))
| ~ equalish(multiply(c,b),multiply(d,b))
| ~ equalish(multiply(b,c),multiply(c,b)) ),
inference(instantiation,[status(thm)],[c_1977]) ).
tcf(c_5400,plain,
( equalish(multiply(b,c),multiply(c,b))
| ~ defined(c)
| ~ defined(b) ),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_14714,plain,
( equalish(multiply(a,c),multiply(d,b))
| ~ equalish(multiply(b,c),multiply(d,b))
| ~ equalish(multiply(a,c),multiply(b,c)) ),
inference(instantiation,[status(thm)],[c_1989]) ).
tcf(c_15247,plain,
( equalish(multiply(a,c),v)
| ~ equalish(multiply(d,b),v)
| ~ equalish(multiply(a,c),multiply(d,b)) ),
inference(instantiation,[status(thm)],[c_437]) ).
tcf(c_15248,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_15247,c_14714,c_5400,c_5399,c_1069,c_904,c_296,c_286,c_95,c_96,c_97,c_93,c_94,c_88,c_89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD025-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n002.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.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Fri Sep 25 10:44:19 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 6.90/1.75 % SZS status Started for theBenchmark.p
% 6.90/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 6.90/1.75
% 6.90/1.75 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.90/1.75
% 6.90/1.75 % ------ iProver source info
% 6.90/1.75
% 6.90/1.75 % git: date: 2026-07-19 20:42:38 +0200
% 6.90/1.75 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.90/1.75 % git: non_committed_changes: false
% 6.90/1.75
% 6.90/1.75 % ------ Parsing...% successful
% 6.90/1.75
% 6.90/1.75
% 6.90/1.75 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.90/1.75
% 6.90/1.75 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 6.90/1.75
% 6.90/1.75 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 6.90/1.75 % ------ Proving...
% 6.90/1.75 % ------ Problem Properties
% 6.90/1.75
% 6.90/1.75 %
% 6.90/1.75 % clauses 31
% 6.90/1.75 % conjectures 5
% 6.90/1.75 % EPR 17
% 6.90/1.75 % Horn 30
% 6.90/1.75 % unary 12
% 6.90/1.75 % binary 3
% 6.90/1.75 % lits 70
% 6.90/1.75 % lits eq 0
% 6.90/1.75 % fd_pure 0
% 6.90/1.75 % fd_pseudo 0
% 6.90/1.75 % fd_cond 0
% 6.90/1.75 % fd_pseudo_cond 0
% 6.90/1.75 % AC symbols 0
% 6.90/1.75
% 6.90/1.75 % ------ Schedule dynamic 5 is on
% 6.90/1.75
% 6.90/1.75 % ------ no equalities: superposition off
% 6.90/1.75
% 6.90/1.75 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.90/1.75
% 6.90/1.75
% 6.90/1.75 % ------
% 6.90/1.75 % Current options:
% 6.90/1.75 % ------
% 6.90/1.75
% 6.90/1.75
% 6.90/1.75 %
% 6.90/1.75
% 6.90/1.75 % ------ Proving...
% 6.90/1.75 %
% 6.90/1.75
% 6.90/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 6.90/1.75
% 6.90/1.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.90/1.75
% 6.90/1.75
%------------------------------------------------------------------------------