%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV392+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n001.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:32 PM UTC 2026
% Result : Theorem 1.36s 1.17s
% Output : CNFRefutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 6 unt; 0 def)
% Number of atoms : 26 ( 5 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 25 ( 10 ~; 2 |; 9 &)
% ( 0 <=>; 4 =>; 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 : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 9 !; 6 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] : ~ contains_slb(create_slb,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax20) ).
fof(f19,conjecture,
! [X0,X1] :
( pair_in_list(create_slb,X0,X1)
=> ! [X2] :
( contains_slb(create_slb,X2)
=> ( X0 = X2
| pair_in_list(remove_slb(create_slb,X2),X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_co) ).
fof(f20,negated_conjecture,
~ ! [X0,X1] :
( pair_in_list(create_slb,X0,X1)
=> ! [X2] :
( contains_slb(create_slb,X2)
=> ( X0 = X2
| pair_in_list(remove_slb(create_slb,X2),X0,X1) ) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f32,plain,
? [X0,X1] :
( pair_in_list(create_slb,X0,X1)
& ? [X2] :
( contains_slb(create_slb,X2)
& X0 != X2
& ~ pair_in_list(remove_slb(create_slb,X2),X0,X1) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f33,plain,
? [X0,X1] :
( pair_in_list(create_slb,X0,X1)
& ? [X2] :
( contains_slb(create_slb,X2)
& X0 != X2
& ~ pair_in_list(remove_slb(create_slb,X2),X0,X1) ) ),
inference(flattening,[],[f32]) ).
fof(f38,plain,
( pair_in_list(create_slb,sK0,sK1)
& contains_slb(create_slb,sK2)
& sK0 != sK2
& ~ pair_in_list(remove_slb(create_slb,sK2),sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f33]) ).
fof(f46,plain,
! [X0] : ~ contains_slb(create_slb,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f63,plain,
contains_slb(create_slb,sK2),
inference(cnf_transformation,[],[f38]) ).
tcf(c_56,plain,
! [X0: $i] : ~ contains_slb(create_slb,X0),
inference(cnf_transformation,[],[f46]) ).
tcf(c_74,negated_conjecture,
contains_slb(create_slb,sK2),
inference(cnf_transformation,[],[f63]) ).
tcf(c_99,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_74,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV392+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n001.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:33:40 UTC 2026
% 0.14/0.37 % CPUTime :
% 0.14/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.42
% 0.14/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.42
% 0.14/0.42 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 1.36/1.17 % SZS status Started for theBenchmark.p
% 1.36/1.17 % SZS status Theorem for theBenchmark.p
% 1.36/1.17
% 1.36/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.36/1.17
% 1.36/1.17 % ------ iProver source info
% 1.36/1.17
% 1.36/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 1.36/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.36/1.17 % git: non_committed_changes: false
% 1.36/1.17
% 1.36/1.17 % ------ Parsing...
% 1.36/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.36/1.17
% 1.36/1.17 % ------ Preprocessing...%
% 1.36/1.17
% 1.36/1.17 % SZS status Theorem for theBenchmark.p
% 1.36/1.17
% 1.36/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.36/1.17
% 1.36/1.17
%------------------------------------------------------------------------------