%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWX200+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 : n009.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:48 PM UTC 2026
% Result : Theorem 2.41s 1.19s
% Output : CNFRefutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 54 ( 3 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 22 ~; 19 |; 5 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 35 !; 4 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] : ~ leqNat(s(X0),z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_007) ).
fof(f9,axiom,
! [X0] : merge(nil,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_009) ).
fof(f13,axiom,
ord(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_013) ).
fof(f15,axiom,
! [X0,X1,X2] :
( ord(cons(X0,cons(X1,X2)))
<=> ( ord(cons(X1,X2))
& leqNat(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_015) ).
fof(f16,conjecture,
? [X0,X1] :
~ ( ord(X0)
=> ( ~ ord(X1)
=> ord(merge(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_016) ).
fof(f17,negated_conjecture,
~ ? [X0,X1] :
~ ( ord(X0)
=> ( ~ ord(X1)
=> ord(merge(X0,X1)) ) ),
inference(negated_conjecture,[status(cth)],[f16]) ).
fof(f20,plain,
! [X0,X1] :
( ~ ord(X0)
| ord(X1)
| ord(merge(X0,X1)) ),
inference(ennf_transformation,[],[f17]) ).
fof(f21,plain,
! [X0,X1] :
( ~ ord(X0)
| ord(X1)
| ord(merge(X0,X1)) ),
inference(flattening,[],[f20]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( ~ ord(cons(X0,cons(X1,X2)))
| ( ord(cons(X1,X2))
& leqNat(X0,X1) ) )
& ( ~ ord(cons(X1,X2))
| ~ leqNat(X0,X1)
| ord(cons(X0,cons(X1,X2))) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ~ ord(cons(X0,cons(X1,X2)))
| ( ord(cons(X1,X2))
& leqNat(X0,X1) ) )
& ( ~ ord(cons(X1,X2))
| ~ leqNat(X0,X1)
| ord(cons(X0,cons(X1,X2))) ) ),
inference(flattening,[],[f23]) ).
fof(f31,plain,
! [X0] : ~ leqNat(s(X0),z),
inference(cnf_transformation,[],[f7]) ).
fof(f34,plain,
! [X0] : merge(nil,X0) = X0,
inference(cnf_transformation,[],[f9]) ).
fof(f38,plain,
ord(nil),
inference(cnf_transformation,[],[f13]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ~ ord(cons(X0,cons(X1,X2)))
| leqNat(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f43,plain,
! [X0,X1] :
( ~ ord(X0)
| ord(X1)
| ord(merge(X0,X1)) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_55,plain,
! [X0: $i] : ~ leqNat(s(X0),z),
inference(cnf_transformation,[],[f31]) ).
tcf(c_58,plain,
! [X0: $i] : merge(nil,X0) = X0,
inference(cnf_transformation,[],[f34]) ).
tcf(c_62,plain,
ord(nil),
inference(cnf_transformation,[],[f38]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] :
( leqNat(X0,X1)
| ~ ord(cons(X0,cons(X1,X2))) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_67,negated_conjecture,
! [X0: $i,X1: $i] :
( ord(X1)
| ord(merge(X0,X1))
| ~ ord(X0) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_233,negated_conjecture,
! [X0: $i,X1: $i] :
( ord(X1)
| ord(merge(X0,X1))
| ~ ord(X0) ),
inference(demodulation,[status(thm)],[c_67]) ).
tcf(c_617,plain,
! [X0: $i] :
( ord(X0)
| ~ ord(nil) ),
inference(superposition,[status(thm)],[c_58,c_233]) ).
tcf(c_618,plain,
! [X0: $i] : ord(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_617,c_62]) ).
tcf(c_626,plain,
! [X0: $i,X1: $i] : leqNat(X0,X1),
inference(forward_subsumption_resolution,[status(thm)],[c_65,c_618]) ).
tcf(c_627,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_55,c_626]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX200+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.11/0.38 % Computer : n009.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 23:36:14 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 2.41/1.19 % SZS status Started for theBenchmark.p
% 2.41/1.19 % SZS status Theorem for theBenchmark.p
% 2.41/1.19
% 2.41/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.41/1.19
% 2.41/1.19 % ------ iProver source info
% 2.41/1.19
% 2.41/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 2.41/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.41/1.19 % git: non_committed_changes: false
% 2.41/1.19
% 2.41/1.19 % ------ Parsing...
% 2.41/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.41/1.19
% 2.41/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.41/1.19
% 2.41/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.41/1.19
% 2.41/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.41/1.19 % ------ Proving...
% 2.41/1.19 % ------ Problem Properties
% 2.41/1.19
% 2.41/1.19 %
% 2.41/1.19 % clauses 19
% 2.41/1.19 % conjectures 1
% 2.41/1.19 % EPR 2
% 2.41/1.19 % Horn 17
% 2.41/1.19 % unary 11
% 2.41/1.19 % binary 6
% 2.41/1.19 % lits 29
% 2.41/1.19 % lits eq 9
% 2.41/1.19 % fd_pure 0
% 2.41/1.19 % fd_pseudo 0
% 2.41/1.19 % fd_cond 0
% 2.41/1.19 % fd_pseudo_cond 0
% 2.41/1.19 % AC symbols 0
% 2.41/1.19
% 2.41/1.19 % ------ Schedule dynamic 5 is on
% 2.41/1.19
% 2.41/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.41/1.19
% 2.41/1.19
% 2.41/1.19 % ------
% 2.41/1.19 % Current options:
% 2.41/1.19 % ------
% 2.41/1.19
% 2.41/1.19
% 2.41/1.19 %
% 2.41/1.19
% 2.41/1.19 % ------ Proving...
% 2.41/1.19 %
% 2.41/1.19
% 2.41/1.19 % SZS status Theorem for theBenchmark.p
% 2.41/1.19
% 2.41/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.41/1.19
% 2.41/1.19
%------------------------------------------------------------------------------