%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LDA003-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n013.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 02:10:56 PM UTC 2026
% Result : Unsatisfiable 3.64s 1.44s
% Output : CNFRefutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 18 unt; 0 def)
% Number of atoms : 18 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 14 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : f(X0,f(X1,X2)) = f(f(X0,X1),f(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).
fof(f2,axiom,
! [X0,X1] : left(X0,f(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a2) ).
fof(f4,axiom,
n2 = f(n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f5,axiom,
n3 = f(n2,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f6,axiom,
u = f(n2,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
fof(f7,negated_conjecture,
~ left(n3,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] : f(f(X0,X1),f(X0,X2)) = f(X0,f(X1,X2)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : left(X0,f(X0,X1)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_59,plain,
f(n1,n1) = n2,
inference(cnf_transformation,[],[f4]) ).
tcf(c_60,plain,
f(n2,n1) = n3,
inference(cnf_transformation,[],[f5]) ).
tcf(c_61,plain,
f(n2,n2) = u,
inference(cnf_transformation,[],[f6]) ).
tcf(c_62,negated_conjecture,
~ left(n3,u),
inference(cnf_transformation,[],[f7]) ).
tcf(c_91,negated_conjecture,
~ left(n3,u),
inference(demodulation,[status(thm)],[c_62]) ).
tcf(c_194,plain,
! [X0: $i,X1: $i,X2: $i] : left(f(X0,X1),f(X0,f(X1,X2))),
inference(superposition,[status(thm)],[c_56,c_57]) ).
tcf(c_314,plain,
! [X0: $i] : left(n3,f(n2,f(n1,X0))),
inference(superposition,[status(thm)],[c_60,c_194]) ).
tcf(c_350,plain,
left(n3,f(n2,n2)),
inference(superposition,[status(thm)],[c_59,c_314]) ).
tcf(c_354,plain,
left(n3,u),
inference(light_normalisation,[status(thm)],[c_350,c_61]) ).
tcf(c_355,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_354,c_91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LDA003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n013.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 00:44:36 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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.13/0.44
% 0.13/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.44
% 0.13/0.45 % Detected problem language: tptp
% 0.13/0.46 % Proving...
% 3.64/1.44 % SZS status Started for theBenchmark.p
% 3.64/1.44 % SZS status Unsatisfiable for theBenchmark.p
% 3.64/1.44
% 3.64/1.44 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.64/1.44
% 3.64/1.44 % ------ iProver source info
% 3.64/1.44
% 3.64/1.44 % git: date: 2026-07-19 20:42:38 +0200
% 3.64/1.44 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.64/1.44 % git: non_committed_changes: false
% 3.64/1.44
% 3.64/1.44 % ------ Parsing...% successful
% 3.64/1.44
% 3.64/1.44
% 3.64/1.44 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.64/1.44
% 3.64/1.44 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.64/1.44
% 3.64/1.44 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.64/1.44
% 3.64/1.44 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.64/1.44 % ------ Proving...
% 3.64/1.44 % ------ Problem Properties
% 3.64/1.44
% 3.64/1.44 %
% 3.64/1.44 % clauses 7
% 3.64/1.44 % conjectures 1
% 3.64/1.44 % EPR 2
% 3.64/1.44 % Horn 7
% 3.64/1.44 % unary 6
% 3.64/1.44 % binary 0
% 3.64/1.44 % lits 9
% 3.64/1.44 % lits eq 4
% 3.64/1.45 % fd_pure 0
% 3.64/1.45 % fd_pseudo 0
% 3.64/1.45 % fd_cond 0
% 3.64/1.45 % fd_pseudo_cond 0
% 3.64/1.45 % AC symbols 0
% 3.64/1.45
% 3.64/1.45 % ------ Schedule dynamic 5 is on
% 3.64/1.45
% 3.64/1.45 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.64/1.45
% 3.64/1.45
% 3.64/1.45 % ------
% 3.64/1.45 % Current options:
% 3.64/1.45 % ------
% 3.64/1.45
% 3.64/1.45
% 3.64/1.45 %
% 3.64/1.45
% 3.64/1.45 % ------ Proving...
% 3.64/1.45 %
% 3.64/1.45
% 3.64/1.45 % SZS status Unsatisfiable for theBenchmark.p
% 3.64/1.45
% 3.64/1.45 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.64/1.45
% 3.64/1.45
%------------------------------------------------------------------------------