%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWX190+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n014.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 03:32:47 PM UTC 2026
% Result : Theorem 3.74s 1.19s
% Output : CNFRefutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 36 unt; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 8 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 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 : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 43 !; 2 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1,X2] : n(X0) != x(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_008) ).
fof(f39,axiom,
! [X0] : d(n(X0)) = n(z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_039) ).
fof(f40,axiom,
! [X0,X1] : d(x(X0,X1)) = x(d(X0),d(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_040) ).
fof(f42,axiom,
d(x2) = n(s(z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_042) ).
fof(f50,axiom,
! [X0] : opt(x(n(z),X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_050) ).
fof(f54,conjecture,
? [X0] : opt(d(X0)) != opt(d(opt(X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_054) ).
fof(f55,negated_conjecture,
~ ? [X0] : opt(d(X0)) != opt(d(opt(X0))),
inference(negated_conjecture,[status(cth)],[f54]) ).
fof(f56,plain,
! [X0] : opt(d(X0)) = opt(d(opt(X0))),
inference(ennf_transformation,[],[f55]) ).
fof(f57,plain,
! [X0] : opt(d(X0)) = opt(d(opt(X0))),
inference(cnf_transformation,[],[f56]) ).
fof(f59,plain,
! [X0] : opt(x(n(z),X0)) = X0,
inference(cnf_transformation,[],[f50]) ).
fof(f60,plain,
n(s(z)) = d(x2),
inference(cnf_transformation,[],[f42]) ).
fof(f62,plain,
! [X0,X1] : d(x(X0,X1)) = x(d(X0),d(X1)),
inference(cnf_transformation,[],[f40]) ).
fof(f63,plain,
! [X0] : n(z) = d(n(X0)),
inference(cnf_transformation,[],[f39]) ).
fof(f67,plain,
! [X2,X0,X1] : n(X0) != x(X1,X2),
inference(cnf_transformation,[],[f8]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] : opt(d(opt(X0))) = opt(d(X0)),
inference(cnf_transformation,[],[f57]) ).
tcf(c_51,plain,
! [X0: $i] : opt(x(n(z),X0)) = X0,
inference(cnf_transformation,[],[f59]) ).
tcf(c_52,plain,
n(s(z)) = d(x2),
inference(cnf_transformation,[],[f60]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] : x(d(X0),d(X1)) = d(x(X0,X1)),
inference(cnf_transformation,[],[f62]) ).
tcf(c_55,plain,
! [X0: $i] : d(n(X0)) = n(z),
inference(cnf_transformation,[],[f63]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] : x(X0,X1) != n(X2),
inference(cnf_transformation,[],[f67]) ).
tcf(c_112,negated_conjecture,
! [X0: $i] : opt(d(opt(X0))) = opt(d(X0)),
inference(demodulation,[status(thm)],[c_49]) ).
tcf(c_239,plain,
d(d(x2)) = n(z),
inference(superposition,[status(thm)],[c_52,c_55]) ).
tcf(c_326,plain,
! [X0: $i] : opt(d(x(n(z),X0))) = opt(d(X0)),
inference(superposition,[status(thm)],[c_51,c_112]) ).
tcf(c_336,plain,
! [X0: $i,X1: $i] : d(x(n(X0),X1)) = x(n(z),d(X1)),
inference(superposition,[status(thm)],[c_55,c_54]) ).
tcf(c_337,plain,
! [X0: $i] : d(x(d(x2),X0)) = x(n(z),d(X0)),
inference(superposition,[status(thm)],[c_239,c_54]) ).
tcf(c_340,plain,
! [X0: $i,X1: $i,X2: $i] : d(x(X0,X1)) != n(X2),
inference(superposition,[status(thm)],[c_54,c_59]) ).
tcf(c_955,plain,
! [X0: $i,X1: $i] : d(x(n(X0),X1)) = d(x(d(x2),X1)),
inference(demodulation,[status(thm)],[c_336,c_337]) ).
tcf(c_956,plain,
! [X0: $i] : opt(d(x(d(x2),X0))) = opt(d(X0)),
inference(demodulation,[status(thm)],[c_326,c_955]) ).
tcf(c_1009,plain,
! [X0: $i] : opt(d(x(d(x2),X0))) = d(X0),
inference(superposition,[status(thm)],[c_337,c_51]) ).
tcf(c_1023,plain,
! [X0: $i] : opt(d(X0)) = d(X0),
inference(demodulation,[status(thm)],[c_956,c_1009]) ).
tcf(c_1024,plain,
! [X0: $i] : opt(d(opt(X0))) = d(X0),
inference(demodulation,[status(thm)],[c_112,c_1023]) ).
tcf(c_1050,plain,
! [X0: $i] : d(opt(X0)) = d(X0),
inference(demodulation,[status(thm)],[c_1024,c_1023]) ).
tcf(c_1052,plain,
! [X0: $i] : d(x(n(z),X0)) = d(X0),
inference(superposition,[status(thm)],[c_51,c_1050]) ).
tcf(c_1063,plain,
! [X0: $i] : d(x(d(x2),X0)) = d(X0),
inference(demodulation,[status(thm)],[c_1052,c_955]) ).
tcf(c_1079,plain,
! [X0: $i,X1: $i] : d(X0) != n(X1),
inference(superposition,[status(thm)],[c_1063,c_340]) ).
tcf(c_1083,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_55,c_1079]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX190+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n014.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.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 23:32:47 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/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.13/0.42
% 0.13/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.42
% 0.13/0.42 % Detected problem language: tptp
% 0.13/0.43 % Proving...
% 3.74/1.19 % SZS status Started for theBenchmark.p
% 3.74/1.19 % SZS status Theorem for theBenchmark.p
% 3.74/1.19
% 3.74/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.74/1.19
% 3.74/1.19 % ------ iProver source info
% 3.74/1.19
% 3.74/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.74/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.74/1.19 % git: non_committed_changes: false
% 3.74/1.19
% 3.74/1.19 % ------ Parsing...
% 3.74/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_UEQ
% 3.74/1.19 %
% 3.74/1.19
% 3.74/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.74/1.19
% 3.74/1.19 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 3.74/1.19 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.74/1.19
% 3.74/1.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.74/1.19 % ------ Proving...
% 3.74/1.19 % ------ Problem Properties
% 3.74/1.19
% 3.74/1.19 %
% 3.74/1.19 % clauses 14
% 3.74/1.19 % conjectures 1
% 3.74/1.19 % EPR 0
% 3.74/1.19 % Horn 14
% 3.74/1.19 % unary 14
% 3.74/1.19 % binary 0
% 3.74/1.19 % lits 14
% 3.74/1.19 % lits eq 14
% 3.74/1.19 % fd_pure 0
% 3.74/1.19 % fd_pseudo 0
% 3.74/1.19 % fd_cond 0
% 3.74/1.19 % fd_pseudo_cond 0
% 3.74/1.19 % AC symbols 0
% 3.74/1.19
% 3.74/1.19 % ------ Schedule UEQ
% 3.74/1.19
% 3.74/1.19 % ------ Option_UEQ Time Limit: 10.
% 3.74/1.19
% 3.74/1.19
% 3.74/1.19 % ------
% 3.74/1.19 % Current options:
% 3.74/1.19 % ------
% 3.74/1.19
% 3.74/1.19
% 3.74/1.19 %
% 3.74/1.19
% 3.74/1.19 % ------ Proving...
% 3.74/1.19 %
% 3.74/1.19
% 3.74/1.19 % SZS status Theorem for theBenchmark.p
% 3.74/1.19
% 3.74/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.74/1.19
% 3.74/1.19
%------------------------------------------------------------------------------