%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LDA001-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 : n003.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 2.27s 1.28s
% Output : CNFRefutation 2.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 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 ( 2 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 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,
n2 = f(n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f3,axiom,
n3 = f(n2,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f4,axiom,
u = f(n2,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f5,negated_conjecture,
f(f(n3,n2),u) != f(f(u,u),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).
tcf(c_54,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_55,plain,
f(n1,n1) = n2,
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,plain,
f(n2,n1) = n3,
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,plain,
f(n2,n2) = u,
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,negated_conjecture,
f(f(n3,n2),u) != f(f(u,u),u),
inference(cnf_transformation,[],[f5]) ).
tcf(c_103,plain,
! [X0: $i] : f(n2,f(n1,X0)) = f(n1,f(n1,X0)),
inference(superposition,[status(thm)],[c_55,c_54]) ).
tcf(c_104,plain,
! [X0: $i] : f(n2,f(n1,X0)) = f(n3,f(n2,X0)),
inference(superposition,[status(thm)],[c_56,c_54]) ).
tcf(c_105,plain,
! [X0: $i] : f(n2,f(n2,X0)) = f(u,f(n2,X0)),
inference(superposition,[status(thm)],[c_57,c_54]) ).
tcf(c_107,plain,
! [X0: $i] : f(f(n1,X0),n2) = f(n1,f(X0,n1)),
inference(superposition,[status(thm)],[c_55,c_54]) ).
tcf(c_109,plain,
! [X0: $i] : f(f(n2,X0),u) = f(n2,f(X0,n2)),
inference(superposition,[status(thm)],[c_57,c_54]) ).
tcf(c_120,plain,
f(n2,n2) = f(n1,n2),
inference(superposition,[status(thm)],[c_55,c_103]) ).
tcf(c_125,plain,
f(n1,n2) = u,
inference(light_normalisation,[status(thm)],[c_120,c_57]) ).
tcf(c_150,plain,
f(n2,f(n1,n1)) = f(n3,n3),
inference(superposition,[status(thm)],[c_56,c_104]) ).
tcf(c_155,plain,
f(n3,n3) = u,
inference(light_normalisation,[status(thm)],[c_150,c_55,c_57]) ).
tcf(c_172,plain,
! [X0: $i] : f(f(n3,X0),u) = f(n3,f(X0,n3)),
inference(superposition,[status(thm)],[c_155,c_54]) ).
tcf(c_173,plain,
f(f(u,u),u) != f(n3,f(n2,n3)),
inference(demodulation,[status(thm)],[c_58,c_172]) ).
tcf(c_187,plain,
f(n2,u) = f(u,u),
inference(superposition,[status(thm)],[c_57,c_105]) ).
tcf(c_218,plain,
f(n1,f(n2,n1)) = f(u,n2),
inference(superposition,[status(thm)],[c_125,c_107]) ).
tcf(c_222,plain,
f(n1,n3) = f(u,n2),
inference(light_normalisation,[status(thm)],[c_218,c_56]) ).
tcf(c_273,plain,
$false,
inference(ground_joinability,[status(thm)],[c_173,c_104,c_109,c_187,c_222]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LDA001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.42 % Computer : n003.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Thu Sep 24 00:46:50 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.42 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.48 Running UEQ theorem proving
% 0.17/0.48 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.25/0.49
% 0.25/0.49 % ======== iProver multi-core TPTP/SMT =========
% 0.25/0.49
% 0.25/0.49 % Detected problem language: tptp
% 0.25/0.51 % Proving...
% 2.27/1.28 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.27/1.28 % SZS status Started for theBenchmark.p
% 2.27/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.27/1.28
% 2.27/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.27/1.28
% 2.27/1.28 % ------ iProver source info
% 2.27/1.28
% 2.27/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.27/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.27/1.28 % git: non_committed_changes: false
% 2.27/1.28
% 2.27/1.28 % ------ Parsing...% successful
% 2.27/1.28
% 2.27/1.28
% 2.27/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.27/1.28
% 2.27/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.27/1.28
% 2.27/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.27/1.28
% 2.27/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.27/1.28 % ------ Proving...
% 2.27/1.28 % ------ Problem Properties
% 2.27/1.28
% 2.27/1.28 %
% 2.27/1.28 % clauses 5
% 2.27/1.28 % conjectures 1
% 2.27/1.28 % EPR 0
% 2.27/1.28 % Horn 5
% 2.27/1.28 % unary 5
% 2.27/1.28 % binary 0
% 2.27/1.28 % lits 5
% 2.27/1.28 % lits eq 5
% 2.27/1.28 % fd_pure 0
% 2.27/1.28 % fd_pseudo 0
% 2.27/1.28 % fd_cond 0
% 2.27/1.28 % fd_pseudo_cond 0
% 2.27/1.28 % AC symbols 0
% 2.27/1.28
% 2.27/1.28 % ------ Input Options Time Limit: Unbounded
% 2.27/1.28
% 2.27/1.28
% 2.27/1.28 % ------
% 2.27/1.28 % Current options:
% 2.27/1.28 % ------
% 2.27/1.28
% 2.27/1.28
% 2.27/1.28 %
% 2.27/1.28
% 2.27/1.28 % ------ Proving...
% 2.27/1.28 %
% 2.27/1.28
% 2.27/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.27/1.28
% 2.27/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.27/1.28
% 2.27/1.28
%------------------------------------------------------------------------------