%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM479+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n011.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:25:10 PM UTC 2026
% Result : Theorem 7.37s 2.01s
% Output : CNFRefutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 23 unt; 0 def)
% Number of atoms : 89 ( 39 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 81 ( 34 ~; 25 |; 16 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 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; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).
fof(f36,axiom,
( aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1524) ).
fof(f38,axiom,
aNaturalNumber0(xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1553) ).
fof(f39,conjecture,
( ( xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) )
=> ( ( sdtasdt0(xn,xm) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))
& aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl)) )
=> sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f40,negated_conjecture,
~ ( ( xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) )
=> ( ( sdtasdt0(xn,xm) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))
& aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl)) )
=> sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) ) ),
inference(negated_conjecture,[status(cth)],[f39]) ).
fof(f53,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f54,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
inference(flattening,[],[f53]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f56,plain,
! [X0,X1,X2] :
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
inference(flattening,[],[f55]) ).
fof(f100,plain,
( xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl))
& sdtasdt0(xn,xm) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))
& aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl))
& sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) != sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) ),
inference(ennf_transformation,[],[f40]) ).
fof(f101,plain,
( xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl))
& sdtasdt0(xn,xm) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))
& aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl))
& sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) != sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) ),
inference(flattening,[],[f100]) ).
fof(f122,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f123,plain,
! [X2,X0,X1] :
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
inference(cnf_transformation,[],[f56]) ).
fof(f169,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f36]) ).
fof(f170,plain,
aNaturalNumber0(xl),
inference(cnf_transformation,[],[f36]) ).
fof(f175,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f38]) ).
fof(f176,plain,
xm = sdtasdt0(xl,sdtsldt0(xm,xl)),
inference(cnf_transformation,[],[f101]) ).
fof(f177,plain,
aNaturalNumber0(sdtsldt0(xm,xl)),
inference(cnf_transformation,[],[f101]) ).
fof(f178,plain,
sdtasdt0(xn,xm) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(cnf_transformation,[],[f101]) ).
fof(f180,plain,
sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) != sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)),
inference(cnf_transformation,[],[f101]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) )
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f123]) ).
tcf(c_104,plain,
aNaturalNumber0(xl),
inference(cnf_transformation,[],[f170]) ).
tcf(c_105,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f169]) ).
tcf(c_110,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f175]) ).
tcf(c_111,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(cnf_transformation,[],[f180]) ).
tcf(c_113,negated_conjecture,
sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) = sdtasdt0(xn,xm),
inference(cnf_transformation,[],[f178]) ).
tcf(c_114,negated_conjecture,
aNaturalNumber0(sdtsldt0(xm,xl)),
inference(cnf_transformation,[],[f177]) ).
tcf(c_115,negated_conjecture,
sdtasdt0(xl,sdtsldt0(xm,xl)) = xm,
inference(cnf_transformation,[],[f176]) ).
tcf(c_154,plain,
! [X0: $i] :
( ( sdtasdt0(X0,xn) = sdtasdt0(xn,X0) )
| ~ aNaturalNumber0(X0) ),
inference(superposition,[status(thm)],[c_110,c_58]) ).
tcf(c_162,plain,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xn,xm),
inference(light_normalisation,[status(thm)],[c_111,c_113]) ).
tcf(c_187,plain,
! [X0: $i,X1: $i] :
( ( sdtasdt0(sdtasdt0(xn,X0),X1) = sdtasdt0(xn,sdtasdt0(X0,X1)) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(superposition,[status(thm)],[c_110,c_59]) ).
tcf(c_252,plain,
sdtasdt0(xl,xn) = sdtasdt0(xn,xl),
inference(superposition,[status(thm)],[c_104,c_154]) ).
tcf(c_253,plain,
sdtasdt0(xm,xn) = sdtasdt0(xn,xm),
inference(superposition,[status(thm)],[c_105,c_154]) ).
tcf(c_259,plain,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xm,xn),
inference(demodulation,[status(thm)],[c_162,c_253]) ).
tcf(c_406,plain,
! [X0: $i] :
( ( sdtasdt0(sdtasdt0(xn,xl),X0) = sdtasdt0(xn,sdtasdt0(xl,X0)) )
| ~ aNaturalNumber0(X0) ),
inference(superposition,[status(thm)],[c_104,c_187]) ).
tcf(c_1203,plain,
! [X0: $i] :
( ( sdtasdt0(sdtasdt0(xl,xn),X0) = sdtasdt0(xn,sdtasdt0(xl,X0)) )
| ~ aNaturalNumber0(X0) ),
inference(light_normalisation,[status(thm)],[c_406,c_252]) ).
tcf(c_1213,plain,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xn,sdtasdt0(xl,sdtsldt0(xm,xl))),
inference(superposition,[status(thm)],[c_114,c_1203]) ).
tcf(c_1216,plain,
sdtasdt0(xn,sdtasdt0(xl,sdtsldt0(xm,xl))) != sdtasdt0(xm,xn),
inference(demodulation,[status(thm)],[c_259,c_1213]) ).
tcf(c_5896,plain,
sdtasdt0(xm,xn) != sdtasdt0(xm,xn),
inference(light_normalisation,[status(thm)],[c_1216,c_115,c_253]) ).
tcf(c_5897,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_5896]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM479+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.45 % Computer : n011.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Thu Sep 24 04:11:29 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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.22/0.53
% 0.22/0.53 % ======== iProver multi-core TPTP/SMT =========
% 0.22/0.53
% 0.22/0.53 % Detected problem language: tptp
% 0.22/0.55 % Proving...
% 7.37/2.01 % SZS status Started for theBenchmark.p
% 7.37/2.01 % SZS status Theorem for theBenchmark.p
% 7.37/2.01
% 7.37/2.01 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.37/2.01
% 7.37/2.01 % ------ iProver source info
% 7.37/2.01
% 7.37/2.01 % git: date: 2026-07-19 20:42:38 +0200
% 7.37/2.01 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.37/2.01 % git: non_committed_changes: false
% 7.37/2.01
% 7.37/2.01 % ------ Parsing...
% 7.37/2.01 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.37/2.01 % ------ Proving...
% 7.37/2.01 % ------ Problem Properties
% 7.37/2.01
% 7.37/2.01 %
% 7.37/2.01 % clauses 67
% 7.37/2.01 % conjectures 5
% 7.37/2.01 % EPR 17
% 7.37/2.01 % Horn 51
% 7.37/2.01 % unary 15
% 7.37/2.01 % binary 8
% 7.37/2.01 % lits 245
% 7.37/2.01 % lits eq 65
% 7.37/2.01 % fd_pure 0
% 7.37/2.01 % fd_pseudo 0
% 7.37/2.01 % fd_cond 7
% 7.37/2.01 % fd_pseudo_cond 13
% 7.37/2.01 % AC symbols 0
% 7.37/2.01
% 7.37/2.01 % ------ Input Options Time Limit: Unbounded
% 7.37/2.01
% 7.37/2.01
% 7.37/2.01 % ------
% 7.37/2.01 % Current options:
% 7.37/2.01 % ------
% 7.37/2.01
% 7.37/2.01
% 7.37/2.01 %
% 7.37/2.01
% 7.37/2.01 % ------ Proving...
% 7.37/2.01 %
% 7.37/2.01
% 7.37/2.01 % SZS status Theorem for theBenchmark.p
% 7.37/2.01
% 7.37/2.01 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.37/2.01
% 7.37/2.01
%------------------------------------------------------------------------------