%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV405+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 : n020.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 1.33s 1.28s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 46 ( 19 ~; 16 |; 6 &)
% ( 2 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 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 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 44 ( 0 sgn 34 !; 10 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax22) ).
fof(f24,axiom,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax36) ).
fof(f42,conjecture,
! [X0,X1] :
( check_cpq(triple(X0,create_slb,X1))
<=> ! [X2,X3] :
( pair_in_list(create_slb,X2,X3)
=> less_than(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l41_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1] :
( check_cpq(triple(X0,create_slb,X1))
<=> ! [X2,X3] :
( pair_in_list(create_slb,X2,X3)
=> less_than(X3,X2) ) ),
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f82,plain,
? [X0,X1] :
( check_cpq(triple(X0,create_slb,X1))
<~> ! [X2,X3] :
( ~ pair_in_list(create_slb,X2,X3)
| less_than(X3,X2) ) ),
inference(ennf_transformation,[],[f43]) ).
fof(f89,plain,
? [X0,X1] :
( ( check_cpq(triple(X0,create_slb,X1))
| ! [X2,X3] :
( ~ pair_in_list(create_slb,X2,X3)
| less_than(X3,X2) ) )
& ( ~ check_cpq(triple(X0,create_slb,X1))
| ? [X2,X3] :
( pair_in_list(create_slb,X2,X3)
& ~ less_than(X3,X2) ) ) ),
inference(nnf_transformation,[],[f82]) ).
fof(f90,plain,
? [X0,X1] :
( ( check_cpq(triple(X0,create_slb,X1))
| ! [X4,X5] :
( ~ pair_in_list(create_slb,X4,X5)
| less_than(X5,X4) ) )
& ( ~ check_cpq(triple(X0,create_slb,X1))
| ? [X2,X3] :
( pair_in_list(create_slb,X2,X3)
& ~ less_than(X3,X2) ) ) ),
inference(rectify,[],[f89]) ).
fof(f91,plain,
( ( check_cpq(triple(sK0,create_slb,sK1))
| ! [X4,X5] :
( ~ pair_in_list(create_slb,X4,X5)
| less_than(X5,X4) ) )
& ( ~ check_cpq(triple(sK0,create_slb,sK1))
| ( pair_in_list(create_slb,sK2,sK3)
& ~ less_than(sK3,sK2) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f90]) ).
fof(f103,plain,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[],[f10]) ).
fof(f120,plain,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f24]) ).
fof(f140,plain,
! [X4,X5] :
( check_cpq(triple(sK0,create_slb,sK1))
| ~ pair_in_list(create_slb,X4,X5)
| less_than(X5,X4) ),
inference(cnf_transformation,[],[f91]) ).
fof(f141,plain,
( ~ check_cpq(triple(sK0,create_slb,sK1))
| pair_in_list(create_slb,sK2,sK3) ),
inference(cnf_transformation,[],[f91]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : ~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[],[f103]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] : check_cpq(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f120]) ).
tcf(c_96,negated_conjecture,
( pair_in_list(create_slb,sK2,sK3)
| ~ check_cpq(triple(sK0,create_slb,sK1)) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_97,negated_conjecture,
! [X0: $i,X1: $i] :
( less_than(X1,X0)
| check_cpq(triple(sK0,create_slb,sK1))
| ~ pair_in_list(create_slb,X0,X1) ),
inference(cnf_transformation,[],[f140]) ).
tcf(c_133,negated_conjecture,
! [X0: $i,X1: $i] : ~ pair_in_list(create_slb,X0,X1),
inference(global_subsumption_just,[status(thm)],[c_97,c_60]) ).
tcf(c_151,plain,
pair_in_list(create_slb,sK2,sK3),
inference(backward_subsumption_resolution,[status(thm)],[c_96,c_77]) ).
tcf(c_155,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_151,c_133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV405+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.13/0.37 % Computer : n020.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Thu Sep 24 19:30:33 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/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.13/0.42
% 0.13/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.42
% 0.13/0.42 % Detected problem language: tptp
% 0.13/0.43 % Proving...
% 1.33/1.28 % SZS status Started for theBenchmark.p
% 1.33/1.28 % SZS status Theorem for theBenchmark.p
% 1.33/1.28
% 1.33/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.33/1.28
% 1.33/1.28 % ------ iProver source info
% 1.33/1.28
% 1.33/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.33/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.33/1.28 % git: non_committed_changes: false
% 1.33/1.28
% 1.33/1.28 % ------ Parsing...
% 1.33/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.33/1.28
% 1.33/1.28 % ------ Preprocessing...%
% 1.33/1.28
% 1.33/1.28 % SZS status Theorem for theBenchmark.p
% 1.33/1.28
% 1.33/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.33/1.28
% 1.33/1.28
%------------------------------------------------------------------------------