%------------------------------------------------------------------------------
% 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 : n018.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 : Unsatisfiable 10.70s 2.29s
% Output : CNFRefutation 10.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 53 ( 53 unt; 0 def)
% Number of atoms : 53 ( 52 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 9 ( 9 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 8 ( 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 : 16 ( 16 usr; 4 con; 0-3 aty)
% Number of variables : 86 ( 0 sgn 86 !; 0 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : aux(n(X0),X1,bfalse) = x(opt(n(X0)),opt(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_002) ).
fof(f6,axiom,
! [X0,X1] : fail2(X0,X1) = aux(X0,X1,eq2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_005) ).
fof(f8,axiom,
! [X2,X0,X1] : fail1(n(X0),x(X1,X2)) = fail2(n(X0),x(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_007) ).
fof(f15,axiom,
! [X0] : fail(X0,n(z)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_014) ).
fof(f16,axiom,
! [X2,X0,X1] : fail(X0,x(X1,X2)) = fail1(X0,x(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_015) ).
fof(f45,axiom,
! [X0] : d(n(X0)) = n(z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_043) ).
fof(f46,plain,
! [X0] : n(z) = d(n(X0)),
inference(reorient_equations,[],[f45]) ).
fof(f47,axiom,
! [X0,X1] : d(x(X0,X1)) = x(d(X0),d(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_044) ).
fof(f49,axiom,
d(x2) = n(s(z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_046) ).
fof(f50,plain,
n(s(z)) = d(x2),
inference(reorient_equations,[],[f49]) ).
fof(f56,axiom,
! [X0,X1] : opt(x(n(s(X0)),X1)) = fail(n(s(X0)),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_051) ).
fof(f57,axiom,
! [X0] : opt(x(n(z),X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_052) ).
fof(f67,axiom,
! [X0] : opt(n(X0)) = n(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_061) ).
fof(f68,plain,
! [X0] : n(X0) = opt(n(X0)),
inference(reorient_equations,[],[f67]) ).
fof(f71,axiom,
! [X0] : prop4(X0) = eq2(opt(d(X0)),opt(d(opt(X0)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_063) ).
fof(f85,axiom,
! [X2,X0,X1] : eq2(n(X0),x(X1,X2)) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_071) ).
fof(f86,plain,
! [X2,X0,X1] : bfalse = eq2(n(X0),x(X1,X2)),
inference(reorient_equations,[],[f85]) ).
fof(f91,axiom,
! [X2,X0,X1] : eq2(x(X0,X1),n(X2)) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_074) ).
fof(f92,plain,
! [X2,X0,X1] : bfalse = eq2(x(X0,X1),n(X2)),
inference(reorient_equations,[],[f91]) ).
fof(f119,axiom,
! [X0] : eq3(X0,X0) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_088) ).
fof(f120,plain,
! [X0] : btrue = eq3(X0,X0),
inference(reorient_equations,[],[f119]) ).
fof(f121,negated_conjecture,
! [X0] : eq3(prop4(X0),bfalse) != btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
fof(f122,plain,
! [X0] : btrue != eq3(prop4(X0),bfalse),
inference(reorient_equations,[],[f121]) ).
fof(f123,plain,
! [X0] : btrue != eq3(eq2(opt(d(X0)),opt(d(opt(X0)))),bfalse),
inference(definition_unfolding,[],[f122,f71]) ).
fof(f129,plain,
! [X2,X0,X1] : fail1(n(X0),x(X1,X2)) = aux(n(X0),x(X1,X2),eq2(n(X0),x(X1,X2))),
inference(definition_unfolding,[],[f8,f6]) ).
tcf(c_139,negated_conjecture,
! [X0: $i] : eq3(eq2(opt(d(X0)),opt(d(opt(X0)))),bfalse) != btrue,
inference(cnf_transformation,[],[f123]) ).
tcf(c_152,plain,
! [X0: $i,X1: $i,X2: $i] : eq2(x(X0,X1),n(X2)) = bfalse,
inference(cnf_transformation,[],[f92]) ).
tcf(c_155,plain,
! [X0: $i,X1: $i,X2: $i] : eq2(n(X0),x(X1,X2)) = bfalse,
inference(cnf_transformation,[],[f86]) ).
tcf(c_158,plain,
! [X0: $i] : eq3(X0,X0) = btrue,
inference(cnf_transformation,[],[f120]) ).
tcf(c_163,plain,
! [X0: $i,X1: $i] : x(opt(n(X0)),opt(X1)) = aux(n(X0),X1,bfalse),
inference(cnf_transformation,[],[f3]) ).
tcf(c_166,plain,
! [X0: $i] : opt(x(n(z),X0)) = X0,
inference(cnf_transformation,[],[f57]) ).
tcf(c_174,plain,
! [X0: $i] : opt(n(X0)) = n(X0),
inference(cnf_transformation,[],[f68]) ).
tcf(c_175,plain,
n(s(z)) = d(x2),
inference(cnf_transformation,[],[f50]) ).
tcf(c_177,plain,
! [X0: $i,X1: $i] : x(d(X0),d(X1)) = d(x(X0,X1)),
inference(cnf_transformation,[],[f47]) ).
tcf(c_178,plain,
! [X0: $i] : d(n(X0)) = n(z),
inference(cnf_transformation,[],[f46]) ).
tcf(c_184,plain,
! [X0: $i,X1: $i,X2: $i] : aux(n(X0),x(X1,X2),eq2(n(X0),x(X1,X2))) = fail1(n(X0),x(X1,X2)),
inference(cnf_transformation,[],[f129]) ).
tcf(c_198,plain,
! [X0: $i,X1: $i,X2: $i] : fail1(X0,x(X1,X2)) = fail(X0,x(X1,X2)),
inference(cnf_transformation,[],[f16]) ).
tcf(c_208,plain,
! [X0: $i,X1: $i] : opt(x(n(s(X0)),X1)) = fail(n(s(X0)),X1),
inference(cnf_transformation,[],[f56]) ).
tcf(c_209,plain,
! [X0: $i] : fail(X0,n(z)) = X0,
inference(cnf_transformation,[],[f15]) ).
tcf(c_430,plain,
! [X0: $i,X1: $i] : aux(n(X0),X1,bfalse) = x(n(X0),opt(X1)),
inference(light_normalisation,[status(thm)],[c_163,c_174]) ).
tcf(c_447,plain,
! [X0: $i,X1: $i,X2: $i] : aux(n(X0),x(X1,X2),bfalse) = fail1(n(X0),x(X1,X2)),
inference(light_normalisation,[status(thm)],[c_184,c_155]) ).
tcf(c_448,plain,
! [X0: $i,X1: $i,X2: $i] : x(n(X0),opt(x(X1,X2))) = fail1(n(X0),x(X1,X2)),
inference(demodulation,[status(thm)],[c_447,c_430]) ).
tcf(c_755,plain,
d(d(x2)) = n(z),
inference(superposition,[status(thm)],[c_175,c_178]) ).
tcf(c_829,plain,
! [X0: $i,X1: $i] : d(x(n(X0),X1)) = x(n(z),d(X1)),
inference(superposition,[status(thm)],[c_178,c_177]) ).
tcf(c_830,plain,
! [X0: $i] : x(n(z),d(X0)) = d(x(d(x2),X0)),
inference(superposition,[status(thm)],[c_755,c_177]) ).
tcf(c_1959,plain,
! [X0: $i] : opt(x(d(x2),X0)) = fail(d(x2),X0),
inference(superposition,[status(thm)],[c_175,c_208]) ).
tcf(c_1961,plain,
! [X0: $i,X1: $i] : eq3(eq2(opt(d(x(n(s(X0)),X1))),opt(d(fail(n(s(X0)),X1)))),bfalse) != btrue,
inference(superposition,[status(thm)],[c_208,c_139]) ).
tcf(c_2075,plain,
! [X0: $i,X1: $i] : eq3(eq2(d(X0),opt(d(fail(n(s(X1)),X0)))),bfalse) != btrue,
inference(demodulation,[status(thm)],[c_1961,c_166,c_829]) ).
tcf(c_5766,plain,
! [X0: $i,X1: $i] : x(n(X0),fail(d(x2),X1)) = fail1(n(X0),x(d(x2),X1)),
inference(superposition,[status(thm)],[c_1959,c_448]) ).
tcf(c_6189,plain,
! [X0: $i,X1: $i] : eq3(eq2(x(n(z),d(X0)),opt(d(fail(n(s(X1)),x(d(x2),X0))))),bfalse) != btrue,
inference(superposition,[status(thm)],[c_830,c_2075]) ).
tcf(c_7967,plain,
! [X0: $i] : eq3(eq2(x(n(z),d(X0)),d(fail(d(x2),X0))),bfalse) != btrue,
inference(demodulation,[status(thm)],[c_6189,c_198,c_166,c_829,c_5766]) ).
tcf(c_7975,plain,
eq3(eq2(x(n(z),d(n(z))),d(d(x2))),bfalse) != btrue,
inference(superposition,[status(thm)],[c_209,c_7967]) ).
tcf(c_7980,plain,
$false,
inference(ground_joinability,[status(thm)],[c_7975,c_152,c_158,c_755]) ).
%------------------------------------------------------------------------------
%----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.13/0.37 % Computer : n018.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Thu Sep 24 23:35:19 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.41 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...
% 10.70/2.29 % SZS status Started for theBenchmark.p
% 10.70/2.29 % SZS status Unsatisfiable for theBenchmark.p
% 10.70/2.29
% 10.70/2.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.70/2.29
% 10.70/2.29 % ------ iProver source info
% 10.70/2.29
% 10.70/2.29 % git: date: 2026-07-19 20:42:38 +0200
% 10.70/2.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.70/2.29 % git: non_committed_changes: false
% 10.70/2.29
% 10.70/2.29 % ------ Parsing...% successful
% 10.70/2.29
% 10.70/2.29
% 10.70/2.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 10.70/2.29
% 10.70/2.29 % ------ Preprocessing... sup_sim: 7 sf_s rm: 0 0s sf_e pe_s pe_e %
% 10.70/2.29
% 10.70/2.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 10.70/2.29
% 10.70/2.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 10.70/2.29 % ------ Proving...
% 10.70/2.29 % ------ Problem Properties
% 10.70/2.29
% 10.70/2.29 %
% 10.70/2.29 % clauses 71
% 10.70/2.29 % conjectures 1
% 10.70/2.29 % EPR 0
% 10.70/2.29 % Horn 71
% 10.70/2.29 % unary 67
% 10.70/2.29 % binary 4
% 10.70/2.29 % lits 75
% 10.70/2.29 % lits eq 75
% 10.70/2.29 % fd_pure 0
% 10.70/2.29 % fd_pseudo 0
% 10.70/2.29 % fd_cond 0
% 10.70/2.29 % fd_pseudo_cond 0
% 10.70/2.29 % AC symbols 0
% 10.70/2.29
% 10.70/2.29 % ------ Schedule dynamic 5 is on
% 10.70/2.29
% 10.70/2.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.70/2.29
% 10.70/2.29
% 10.70/2.29 % ------
% 10.70/2.29 % Current options:
% 10.70/2.29 % ------
% 10.70/2.29
% 10.70/2.29
% 10.70/2.29 %
% 10.70/2.29
% 10.70/2.29 % ------ Proving...
% 10.70/2.29 %
% 10.70/2.29
% 10.70/2.29 % SZS status Unsatisfiable for theBenchmark.p
% 10.70/2.29
% 10.70/2.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.70/2.29
% 10.70/2.29
%------------------------------------------------------------------------------