%------------------------------------------------------------------------------
% 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/sandbox/benchmark/theBenchmark.p THM
% Computer : n016.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:49 PM UTC 2026
% Result : Theorem 4.38s 6.54s
% Output : CNFRefutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 34 unt; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 35 !; 2 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : proj1S(s(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_001) ).
fof(f2,axiom,
! [X0] : z != s(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_002) ).
fof(f3,axiom,
! [X0] : x2(z,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_003) ).
fof(f4,axiom,
! [X0,X1] : x2(s(X1),X0) = s(x2(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_004) ).
fof(f5,axiom,
! [X0] : x22(z,X0) = z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_005) ).
fof(f6,axiom,
! [X0,X1] : x22(s(X1),X0) = x2(X0,x22(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_006) ).
fof(f7,conjecture,
? [X0] : x22(X0,X0) != X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_007) ).
fof(f8,negated_conjecture,
~ ? [X0] : x22(X0,X0) != X0,
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,plain,
! [X0] : x22(X0,X0) = X0,
inference(ennf_transformation,[],[f8]) ).
fof(f10,plain,
! [X0] : proj1S(s(X0)) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0] : s(X0) != z,
inference(cnf_transformation,[],[f2]) ).
fof(f12,plain,
! [X0] : x2(z,X0) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0,X1] : x2(s(X1),X0) = s(x2(X1,X0)),
inference(cnf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0] : z = x22(z,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f15,plain,
! [X0,X1] : x22(s(X1),X0) = x2(X0,x22(X1,X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f16,plain,
! [X0] : x22(X0,X0) = X0,
inference(cnf_transformation,[],[f9]) ).
tcf(c_49,plain,
! [X0: $i] : proj1S(s(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_50,plain,
! [X0: $i] : s(X0) != z,
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,plain,
! [X0: $i] : x2(z,X0) = X0,
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : s(x2(X0,X1)) = x2(s(X0),X1),
inference(cnf_transformation,[],[f13]) ).
tcf(c_53,plain,
! [X0: $i] : x22(z,X0) = z,
inference(cnf_transformation,[],[f14]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] : x2(X0,x22(X1,X0)) = x22(s(X1),X0),
inference(cnf_transformation,[],[f15]) ).
tcf(c_55,negated_conjecture,
! [X0: $i] : x22(X0,X0) = X0,
inference(cnf_transformation,[],[f16]) ).
tcf(c_82,negated_conjecture,
! [X0: $i] : x22(X0,X0) = X0,
inference(demodulation,[status(thm)],[c_55]) ).
tcf(c_136,plain,
! [X0: $i] : x22(s(z),X0) = x2(X0,z),
inference(superposition,[status(thm)],[c_53,c_54]) ).
tcf(c_139,plain,
! [X0: $i,X1: $i] : s(x2(X0,x22(X1,s(X0)))) = x22(s(X1),s(X0)),
inference(superposition,[status(thm)],[c_54,c_52]) ).
tcf(c_178,plain,
! [X0: $i,X1: $i] : x2(X0,x22(X1,s(X0))) = proj1S(x22(s(X1),s(X0))),
inference(superposition,[status(thm)],[c_139,c_49]) ).
tcf(c_641,plain,
! [X0: $i] : x2(X0,x22(X0,s(X0))) = proj1S(s(X0)),
inference(superposition,[status(thm)],[c_82,c_178]) ).
tcf(c_653,plain,
! [X0: $i] : x2(X0,x22(X0,s(X0))) = X0,
inference(light_normalisation,[status(thm)],[c_641,c_49]) ).
tcf(c_683,plain,
x2(s(z),x2(s(s(z)),z)) = s(z),
inference(superposition,[status(thm)],[c_136,c_653]) ).
tcf(c_720,plain,
s(s(s(z))) = s(z),
inference(demodulation,[status(thm)],[c_683,c_51,c_52]) ).
tcf(c_742,plain,
s(s(z)) = proj1S(s(z)),
inference(superposition,[status(thm)],[c_720,c_49]) ).
tcf(c_768,plain,
s(s(z)) = z,
inference(demodulation,[status(thm)],[c_742,c_49]) ).
tcf(c_769,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_768,c_50]) ).
%------------------------------------------------------------------------------
%----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/sandbox/benchmark/theBenchmark.p THM
% 0.12/5.60 % Computer : n016.cluster.edu
% 0.12/5.60 % Model : x86_64 x86_64
% 0.12/5.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.60 % Memory : 8046.5625MB
% 0.12/5.60 % OS : Linux 6.8.0-71-generic
% 0.12/5.60 % CPULimit : 300
% 0.12/5.60 % WCLimit : 300
% 0.12/5.60 % DateTime : Thu Sep 24 23:42:22 UTC 2026
% 0.12/5.60 % CPUTime :
% 0.12/5.60 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/5.64 Running first-order theorem proving
% 0.12/5.64 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.12/5.66
% 0.12/5.66 % ======== iProver multi-core TPTP/SMT =========
% 0.12/5.66
% 0.12/5.66 % Detected problem language: tptp
% 0.12/5.67 % Proving...
% 4.38/6.54 % SZS status Started for theBenchmark.p
% 4.38/6.54 % SZS status Theorem for theBenchmark.p
% 4.38/6.54
% 4.38/6.54 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.38/6.54
% 4.38/6.54 % ------ iProver source info
% 4.38/6.54
% 4.38/6.54 % git: date: 2026-07-19 20:42:38 +0200
% 4.38/6.54 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.38/6.54 % git: non_committed_changes: false
% 4.38/6.54
% 4.38/6.54 % ------ Parsing...
% 4.38/6.54 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_UEQ
% 4.38/6.54 %
% 4.38/6.54
% 4.38/6.54 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.38/6.54
% 4.38/6.54 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 4.38/6.54 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.38/6.54
% 4.38/6.54 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.38/6.54 % ------ Proving...
% 4.38/6.54 % ------ Problem Properties
% 4.38/6.54
% 4.38/6.54 %
% 4.38/6.54 % clauses 7
% 4.38/6.54 % conjectures 1
% 4.38/6.54 % EPR 0
% 4.38/6.54 % Horn 7
% 4.38/6.54 % unary 7
% 4.38/6.54 % binary 0
% 4.38/6.54 % lits 7
% 4.38/6.54 % lits eq 7
% 4.38/6.54 % fd_pure 0
% 4.38/6.54 % fd_pseudo 0
% 4.38/6.54 % fd_cond 0
% 4.38/6.54 % fd_pseudo_cond 0
% 4.38/6.54 % AC symbols 0
% 4.38/6.54
% 4.38/6.54 % ------ Schedule UEQ
% 4.38/6.54
% 4.38/6.54 % ------ Option_UEQ Time Limit: 10.
% 4.38/6.54
% 4.38/6.54
% 4.38/6.54 % ------
% 4.38/6.54 % Current options:
% 4.38/6.54 % ------
% 4.38/6.54
% 4.38/6.54
% 4.38/6.54 %
% 4.38/6.54
% 4.38/6.54 % ------ Proving...
% 4.38/6.54 %
% 4.38/6.54
% 4.38/6.54 % SZS status Theorem for theBenchmark.p
% 4.38/6.54
% 4.38/6.54 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.38/6.55
% 4.38/6.55
%------------------------------------------------------------------------------