%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV402+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n017.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:17:33 PM UTC 2026
% Result : Theorem 0.21s 1.28s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 6 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 23 ( 9 ~; 0 |; 11 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 2 sgn 17 !; 9 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax22) ).
fof(f19,conjecture,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) )
=> pair_in_list(update_slb(create_slb,X3),X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l38_co) ).
fof(f20,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) )
=> pair_in_list(update_slb(create_slb,X3),X1,X3) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
~ ! [X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) )
=> pair_in_list(update_slb(create_slb,X3),X1,X3) ),
inference(rectify,[],[f20]) ).
fof(f30,plain,
? [X1,X2,X3] :
( strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2)
& ~ pair_in_list(update_slb(create_slb,X3),X1,X3) ),
inference(ennf_transformation,[],[f21]) ).
fof(f31,plain,
? [X1,X2,X3] :
( strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2)
& ~ pair_in_list(update_slb(create_slb,X3),X1,X3) ),
inference(flattening,[],[f30]) ).
fof(f38,plain,
? [X0,X1,X2] :
( strictly_less_than(X1,X2)
& pair_in_list(create_slb,X0,X1)
& ~ pair_in_list(update_slb(create_slb,X2),X0,X2) ),
inference(rectify,[],[f31]) ).
fof(f39,plain,
( strictly_less_than(sK1,sK2)
& pair_in_list(create_slb,sK0,sK1)
& ~ pair_in_list(update_slb(create_slb,sK2),sK0,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f38]) ).
fof(f53,plain,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[],[f10]) ).
fof(f66,plain,
pair_in_list(create_slb,sK0,sK1),
inference(cnf_transformation,[],[f39]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : ~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[],[f53]) ).
tcf(c_75,negated_conjecture,
pair_in_list(create_slb,sK0,sK1),
inference(cnf_transformation,[],[f66]) ).
tcf(c_176,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_75,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV402+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 19:24:46 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 0.21/1.28 % SZS status Started for theBenchmark.p
% 0.21/1.28 % SZS status Theorem for theBenchmark.p
% 0.21/1.28
% 0.21/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.21/1.28
% 0.21/1.28 % ------ iProver source info
% 0.21/1.28
% 0.21/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.21/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.21/1.28 % git: non_committed_changes: false
% 0.21/1.28
% 0.21/1.28 % ------ Parsing...
% 0.21/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.21/1.28
% 0.21/1.28 % ------ Preprocessing...%
% 0.21/1.28
% 0.21/1.28 % SZS status Theorem for theBenchmark.p
% 0.21/1.28
% 0.21/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.21/1.28
% 0.21/1.28
%------------------------------------------------------------------------------