%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD071-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 : 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 01:15:54 PM UTC 2026
% Result : Unsatisfiable 2.13s 1.29s
% Output : CNFRefutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 45 ( 23 unt; 1 def)
% Number of atoms : 96 ( 1 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 80 ( 40 ~; 40 |; 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; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 32 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
fof(f16,axiom,
! [X0,X1] :
( ~ less_or_equal(X1,X0)
| ~ less_or_equal(X0,X1)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).
fof(f18,axiom,
! [X0,X1] :
( ~ defined(X1)
| ~ defined(X0)
| less_or_equal(X1,X0)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
fof(f20,axiom,
! [X0,X1] :
( ~ less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X0)
| less_or_equal(additive_identity,multiply(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_multiplication) ).
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(f26,axiom,
! [X2,X0,X1] :
( ~ equalish(X2,X0)
| ~ less_or_equal(X2,X1)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
fof(f30,axiom,
defined(u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_is_defined) ).
fof(f31,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).
fof(f32,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_5) ).
fof(f33,negated_conjecture,
equalish(multiply(a,b),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_equals_u_6) ).
fof(f34,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_7) ).
tcf(c_93,plain,
defined(additive_identity),
inference(cnf_transformation,[],[f11]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i] :
( equalish(X0,X1)
| ~ less_or_equal(X1,X0)
| ~ less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,X0)
| less_or_equal(X0,X1)
| ~ defined(X1)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_102,plain,
! [X0: $i,X1: $i] :
( less_or_equal(additive_identity,multiply(X0,X1))
| ~ less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X0) ),
inference(cnf_transformation,[],[f20]) ).
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_108,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_or_equal(X2,X1)
| ~ equalish(X0,X2)
| ~ less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_112,plain,
defined(u),
inference(cnf_transformation,[],[f30]) ).
tcf(c_113,negated_conjecture,
less_or_equal(additive_identity,a),
inference(cnf_transformation,[],[f31]) ).
tcf(c_114,negated_conjecture,
less_or_equal(additive_identity,b),
inference(cnf_transformation,[],[f32]) ).
tcf(c_115,negated_conjecture,
equalish(multiply(a,b),u),
inference(cnf_transformation,[],[f33]) ).
tcf(c_116,negated_conjecture,
~ less_or_equal(additive_identity,u),
inference(cnf_transformation,[],[f34]) ).
tcf(c_295,definition,
iPr_def_10 = multiply(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_296,negated_conjecture,
~ less_or_equal(additive_identity,u),
inference(demodulation,[status(thm)],[c_116]) ).
tcf(c_297,negated_conjecture,
equalish(iPr_def_10,u),
inference(demodulation,[status(thm)],[c_115,c_295]) ).
tcf(c_298,negated_conjecture,
less_or_equal(additive_identity,b),
inference(demodulation,[status(thm)],[c_114]) ).
tcf(c_299,negated_conjecture,
less_or_equal(additive_identity,a),
inference(demodulation,[status(thm)],[c_113]) ).
tcf(c_733,plain,
equalish(u,iPr_def_10),
inference(superposition,[status(thm)],[c_297,c_104]) ).
tcf(c_860,plain,
! [X0: $i] :
( equalish(u,X0)
| ~ equalish(iPr_def_10,X0) ),
inference(superposition,[status(thm)],[c_733,c_105]) ).
tcf(c_900,plain,
( equalish(u,additive_identity)
| ~ equalish(iPr_def_10,additive_identity) ),
inference(instantiation,[status(thm)],[c_860]) ).
tcf(c_1012,plain,
! [X0: $i] :
( less_or_equal(additive_identity,u)
| ~ equalish(X0,additive_identity)
| ~ less_or_equal(X0,u) ),
inference(instantiation,[status(thm)],[c_108]) ).
tcf(c_1029,plain,
( less_or_equal(u,additive_identity)
| ~ defined(additive_identity)
| ~ defined(u) ),
inference(superposition,[status(thm)],[c_100,c_296]) ).
tcf(c_1041,plain,
less_or_equal(u,additive_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_1029,c_93,c_112]) ).
tcf(c_1065,plain,
! [X0: $i] :
( less_or_equal(u,X0)
| less_or_equal(X0,u)
| ~ defined(u)
| ~ defined(X0) ),
inference(instantiation,[status(thm)],[c_100]) ).
tcf(c_1084,plain,
! [X0: $i] :
( less_or_equal(X0,additive_identity)
| ~ equalish(u,X0) ),
inference(superposition,[status(thm)],[c_1041,c_108]) ).
tcf(c_1320,plain,
( less_or_equal(additive_identity,iPr_def_10)
| ~ less_or_equal(additive_identity,b)
| ~ less_or_equal(additive_identity,a) ),
inference(superposition,[status(thm)],[c_295,c_102]) ).
tcf(c_1325,plain,
less_or_equal(additive_identity,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_1320,c_298,c_299]) ).
tcf(c_1343,plain,
( less_or_equal(u,u)
| ~ defined(u) ),
inference(instantiation,[status(thm)],[c_1065]) ).
tcf(c_1345,plain,
( less_or_equal(additive_identity,u)
| ~ equalish(u,additive_identity)
| ~ less_or_equal(u,u) ),
inference(instantiation,[status(thm)],[c_1012]) ).
tcf(c_2218,plain,
less_or_equal(iPr_def_10,additive_identity),
inference(superposition,[status(thm)],[c_733,c_1084]) ).
tcf(c_2238,plain,
( equalish(iPr_def_10,additive_identity)
| ~ less_or_equal(additive_identity,iPr_def_10) ),
inference(superposition,[status(thm)],[c_2218,c_98]) ).
tcf(c_2240,plain,
equalish(iPr_def_10,additive_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_2238,c_1325]) ).
tcf(c_2245,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2240,c_1345,c_1343,c_900,c_116,c_112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD071-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.12/0.37 % Computer : n005.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Fri Sep 25 11:04:32 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.42 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 2.13/1.29 % SZS status Started for theBenchmark.p
% 2.13/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.13/1.29
% 2.13/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.13/1.29
% 2.13/1.29 % ------ iProver source info
% 2.13/1.29
% 2.13/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.13/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.13/1.29 % git: non_committed_changes: false
% 2.13/1.29
% 2.13/1.29 % ------ Parsing...% successful
% 2.13/1.29
% 2.13/1.29
% 2.13/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.13/1.29
% 2.13/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.13/1.29
% 2.13/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.13/1.29
% 2.13/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.13/1.29 % ------ Proving...
% 2.13/1.29 % ------ Problem Properties
% 2.13/1.29
% 2.13/1.29 %
% 2.13/1.29 % clauses 35
% 2.13/1.29 % conjectures 4
% 2.13/1.29 % EPR 17
% 2.13/1.29 % Horn 32
% 2.13/1.29 % unary 11
% 2.13/1.29 % binary 6
% 2.13/1.29 % lits 81
% 2.13/1.29 % lits eq 1
% 2.13/1.29 % fd_pure 0
% 2.13/1.29 % fd_pseudo 0
% 2.13/1.29 % fd_cond 0
% 2.13/1.29 % fd_pseudo_cond 0
% 2.13/1.29 % AC symbols 0
% 2.13/1.29
% 2.13/1.29 % ------ Schedule dynamic 5 is on
% 2.13/1.29
% 2.13/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.13/1.29
% 2.13/1.29
% 2.13/1.29 % ------
% 2.13/1.29 % Current options:
% 2.13/1.29 % ------
% 2.13/1.29
% 2.13/1.29
% 2.13/1.29 %
% 2.13/1.29
% 2.13/1.29 % ------ Proving...
% 2.13/1.29 %
% 2.13/1.29
% 2.13/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.13/1.29
% 2.13/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.13/1.29
% 2.13/1.29
%------------------------------------------------------------------------------