TSTP Solution File: SWV394+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV394+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 22:32:51 EDT 2023
% Result : Theorem 142.14s 19.74s
% Output : CNFRefutation 142.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 82 ( 11 unt; 0 def)
% Number of atoms : 248 ( 44 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 277 ( 111 ~; 117 |; 33 &)
% ( 3 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 216 ( 19 sgn; 119 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( ~ less_than(X1,X0)
& less_than(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f31,axiom,
! [X0,X1,X2,X3] :
( ~ contains_slb(X1,X3)
=> triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax43) ).
fof(f32,axiom,
! [X0,X1,X2,X3] :
( ( less_than(lookup_slb(X1,X3),X3)
& contains_slb(X1,X3) )
=> remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax44) ).
fof(f33,axiom,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X3,lookup_slb(X1,X3))
& contains_slb(X1,X3) )
=> remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax45) ).
fof(f42,axiom,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
<=> ! [X3,X4] :
( pair_in_list(X1,X3,X4)
=> less_than(X4,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l30_li4142) ).
fof(f43,axiom,
! [X0,X1,X2,X3,X4] :
( ( ok(remove_cpq(triple(X0,X1,X2),X3))
& strictly_less_than(X3,X4)
& pair_in_list(X1,X3,X4) )
=> pair_in_list(remove_slb(X1,X3),X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l30_li3132) ).
fof(f44,conjecture,
! [X0,X1,X2,X3] :
( ( ok(remove_cpq(triple(X0,X1,X2),X3))
& check_cpq(remove_cpq(triple(X0,X1,X2),X3)) )
=> ! [X4] :
( pair_in_list(X1,X3,X4)
=> less_than(X4,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l30_co) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ok(remove_cpq(triple(X0,X1,X2),X3))
& check_cpq(remove_cpq(triple(X0,X1,X2),X3)) )
=> ! [X4] :
( pair_in_list(X1,X3,X4)
=> less_than(X4,X3) ) ),
inference(negated_conjecture,[],[f44]) ).
fof(f54,plain,
! [X0,X1] :
( ( ~ less_than(X1,X0)
& less_than(X0,X1) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f57,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(ennf_transformation,[],[f54]) ).
fof(f58,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(flattening,[],[f57]) ).
fof(f72,plain,
! [X0,X1,X2,X3] :
( triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f31]) ).
fof(f73,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2)
| ~ less_than(lookup_slb(X1,X3),X3)
| ~ contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f32]) ).
fof(f74,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2)
| ~ less_than(lookup_slb(X1,X3),X3)
| ~ contains_slb(X1,X3) ),
inference(flattening,[],[f73]) ).
fof(f75,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad)
| ~ strictly_less_than(X3,lookup_slb(X1,X3))
| ~ contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f33]) ).
fof(f76,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad)
| ~ strictly_less_than(X3,lookup_slb(X1,X3))
| ~ contains_slb(X1,X3) ),
inference(flattening,[],[f75]) ).
fof(f84,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
<=> ! [X3,X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f85,plain,
! [X0,X1,X2,X3,X4] :
( pair_in_list(remove_slb(X1,X3),X3,X4)
| ~ ok(remove_cpq(triple(X0,X1,X2),X3))
| ~ strictly_less_than(X3,X4)
| ~ pair_in_list(X1,X3,X4) ),
inference(ennf_transformation,[],[f43]) ).
fof(f86,plain,
! [X0,X1,X2,X3,X4] :
( pair_in_list(remove_slb(X1,X3),X3,X4)
| ~ ok(remove_cpq(triple(X0,X1,X2),X3))
| ~ strictly_less_than(X3,X4)
| ~ pair_in_list(X1,X3,X4) ),
inference(flattening,[],[f85]) ).
fof(f87,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) )
& ok(remove_cpq(triple(X0,X1,X2),X3))
& check_cpq(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(ennf_transformation,[],[f45]) ).
fof(f88,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) )
& ok(remove_cpq(triple(X0,X1,X2),X3))
& check_cpq(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(flattening,[],[f87]) ).
fof(f95,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) ) )
& ( ! [X3,X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) ) )
& ( ! [X5,X6] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(rectify,[],[f95]) ).
fof(f97,plain,
! [X1] :
( ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) )
=> ( ~ less_than(sK1(X1),sK0(X1))
& pair_in_list(X1,sK0(X1),sK1(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ( ~ less_than(sK1(X1),sK0(X1))
& pair_in_list(X1,sK0(X1),sK1(X1)) ) )
& ( ! [X5,X6] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f96,f97]) ).
fof(f99,plain,
( ? [X0,X1,X2,X3] :
( ? [X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) )
& ok(remove_cpq(triple(X0,X1,X2),X3))
& check_cpq(remove_cpq(triple(X0,X1,X2),X3)) )
=> ( ? [X4] :
( ~ less_than(X4,sK5)
& pair_in_list(sK3,sK5,X4) )
& ok(remove_cpq(triple(sK2,sK3,sK4),sK5))
& check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5)) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
( ? [X4] :
( ~ less_than(X4,sK5)
& pair_in_list(sK3,sK5,X4) )
=> ( ~ less_than(sK6,sK5)
& pair_in_list(sK3,sK5,sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f101,plain,
( ~ less_than(sK6,sK5)
& pair_in_list(sK3,sK5,sK6)
& ok(remove_cpq(triple(sK2,sK3,sK4),sK5))
& check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6])],[f88,f100,f99]) ).
fof(f103,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f105,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f139,plain,
! [X2,X3,X0,X1] :
( triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f72]) ).
fof(f140,plain,
! [X2,X3,X0,X1] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2)
| ~ less_than(lookup_slb(X1,X3),X3)
| ~ contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f74]) ).
fof(f141,plain,
! [X2,X3,X0,X1] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad)
| ~ strictly_less_than(X3,lookup_slb(X1,X3))
| ~ contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f76]) ).
fof(f150,plain,
! [X2,X0,X1,X6,X5] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6)
| ~ check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f98]) ).
fof(f153,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(remove_slb(X1,X3),X3,X4)
| ~ ok(remove_cpq(triple(X0,X1,X2),X3))
| ~ strictly_less_than(X3,X4)
| ~ pair_in_list(X1,X3,X4) ),
inference(cnf_transformation,[],[f86]) ).
fof(f154,plain,
check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5)),
inference(cnf_transformation,[],[f101]) ).
fof(f155,plain,
ok(remove_cpq(triple(sK2,sK3,sK4),sK5)),
inference(cnf_transformation,[],[f101]) ).
fof(f156,plain,
pair_in_list(sK3,sK5,sK6),
inference(cnf_transformation,[],[f101]) ).
fof(f157,plain,
~ less_than(sK6,sK5),
inference(cnf_transformation,[],[f101]) ).
cnf(c_50,plain,
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f103]) ).
cnf(c_52,plain,
( ~ less_than(X0,X1)
| less_than(X1,X0)
| strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
cnf(c_86,plain,
( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f139]) ).
cnf(c_87,plain,
( ~ less_than(lookup_slb(X0,X1),X1)
| ~ contains_slb(X0,X1)
| triple(remove_pqp(X2,X1),remove_slb(X0,X1),X3) = remove_cpq(triple(X2,X0,X3),X1) ),
inference(cnf_transformation,[],[f140]) ).
cnf(c_88,plain,
( ~ strictly_less_than(X0,lookup_slb(X1,X0))
| ~ contains_slb(X1,X0)
| triple(remove_pqp(X2,X0),remove_slb(X1,X0),bad) = remove_cpq(triple(X2,X1,X3),X0) ),
inference(cnf_transformation,[],[f141]) ).
cnf(c_97,plain,
( ~ check_cpq(triple(X0,X1,X2))
| ~ pair_in_list(X1,X3,X4)
| less_than(X4,X3) ),
inference(cnf_transformation,[],[f150]) ).
cnf(c_98,plain,
( ~ ok(remove_cpq(triple(X0,X1,X2),X3))
| ~ pair_in_list(X1,X3,X4)
| ~ strictly_less_than(X3,X4)
| pair_in_list(remove_slb(X1,X3),X3,X4) ),
inference(cnf_transformation,[],[f153]) ).
cnf(c_99,negated_conjecture,
~ less_than(sK6,sK5),
inference(cnf_transformation,[],[f157]) ).
cnf(c_100,negated_conjecture,
pair_in_list(sK3,sK5,sK6),
inference(cnf_transformation,[],[f156]) ).
cnf(c_101,negated_conjecture,
ok(remove_cpq(triple(sK2,sK3,sK4),sK5)),
inference(cnf_transformation,[],[f155]) ).
cnf(c_102,negated_conjecture,
check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5)),
inference(cnf_transformation,[],[f154]) ).
cnf(c_136,plain,
( less_than(X1,X0)
| strictly_less_than(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_50,c_52]) ).
cnf(c_137,plain,
( less_than(X0,X1)
| strictly_less_than(X1,X0) ),
inference(renaming,[status(thm)],[c_136]) ).
cnf(c_617,plain,
( X0 != X1
| X2 != X3
| ~ ok(remove_cpq(triple(X4,X5,X6),X0))
| ~ pair_in_list(X5,X0,X2)
| pair_in_list(remove_slb(X5,X0),X0,X2)
| less_than(X3,X1) ),
inference(resolution_lifted,[status(thm)],[c_98,c_137]) ).
cnf(c_618,plain,
( ~ ok(remove_cpq(triple(X0,X1,X2),X3))
| ~ pair_in_list(X1,X3,X4)
| pair_in_list(remove_slb(X1,X3),X3,X4)
| less_than(X4,X3) ),
inference(unflattening,[status(thm)],[c_617]) ).
cnf(c_639,plain,
( lookup_slb(X0,X1) != X2
| X1 != X3
| ~ contains_slb(X0,X1)
| triple(remove_pqp(X4,X1),remove_slb(X0,X1),bad) = remove_cpq(triple(X4,X0,X5),X1)
| less_than(X2,X3) ),
inference(resolution_lifted,[status(thm)],[c_88,c_137]) ).
cnf(c_640,plain,
( ~ contains_slb(X0,X1)
| triple(remove_pqp(X2,X1),remove_slb(X0,X1),bad) = remove_cpq(triple(X2,X0,X3),X1)
| less_than(lookup_slb(X0,X1),X1) ),
inference(unflattening,[status(thm)],[c_639]) ).
cnf(c_1138,plain,
X0 = X0,
theory(equality) ).
cnf(c_1140,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_1154,plain,
( X0 != X1
| ~ check_cpq(X1)
| check_cpq(X0) ),
theory(equality) ).
cnf(c_1797,plain,
( ~ ok(remove_cpq(triple(sK2,sK3,sK4),sK5))
| ~ pair_in_list(sK3,sK5,X0)
| pair_in_list(remove_slb(sK3,sK5),sK5,X0)
| less_than(X0,sK5) ),
inference(instantiation,[status(thm)],[c_618]) ).
cnf(c_1914,plain,
( remove_cpq(triple(sK2,sK3,sK4),sK5) != X0
| X1 != X0
| X1 = remove_cpq(triple(sK2,sK3,sK4),sK5) ),
inference(instantiation,[status(thm)],[c_1140]) ).
cnf(c_2012,plain,
( ~ ok(remove_cpq(triple(sK2,sK3,sK4),sK5))
| ~ pair_in_list(sK3,sK5,sK6)
| pair_in_list(remove_slb(sK3,sK5),sK5,sK6)
| less_than(sK6,sK5) ),
inference(instantiation,[status(thm)],[c_1797]) ).
cnf(c_4027,plain,
( remove_cpq(triple(sK2,sK3,sK4),sK5) != triple(sK2,sK3,bad)
| X0 != triple(sK2,sK3,bad)
| X0 = remove_cpq(triple(sK2,sK3,sK4),sK5) ),
inference(instantiation,[status(thm)],[c_1914]) ).
cnf(c_4028,plain,
( remove_cpq(triple(sK2,sK3,sK4),sK5) = triple(sK2,sK3,bad)
| contains_slb(sK3,sK5) ),
inference(instantiation,[status(thm)],[c_86]) ).
cnf(c_10121,plain,
( remove_cpq(triple(sK2,sK3,sK4),sK5) != triple(sK2,sK3,bad)
| triple(sK2,sK3,bad) != triple(sK2,sK3,bad)
| triple(sK2,sK3,bad) = remove_cpq(triple(sK2,sK3,sK4),sK5) ),
inference(instantiation,[status(thm)],[c_4027]) ).
cnf(c_10122,plain,
triple(sK2,sK3,bad) = triple(sK2,sK3,bad),
inference(instantiation,[status(thm)],[c_1138]) ).
cnf(c_309427,plain,
( ~ check_cpq(triple(X0,X1,X2))
| ~ pair_in_list(X1,sK5,sK6)
| less_than(sK6,sK5) ),
inference(instantiation,[status(thm)],[c_97]) ).
cnf(c_309475,plain,
( ~ check_cpq(triple(X0,sK3,X1))
| ~ pair_in_list(sK3,sK5,sK6)
| less_than(sK6,sK5) ),
inference(instantiation,[status(thm)],[c_309427]) ).
cnf(c_309603,plain,
( ~ check_cpq(triple(X0,remove_slb(sK3,sK5),X1))
| ~ pair_in_list(remove_slb(sK3,sK5),sK5,sK6)
| less_than(sK6,sK5) ),
inference(instantiation,[status(thm)],[c_309427]) ).
cnf(c_310504,plain,
( ~ less_than(lookup_slb(sK3,sK5),sK5)
| ~ contains_slb(sK3,sK5)
| triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),X1) = remove_cpq(triple(X0,sK3,X1),sK5) ),
inference(instantiation,[status(thm)],[c_87]) ).
cnf(c_310505,plain,
( ~ contains_slb(sK3,sK5)
| triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),bad) = remove_cpq(triple(X0,sK3,X1),sK5)
| less_than(lookup_slb(sK3,sK5),sK5) ),
inference(instantiation,[status(thm)],[c_640]) ).
cnf(c_310843,plain,
( X0 != remove_cpq(triple(sK2,sK3,sK4),sK5)
| ~ check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5))
| check_cpq(X0) ),
inference(instantiation,[status(thm)],[c_1154]) ).
cnf(c_323257,plain,
( ~ contains_slb(sK3,sK5)
| triple(remove_pqp(sK2,sK5),remove_slb(sK3,sK5),bad) = remove_cpq(triple(sK2,sK3,sK4),sK5)
| less_than(lookup_slb(sK3,sK5),sK5) ),
inference(instantiation,[status(thm)],[c_310505]) ).
cnf(c_323259,plain,
( triple(remove_pqp(sK2,sK5),remove_slb(sK3,sK5),bad) != remove_cpq(triple(sK2,sK3,sK4),sK5)
| ~ check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5))
| check_cpq(triple(remove_pqp(sK2,sK5),remove_slb(sK3,sK5),bad)) ),
inference(instantiation,[status(thm)],[c_310843]) ).
cnf(c_323521,plain,
( ~ check_cpq(triple(remove_pqp(sK2,sK5),remove_slb(sK3,sK5),bad))
| ~ pair_in_list(remove_slb(sK3,sK5),sK5,sK6)
| less_than(sK6,sK5) ),
inference(instantiation,[status(thm)],[c_309603]) ).
cnf(c_338370,plain,
( ~ less_than(lookup_slb(sK3,sK5),sK5)
| ~ contains_slb(sK3,sK5)
| triple(remove_pqp(sK2,sK5),remove_slb(sK3,sK5),sK4) = remove_cpq(triple(sK2,sK3,sK4),sK5) ),
inference(instantiation,[status(thm)],[c_310504]) ).
cnf(c_338372,plain,
( triple(remove_pqp(sK2,sK5),remove_slb(sK3,sK5),sK4) != remove_cpq(triple(sK2,sK3,sK4),sK5)
| ~ check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5))
| check_cpq(triple(remove_pqp(sK2,sK5),remove_slb(sK3,sK5),sK4)) ),
inference(instantiation,[status(thm)],[c_310843]) ).
cnf(c_342129,plain,
( ~ check_cpq(triple(remove_pqp(sK2,sK5),remove_slb(sK3,sK5),sK4))
| ~ pair_in_list(remove_slb(sK3,sK5),sK5,sK6)
| less_than(sK6,sK5) ),
inference(instantiation,[status(thm)],[c_309603]) ).
cnf(c_402456,plain,
( triple(sK2,sK3,bad) != remove_cpq(triple(sK2,sK3,sK4),sK5)
| ~ check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5))
| check_cpq(triple(sK2,sK3,bad)) ),
inference(instantiation,[status(thm)],[c_310843]) ).
cnf(c_407333,plain,
( ~ check_cpq(triple(sK2,sK3,bad))
| ~ pair_in_list(sK3,sK5,sK6)
| less_than(sK6,sK5) ),
inference(instantiation,[status(thm)],[c_309475]) ).
cnf(c_407334,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_407333,c_402456,c_342129,c_338372,c_338370,c_323521,c_323259,c_323257,c_10122,c_10121,c_4028,c_2012,c_101,c_102,c_99,c_100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV394+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 06:41:13 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 142.14/19.74 % SZS status Started for theBenchmark.p
% 142.14/19.74 % SZS status Theorem for theBenchmark.p
% 142.14/19.74
% 142.14/19.74 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 142.14/19.74
% 142.14/19.74 ------ iProver source info
% 142.14/19.74
% 142.14/19.74 git: date: 2023-05-31 18:12:56 +0000
% 142.14/19.74 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 142.14/19.74 git: non_committed_changes: false
% 142.14/19.74 git: last_make_outside_of_git: false
% 142.14/19.74
% 142.14/19.74 ------ Parsing...
% 142.14/19.74 ------ Clausification by vclausify_rel & Parsing by iProver...
% 142.14/19.74
% 142.14/19.74 ------ Preprocessing... sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 142.14/19.74
% 142.14/19.74 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 142.14/19.74
% 142.14/19.74 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 142.14/19.74 ------ Proving...
% 142.14/19.74 ------ Problem Properties
% 142.14/19.74
% 142.14/19.74
% 142.14/19.74 clauses 47
% 142.14/19.74 conjectures 4
% 142.14/19.74 EPR 8
% 142.14/19.74 Horn 31
% 142.14/19.74 unary 19
% 142.14/19.74 binary 14
% 142.14/19.74 lits 91
% 142.14/19.74 lits eq 28
% 142.14/19.74 fd_pure 0
% 142.14/19.74 fd_pseudo 0
% 142.14/19.74 fd_cond 5
% 142.14/19.74 fd_pseudo_cond 5
% 142.14/19.74 AC symbols 0
% 142.14/19.74
% 142.14/19.74 ------ Input Options Time Limit: Unbounded
% 142.14/19.74
% 142.14/19.74
% 142.14/19.74 ------
% 142.14/19.74 Current options:
% 142.14/19.74 ------
% 142.14/19.74
% 142.14/19.74
% 142.14/19.74
% 142.14/19.74
% 142.14/19.74 ------ Proving...
% 142.14/19.74
% 142.14/19.74
% 142.14/19.74 % SZS status Theorem for theBenchmark.p
% 142.14/19.74
% 142.14/19.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 142.14/19.74
% 142.14/19.75
%------------------------------------------------------------------------------