%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWX204-1 : TPTP v9.3.1. Released v9.3.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 03:32:50 PM UTC 2026
% Result : Unsatisfiable 1.44s 26.39s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 47 ( 47 unt; 1 def)
% Number of atoms : 52 ( 46 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : x2(z,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom) ).
fof(f2,axiom,
! [X0,X1] : x2(s(X0),X1) = s(x2(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_001) ).
fof(f3,axiom,
! [X0] : x22(z,X0) = z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).
fof(f4,plain,
! [X0] : z = x22(z,X0),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0,X1] : x22(s(X0),X1) = x2(X1,x22(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).
fof(f6,axiom,
! [X0] : mul_idem(X0) = eq(x22(X0,X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_004) ).
fof(f9,axiom,
eq2(btrue,bfalse) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_006) ).
fof(f10,plain,
bfalse = eq2(btrue,bfalse),
inference(reorient_equations,[],[f9]) ).
fof(f11,axiom,
! [X0,X1] : eq(s(X0),s(X1)) = eq(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_007) ).
fof(f14,axiom,
! [X0] : eq(s(X0),z) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_009) ).
fof(f15,plain,
! [X0] : bfalse = eq(s(X0),z),
inference(reorient_equations,[],[f14]) ).
fof(f18,axiom,
! [X0] : eq2(X0,X0) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_011) ).
fof(f19,plain,
! [X0] : btrue = eq2(X0,X0),
inference(reorient_equations,[],[f18]) ).
fof(f20,negated_conjecture,
! [X0] : eq2(mul_idem(X0),bfalse) != btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
fof(f21,plain,
! [X0] : btrue != eq2(mul_idem(X0),bfalse),
inference(reorient_equations,[],[f20]) ).
fof(f22,plain,
! [X0] : btrue != eq2(eq(x22(X0,X0),X0),bfalse),
inference(definition_unfolding,[],[f21,f6]) ).
tcf(c_62,plain,
! [X0: $i] : x2(z,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : x2(s(X0),X1) = s(x2(X0,X1)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_64,plain,
! [X0: $i] : x22(z,X0) = z,
inference(cnf_transformation,[],[f4]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] : x2(X0,x22(X1,X0)) = x22(s(X1),X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_67,plain,
eq2(btrue,bfalse) = bfalse,
inference(cnf_transformation,[],[f10]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : eq(s(X0),s(X1)) = eq(X0,X1),
inference(cnf_transformation,[],[f11]) ).
tcf(c_70,plain,
! [X0: $i] : eq(s(X0),z) = bfalse,
inference(cnf_transformation,[],[f15]) ).
tcf(c_72,plain,
! [X0: $i] : eq2(X0,X0) = btrue,
inference(cnf_transformation,[],[f19]) ).
tcf(c_73,negated_conjecture,
! [X0: $i] : eq2(eq(x22(X0,X0),X0),bfalse) != btrue,
inference(cnf_transformation,[],[f22]) ).
tcf(c_115,definition,
iPr_def_10 = eq2(btrue,bfalse),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_117,negated_conjecture,
! [X0: $i] : eq2(eq(x22(X0,X0),X0),bfalse) != btrue,
inference(demodulation,[status(thm)],[c_73]) ).
tcf(c_118,plain,
! [X0: $i] : eq2(X0,X0) = btrue,
inference(demodulation,[status(thm)],[c_72]) ).
tcf(c_120,plain,
! [X0: $i] : eq(s(X0),z) = bfalse,
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] : eq(s(X0),s(X1)) = eq(X0,X1),
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_123,plain,
iPr_def_10 = bfalse,
inference(demodulation,[status(thm)],[c_67,c_115]) ).
tcf(c_125,plain,
! [X0: $i,X1: $i] : x2(X0,x22(X1,X0)) = x22(s(X1),X0),
inference(demodulation,[status(thm)],[c_65]) ).
tcf(c_126,plain,
! [X0: $i] : x22(z,X0) = z,
inference(demodulation,[status(thm)],[c_64]) ).
tcf(c_127,plain,
! [X0: $i,X1: $i] : x2(s(X0),X1) = s(x2(X0,X1)),
inference(demodulation,[status(thm)],[c_63]) ).
tcf(c_128,plain,
! [X0: $i] : x2(z,X0) = X0,
inference(demodulation,[status(thm)],[c_62]) ).
tcf(c_208,plain,
! [X0: $i] : eq(s(X0),z) = iPr_def_10,
inference(demodulation,[status(thm)],[c_120,c_123]) ).
tcf(c_209,plain,
! [X0: $i] : eq2(eq(x22(X0,X0),X0),iPr_def_10) != btrue,
inference(demodulation,[status(thm)],[c_117,c_123]) ).
tcf(c_224,plain,
! [X0: $i] : x22(s(z),X0) = x2(X0,z),
inference(superposition,[status(thm)],[c_126,c_125]) ).
tcf(c_226,plain,
! [X0: $i,X1: $i] : s(x2(X0,x22(X1,s(X0)))) = x22(s(X1),s(X0)),
inference(superposition,[status(thm)],[c_125,c_127]) ).
tcf(c_247,plain,
! [X0: $i] : s(x2(X0,x2(s(X0),z))) = x22(s(s(z)),s(X0)),
inference(superposition,[status(thm)],[c_224,c_226]) ).
tcf(c_258,plain,
! [X0: $i] : s(x2(X0,s(x2(X0,z)))) = x22(s(s(z)),s(X0)),
inference(demodulation,[status(thm)],[c_247,c_127]) ).
tcf(c_339,plain,
! [X0: $i] : s(x2(s(X0),s(s(x2(X0,z))))) = x22(s(s(z)),s(s(X0))),
inference(superposition,[status(thm)],[c_127,c_258]) ).
tcf(c_493,plain,
! [X0: $i] : s(s(x2(X0,s(s(x2(X0,z)))))) = x22(s(s(z)),s(s(X0))),
inference(demodulation,[status(thm)],[c_339,c_127]) ).
tcf(c_734,plain,
s(s(x2(z,s(s(z))))) = x22(s(s(z)),s(s(z))),
inference(superposition,[status(thm)],[c_128,c_493]) ).
tcf(c_967,plain,
x22(s(s(z)),s(s(z))) = s(s(s(s(z)))),
inference(demodulation,[status(thm)],[c_734,c_128]) ).
tcf(c_1421,plain,
eq2(eq(s(s(s(s(z)))),s(s(z))),iPr_def_10) != btrue,
inference(superposition,[status(thm)],[c_967,c_209]) ).
tcf(c_1671,plain,
$false,
inference(ground_joinability,[status(thm)],[c_1421,c_122,c_118,c_208]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX204-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/25.58 % CPULimit : 300
% 0.10/25.59 % WCLimit : 300
% 0.10/25.59 % DateTime : Thu Sep 24 23:37:19 UTC 2026
% 0.10/25.59 % CPUTime :
% 0.10/25.59 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/25.61 Running UEQ theorem proving
% 0.10/25.61 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.35/25.63
% 0.35/25.63 % ======== iProver multi-core TPTP/SMT =========
% 0.35/25.63
% 0.35/25.63 % Detected problem language: tptp
% 0.35/25.64 % Proving...
% 1.44/26.39 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.44/26.39 % SZS status Started for theBenchmark.p
% 1.44/26.39 % SZS status Unsatisfiable for theBenchmark.p
% 1.44/26.39
% 1.44/26.39 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.44/26.39
% 1.44/26.39 % ------ iProver source info
% 1.44/26.39
% 1.44/26.39 % git: date: 2026-07-19 20:42:38 +0200
% 1.44/26.39 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.44/26.39 % git: non_committed_changes: false
% 1.44/26.39
% 1.44/26.39 % ------ Parsing...% successful
% 1.44/26.39
% 1.44/26.39
% 1.44/26.39 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.44/26.39
% 1.44/26.39 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.44/26.39
% 1.44/26.39 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.44/26.39
% 1.44/26.39 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.44/26.39 % ------ Proving...
% 1.44/26.39 % ------ Problem Properties
% 1.44/26.39
% 1.44/26.39 %
% 1.44/26.39 % clauses 14
% 1.44/26.39 % conjectures 1
% 1.44/26.39 % EPR 2
% 1.44/26.39 % Horn 14
% 1.44/26.39 % unary 14
% 1.44/26.39 % binary 0
% 1.44/26.39 % lits 14
% 1.44/26.39 % lits eq 14
% 1.44/26.39 % fd_pure 0
% 1.44/26.39 % fd_pseudo 0
% 1.44/26.39 % fd_cond 0
% 1.44/26.39 % fd_pseudo_cond 0
% 1.44/26.39 % AC symbols 0
% 1.44/26.39
% 1.44/26.39 % ------ Input Options Time Limit: Unbounded
% 1.44/26.39
% 1.44/26.39
% 1.44/26.39 % ------
% 1.44/26.39 % Current options:
% 1.44/26.39 % ------
% 1.44/26.39
% 1.44/26.39
% 1.44/26.39 %
% 1.44/26.39
% 1.44/26.39 % ------ Proving...
% 1.44/26.39 %
% 1.44/26.39
% 1.44/26.39 % SZS status Unsatisfiable for theBenchmark.p
% 1.44/26.39
% 1.44/26.39 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.44/26.39
% 1.44/26.39
%------------------------------------------------------------------------------