%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC379+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n003.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:09:32 PM UTC 2026
% Result : Theorem 4.17s 1.30s
% Output : CNFRefutation 4.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 1
% Syntax : Number of formulae : 77 ( 14 unt; 0 def)
% Number of atoms : 400 ( 71 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 512 ( 189 ~; 209 |; 93 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 70 ( 0 sgn 47 !; 23 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X6] :
( ssItem(X6)
=> ( ( memberP(X0,X6)
& memberP(X1,X6)
& ! [X7] :
( ssItem(X7)
=> ( X6 = X7
| ~ leq(X7,X6)
| ~ memberP(X1,X7) ) ) )
| ( ( ? [X7] :
( leq(X7,X6)
& memberP(X1,X7)
& X6 != X7
& ssItem(X7) )
| ~ memberP(X1,X6) )
& ~ memberP(X0,X6) ) ) )
| ? [X4] :
( ( ( ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5) ) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X6] :
( ssItem(X6)
=> ( ( memberP(X0,X6)
& memberP(X1,X6)
& ! [X7] :
( ssItem(X7)
=> ( X6 = X7
| ~ leq(X7,X6)
| ~ memberP(X1,X7) ) ) )
| ( ( ? [X7] :
( leq(X7,X6)
& memberP(X1,X7)
& X6 != X7
& ssItem(X7) )
| ~ memberP(X1,X6) )
& ~ memberP(X0,X6) ) ) )
| ? [X4] :
( ( ( ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5) ) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X7] :
( ssItem(X7)
=> ( ( memberP(X0,X7)
& memberP(X1,X7)
& ! [X9] :
( ssItem(X9)
=> ( X7 = X9
| ~ leq(X9,X7)
| ~ memberP(X1,X9) ) ) )
| ( ( ? [X8] :
( leq(X8,X7)
& memberP(X1,X8)
& X7 != X8
& ssItem(X8) )
| ~ memberP(X1,X7) )
& ~ memberP(X0,X7) ) ) )
| ? [X4] :
( ( ( ( ? [X6] :
( leq(X6,X4)
& memberP(X3,X6)
& X4 != X6
& ssItem(X6) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5) ) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X7] :
( ssItem(X7)
& ( ~ memberP(X0,X7)
| ~ memberP(X1,X7)
| ? [X9] :
( ssItem(X9)
& X7 != X9
& leq(X9,X7)
& memberP(X1,X9) ) )
& ( ( ! [X8] :
( ~ leq(X8,X7)
| ~ memberP(X1,X8)
| X7 = X8
| ~ ssItem(X8) )
& memberP(X1,X7) )
| memberP(X0,X7) ) )
& ! [X4] :
( ( ( ( ! [X6] :
( ~ leq(X6,X4)
| ~ memberP(X3,X6)
| X4 = X6
| ~ ssItem(X6) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& leq(X5,X4)
& memberP(X3,X5) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f98]) ).
fof(f100,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X7] :
( ssItem(X7)
& ( ~ memberP(X0,X7)
| ~ memberP(X1,X7)
| ? [X9] :
( ssItem(X9)
& X7 != X9
& leq(X9,X7)
& memberP(X1,X9) ) )
& ( ( ! [X8] :
( ~ leq(X8,X7)
| ~ memberP(X1,X8)
| X7 = X8
| ~ ssItem(X8) )
& memberP(X1,X7) )
| memberP(X0,X7) ) )
& ! [X4] :
( ( ( ( ! [X6] :
( ~ leq(X6,X4)
| ~ memberP(X3,X6)
| X4 = X6
| ~ ssItem(X6) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& leq(X5,X4)
& memberP(X3,X5) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f99]) ).
fof(f138,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ssItem(sK5)
& ( ~ memberP(sK0,sK5)
| ~ memberP(sK1,sK5)
| ( ssItem(sK6)
& sK5 != sK6
& leq(sK6,sK5)
& memberP(sK1,sK6) ) )
& ( ( ! [X8] :
( ~ leq(X8,sK5)
| ~ memberP(sK1,X8)
| sK5 = X8
| ~ ssItem(X8) )
& memberP(sK1,sK5) )
| memberP(sK0,sK5) )
& ! [X4] :
( ( ( ( ! [X6] :
( ~ leq(X6,X4)
| ~ memberP(sK3,X6)
| X4 = X6
| ~ ssItem(X6) )
& memberP(sK3,X4) )
| ~ memberP(sK2,X4) )
& ( ~ memberP(sK3,X4)
| ( ssItem(sK4(X4))
& sK4(X4) != X4
& leq(sK4(X4),X4)
& memberP(sK3,sK4(X4)) )
| memberP(sK2,X4) ) )
| ~ ssItem(X4) )
& sK0 = sK2
& sK1 = sK3 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X5,sK4(X4)),skolemize(X7,sK5),skolemize(X9,sK6)],[f100]) ).
fof(f156,plain,
ssItem(sK5),
inference(cnf_transformation,[],[f138]) ).
fof(f157,plain,
( ~ memberP(sK0,sK5)
| ~ memberP(sK1,sK5)
| ssItem(sK6) ),
inference(cnf_transformation,[],[f138]) ).
fof(f158,plain,
( ~ memberP(sK0,sK5)
| ~ memberP(sK1,sK5)
| sK5 != sK6 ),
inference(cnf_transformation,[],[f138]) ).
fof(f159,plain,
( ~ memberP(sK0,sK5)
| ~ memberP(sK1,sK5)
| leq(sK6,sK5) ),
inference(cnf_transformation,[],[f138]) ).
fof(f160,plain,
( ~ memberP(sK0,sK5)
| ~ memberP(sK1,sK5)
| memberP(sK1,sK6) ),
inference(cnf_transformation,[],[f138]) ).
fof(f161,plain,
! [X8] :
( ~ leq(X8,sK5)
| ~ memberP(sK1,X8)
| sK5 = X8
| ~ ssItem(X8)
| memberP(sK0,sK5) ),
inference(cnf_transformation,[],[f138]) ).
fof(f162,plain,
( memberP(sK1,sK5)
| memberP(sK0,sK5) ),
inference(cnf_transformation,[],[f138]) ).
fof(f163,plain,
! [X6,X4] :
( ~ leq(X6,X4)
| ~ memberP(sK3,X6)
| X4 = X6
| ~ ssItem(X6)
| ~ memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f138]) ).
fof(f164,plain,
! [X4] :
( memberP(sK3,X4)
| ~ memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f138]) ).
fof(f165,plain,
! [X4] :
( ~ memberP(sK3,X4)
| ssItem(sK4(X4))
| memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f138]) ).
fof(f166,plain,
! [X4] :
( ~ memberP(sK3,X4)
| sK4(X4) != X4
| memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f138]) ).
fof(f167,plain,
! [X4] :
( ~ memberP(sK3,X4)
| leq(sK4(X4),X4)
| memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f138]) ).
fof(f168,plain,
! [X4] :
( ~ memberP(sK3,X4)
| memberP(sK3,sK4(X4))
| memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f138]) ).
fof(f169,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f138]) ).
fof(f170,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f138]) ).
fof(f216,plain,
( memberP(sK3,sK5)
| memberP(sK2,sK5) ),
inference(definition_unfolding,[],[f162,f169,f170]) ).
fof(f217,plain,
! [X8] :
( ~ leq(X8,sK5)
| ~ memberP(sK3,X8)
| sK5 = X8
| ~ ssItem(X8)
| memberP(sK2,sK5) ),
inference(definition_unfolding,[],[f161,f169,f170]) ).
fof(f218,plain,
( ~ memberP(sK2,sK5)
| ~ memberP(sK3,sK5)
| memberP(sK3,sK6) ),
inference(definition_unfolding,[],[f160,f170,f170,f169]) ).
fof(f219,plain,
( ~ memberP(sK2,sK5)
| ~ memberP(sK3,sK5)
| leq(sK6,sK5) ),
inference(definition_unfolding,[],[f159,f170,f169]) ).
fof(f220,plain,
( ~ memberP(sK2,sK5)
| ~ memberP(sK3,sK5)
| sK5 != sK6 ),
inference(definition_unfolding,[],[f158,f170,f169]) ).
fof(f221,plain,
( ~ memberP(sK2,sK5)
| ~ memberP(sK3,sK5)
| ssItem(sK6) ),
inference(definition_unfolding,[],[f157,f170,f169]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( memberP(sK2,X0)
| memberP(sK3,sK4(X0))
| ~ ssItem(X0)
| ~ memberP(sK3,X0) ),
inference(cnf_transformation,[],[f168]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( memberP(sK2,X0)
| leq(sK4(X0),X0)
| ~ ssItem(X0)
| ~ memberP(sK3,X0) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( memberP(sK2,X0)
| ~ ssItem(X0)
| ~ memberP(sK3,X0)
| ( sK4(X0) != X0 ) ),
inference(cnf_transformation,[],[f166]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] :
( memberP(sK2,X0)
| ssItem(sK4(X0))
| ~ ssItem(X0)
| ~ memberP(sK3,X0) ),
inference(cnf_transformation,[],[f165]) ).
tcf(c_53,negated_conjecture,
! [X0: $i] :
( memberP(sK3,X0)
| ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(cnf_transformation,[],[f164]) ).
tcf(c_54,negated_conjecture,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ memberP(sK3,X0)
| ~ memberP(sK2,X1)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f163]) ).
tcf(c_55,negated_conjecture,
( memberP(sK3,sK5)
| memberP(sK2,sK5) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_56,negated_conjecture,
! [X0: $i] :
( memberP(sK2,sK5)
| ( X0 = sK5 )
| ~ ssItem(X0)
| ~ leq(X0,sK5)
| ~ memberP(sK3,X0) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_57,negated_conjecture,
( memberP(sK3,sK6)
| ~ memberP(sK3,sK5)
| ~ memberP(sK2,sK5) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_58,negated_conjecture,
( leq(sK6,sK5)
| ~ memberP(sK3,sK5)
| ~ memberP(sK2,sK5) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_59,negated_conjecture,
( ~ memberP(sK3,sK5)
| ~ memberP(sK2,sK5)
| ( sK5 != sK6 ) ),
inference(cnf_transformation,[],[f220]) ).
tcf(c_60,negated_conjecture,
( ssItem(sK6)
| ~ memberP(sK3,sK5)
| ~ memberP(sK2,sK5) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_61,negated_conjecture,
ssItem(sK5),
inference(cnf_transformation,[],[f156]) ).
tcf(c_2727,plain,
( memberP(sK3,sK5)
| ~ ssItem(sK5) ),
inference(superposition,[status(thm)],[c_55,c_53]) ).
tcf(c_2728,plain,
memberP(sK3,sK5),
inference(forward_subsumption_resolution,[status(thm)],[c_2727,c_61]) ).
tcf(c_2729,negated_conjecture,
( ssItem(sK6)
| ~ memberP(sK2,sK5) ),
inference(global_subsumption_just,[status(thm)],[c_60,c_60,c_2728]) ).
tcf(c_2735,negated_conjecture,
( memberP(sK3,sK6)
| ~ memberP(sK2,sK5) ),
inference(global_subsumption_just,[status(thm)],[c_57,c_57,c_2728]) ).
tcf(c_2741,negated_conjecture,
( leq(sK6,sK5)
| ~ memberP(sK2,sK5) ),
inference(global_subsumption_just,[status(thm)],[c_58,c_58,c_2728]) ).
tcf(c_2767,plain,
( memberP(sK2,sK5)
| ssItem(sK4(sK5))
| ~ ssItem(sK5) ),
inference(superposition,[status(thm)],[c_2728,c_52]) ).
tcf(c_2768,plain,
( memberP(sK2,sK5)
| ssItem(sK4(sK5)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2767,c_61]) ).
tcf(c_2771,plain,
( ( sK5 != sK6 )
| ~ memberP(sK2,sK5) ),
inference(global_subsumption_just,[status(thm)],[c_59,c_59,c_2728]) ).
tcf(c_2772,negated_conjecture,
( ~ memberP(sK2,sK5)
| ( sK5 != sK6 ) ),
inference(renaming,[status(thm)],[c_2771]) ).
tcf(c_2819,plain,
( memberP(sK2,sK5)
| ( sK4(sK5) = sK5 )
| ~ ssItem(sK5)
| ~ memberP(sK3,sK5)
| ~ ssItem(sK4(sK5))
| ~ memberP(sK3,sK4(sK5)) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
tcf(c_2821,plain,
( memberP(sK2,sK5)
| ( sK4(sK5) = sK5 )
| ~ ssItem(sK4(sK5))
| ~ memberP(sK3,sK4(sK5)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2819,c_61,c_2728]) ).
tcf(c_2845,plain,
( leq(sK6,sK5)
| ssItem(sK4(sK5)) ),
inference(superposition,[status(thm)],[c_2768,c_2741]) ).
tcf(c_2846,plain,
( memberP(sK3,sK6)
| ssItem(sK4(sK5)) ),
inference(superposition,[status(thm)],[c_2768,c_2735]) ).
tcf(c_2847,plain,
( ssItem(sK6)
| ssItem(sK4(sK5)) ),
inference(superposition,[status(thm)],[c_2768,c_2729]) ).
tcf(c_2917,plain,
( ssItem(sK4(sK5))
| ( sK5 = sK6 )
| ~ ssItem(sK6)
| ~ ssItem(sK5)
| ~ memberP(sK3,sK6)
| ~ memberP(sK2,sK5) ),
inference(superposition,[status(thm)],[c_2845,c_54]) ).
tcf(c_2919,plain,
( ssItem(sK4(sK5))
| ( sK5 = sK6 )
| ~ ssItem(sK6)
| ~ memberP(sK3,sK6)
| ~ memberP(sK2,sK5) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2917,c_61]) ).
tcf(c_2925,plain,
ssItem(sK4(sK5)),
inference(global_subsumption_just,[status(thm)],[c_2846,c_59,c_2728,c_2768,c_2847,c_2846,c_2919]) ).
tcf(c_2927,plain,
( memberP(sK2,sK5)
| ( sK4(sK5) = sK5 )
| ~ memberP(sK3,sK4(sK5)) ),
inference(global_subsumption_just,[status(thm)],[c_2821,c_2821,c_2925]) ).
tcf(c_2935,plain,
( memberP(sK2,sK5)
| ( sK4(sK5) = sK5 )
| ~ ssItem(sK5)
| ~ memberP(sK3,sK5) ),
inference(superposition,[status(thm)],[c_49,c_2927]) ).
tcf(c_2936,plain,
( memberP(sK2,sK5)
| ( sK4(sK5) = sK5 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2935,c_61,c_2728]) ).
tcf(c_2946,plain,
( leq(sK6,sK5)
| ( sK4(sK5) = sK5 ) ),
inference(superposition,[status(thm)],[c_2936,c_2741]) ).
tcf(c_2947,plain,
( memberP(sK3,sK6)
| ( sK4(sK5) = sK5 ) ),
inference(superposition,[status(thm)],[c_2936,c_2735]) ).
tcf(c_2948,plain,
( ssItem(sK6)
| ( sK4(sK5) = sK5 ) ),
inference(superposition,[status(thm)],[c_2936,c_2729]) ).
tcf(c_2963,plain,
( ( sK5 = sK6 )
| ( sK4(sK5) = sK5 )
| ~ ssItem(sK6)
| ~ ssItem(sK5)
| ~ memberP(sK3,sK6)
| ~ memberP(sK2,sK5) ),
inference(superposition,[status(thm)],[c_2946,c_54]) ).
tcf(c_2964,plain,
( memberP(sK2,sK5)
| ( sK5 = sK6 )
| ( sK4(sK5) = sK5 )
| ~ ssItem(sK6)
| ~ memberP(sK3,sK6) ),
inference(superposition,[status(thm)],[c_2946,c_56]) ).
tcf(c_2970,plain,
( ( sK5 = sK6 )
| ( sK4(sK5) = sK5 )
| ~ ssItem(sK6)
| ~ memberP(sK3,sK6)
| ~ memberP(sK2,sK5) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2963,c_61]) ).
tcf(c_2976,plain,
( ( sK5 = sK6 )
| ( sK4(sK5) = sK5 )
| ~ ssItem(sK6)
| ~ memberP(sK3,sK6) ),
inference(backward_subsumption_resolution,[status(thm)],[c_2964,c_2970]) ).
tcf(c_2981,plain,
sK4(sK5) = sK5,
inference(global_subsumption_just,[status(thm)],[c_2947,c_59,c_2728,c_2936,c_2948,c_2947,c_2976]) ).
tcf(c_2985,plain,
( memberP(sK2,sK5)
| ~ ssItem(sK5)
| ~ memberP(sK3,sK5) ),
inference(superposition,[status(thm)],[c_2981,c_51]) ).
tcf(c_2988,plain,
memberP(sK2,sK5),
inference(forward_subsumption_resolution,[status(thm)],[c_2985,c_61,c_2728]) ).
tcf(c_2989,plain,
sK5 != sK6,
inference(backward_subsumption_resolution,[status(thm)],[c_2772,c_2988]) ).
tcf(c_2990,plain,
leq(sK6,sK5),
inference(backward_subsumption_resolution,[status(thm)],[c_2741,c_2988]) ).
tcf(c_2991,plain,
memberP(sK3,sK6),
inference(backward_subsumption_resolution,[status(thm)],[c_2735,c_2988]) ).
tcf(c_2992,plain,
ssItem(sK6),
inference(backward_subsumption_resolution,[status(thm)],[c_2729,c_2988]) ).
tcf(c_3044,plain,
( ( sK5 = sK6 )
| ~ ssItem(sK6)
| ~ ssItem(sK5)
| ~ memberP(sK3,sK6)
| ~ memberP(sK2,sK5) ),
inference(superposition,[status(thm)],[c_2990,c_54]) ).
tcf(c_3045,plain,
~ memberP(sK3,sK6),
inference(forward_subsumption_resolution,[status(thm)],[c_3044,c_2989,c_2992,c_61,c_2988]) ).
tcf(c_3046,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3045,c_2991]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC379+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n003.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 17:57:36 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 4.17/1.30 % SZS status Started for theBenchmark.p
% 4.17/1.30 % SZS status Theorem for theBenchmark.p
% 4.17/1.30
% 4.17/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.17/1.30
% 4.17/1.30 % ------ iProver source info
% 4.17/1.30
% 4.17/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.17/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.17/1.30 % git: non_committed_changes: false
% 4.17/1.30
% 4.17/1.30 % ------ Parsing...
% 4.17/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.17/1.30
% 4.17/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.17/1.30
% 4.17/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.17/1.30
% 4.17/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.17/1.30 % ------ Proving...
% 4.17/1.30 % ------ Problem Properties
% 4.17/1.30
% 4.17/1.30 %
% 4.17/1.30 % clauses 58
% 4.17/1.30 % conjectures 15
% 4.17/1.30 % EPR 25
% 4.17/1.30 % Horn 47
% 4.17/1.30 % unary 8
% 4.17/1.30 % binary 6
% 4.17/1.30 % lits 207
% 4.17/1.30 % lits eq 33
% 4.17/1.30 % fd_pure 0
% 4.17/1.30 % fd_pseudo 0
% 4.17/1.30 % fd_cond 5
% 4.17/1.30 % fd_pseudo_cond 8
% 4.17/1.30 % AC symbols 0
% 4.17/1.30
% 4.17/1.30 % ------ Schedule dynamic 5 is on
% 4.17/1.30
% 4.17/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.17/1.30
% 4.17/1.30
% 4.17/1.30 % ------
% 4.17/1.30 % Current options:
% 4.17/1.30 % ------
% 4.17/1.30
% 4.17/1.30
% 4.17/1.30 %
% 4.17/1.30
% 4.17/1.30 % ------ Proving...
% 4.17/1.30 %
% 4.17/1.30
% 4.17/1.30 % SZS status Theorem for theBenchmark.p
% 4.17/1.30
% 4.17/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.17/1.30
% 4.17/1.30
%------------------------------------------------------------------------------