TSTP Solution File: SWV394+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV394+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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 : Fri May 3 03:14:19 EDT 2024
% Result : Theorem 115.12s 16.31s
% Output : CNFRefutation 115.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 83 ( 11 unt; 0 def)
% Number of atoms : 242 ( 40 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 268 ( 109 ~; 110 |; 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 : 202 ( 15 sgn 119 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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_184,plain,
X0 = X0,
theory(equality) ).
cnf(c_186,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_202,plain,
( X0 != X1
| ~ check_cpq(X1)
| check_cpq(X0) ),
theory(equality) ).
cnf(c_220,plain,
( less_than(sK6,sK5)
| strictly_less_than(sK5,sK6) ),
inference(instantiation,[status(thm)],[c_137]) ).
cnf(c_254,plain,
( ~ ok(remove_cpq(triple(X0,X1,X2),sK5))
| ~ pair_in_list(X1,sK5,sK6)
| ~ strictly_less_than(sK5,sK6)
| pair_in_list(remove_slb(X1,sK5),sK5,sK6) ),
inference(instantiation,[status(thm)],[c_98]) ).
cnf(c_277,plain,
( remove_cpq(triple(sK2,sK3,sK4),sK5) != X0
| X1 != X0
| X1 = remove_cpq(triple(sK2,sK3,sK4),sK5) ),
inference(instantiation,[status(thm)],[c_186]) ).
cnf(c_858,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_277]) ).
cnf(c_859,plain,
( remove_cpq(triple(sK2,sK3,sK4),sK5) = triple(sK2,sK3,bad)
| contains_slb(sK3,sK5) ),
inference(instantiation,[status(thm)],[c_86]) ).
cnf(c_1013,plain,
( ~ ok(remove_cpq(triple(sK2,sK3,sK4),sK5))
| ~ pair_in_list(sK3,sK5,sK6)
| ~ strictly_less_than(sK5,sK6)
| pair_in_list(remove_slb(sK3,sK5),sK5,sK6) ),
inference(instantiation,[status(thm)],[c_254]) ).
cnf(c_3085,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_858]) ).
cnf(c_3086,plain,
triple(sK2,sK3,bad) = triple(sK2,sK3,bad),
inference(instantiation,[status(thm)],[c_184]) ).
cnf(c_61888,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_61902,plain,
( less_than(X0,sK5)
| strictly_less_than(sK5,X0) ),
inference(instantiation,[status(thm)],[c_137]) ).
cnf(c_61914,plain,
( ~ check_cpq(triple(X0,sK3,X1))
| ~ pair_in_list(sK3,sK5,sK6)
| less_than(sK6,sK5) ),
inference(instantiation,[status(thm)],[c_61888]) ).
cnf(c_62032,plain,
( triple(X0,sK3,X1) != X2
| ~ check_cpq(X2)
| check_cpq(triple(X0,sK3,X1)) ),
inference(instantiation,[status(thm)],[c_202]) ).
cnf(c_63048,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_202]) ).
cnf(c_64251,plain,
( triple(X0,sK3,X1) != remove_cpq(triple(sK2,sK3,sK4),sK5)
| ~ check_cpq(remove_cpq(triple(sK2,sK3,sK4),sK5))
| check_cpq(triple(X0,sK3,X1)) ),
inference(instantiation,[status(thm)],[c_62032]) ).
cnf(c_66975,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_61888]) ).
cnf(c_85866,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_64251]) ).
cnf(c_86357,plain,
( ~ check_cpq(triple(sK2,sK3,bad))
| ~ pair_in_list(sK3,sK5,sK6)
| less_than(sK6,sK5) ),
inference(instantiation,[status(thm)],[c_61914]) ).
cnf(c_93584,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_93594,plain,
( ~ strictly_less_than(sK5,lookup_slb(sK3,sK5))
| ~ contains_slb(sK3,sK5)
| triple(remove_pqp(X0,sK5),remove_slb(sK3,sK5),bad) = remove_cpq(triple(X0,sK3,X1),sK5) ),
inference(instantiation,[status(thm)],[c_88]) ).
cnf(c_118506,plain,
( less_than(lookup_slb(sK3,sK5),sK5)
| strictly_less_than(sK5,lookup_slb(sK3,sK5)) ),
inference(instantiation,[status(thm)],[c_61902]) ).
cnf(c_151884,plain,
( ~ strictly_less_than(sK5,lookup_slb(sK3,sK5))
| ~ contains_slb(sK3,sK5)
| triple(remove_pqp(sK2,sK5),remove_slb(sK3,sK5),bad) = remove_cpq(triple(sK2,sK3,sK4),sK5) ),
inference(instantiation,[status(thm)],[c_93594]) ).
cnf(c_151886,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_63048]) ).
cnf(c_152519,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_93584]) ).
cnf(c_152521,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_63048]) ).
cnf(c_154176,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_66975]) ).
cnf(c_158821,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_66975]) ).
cnf(c_158822,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_158821,c_154176,c_152521,c_152519,c_151886,c_151884,c_118506,c_86357,c_85866,c_3086,c_3085,c_1013,c_859,c_220,c_101,c_102,c_99,c_100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV394+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 00:13:33 EDT 2024
% 0.20/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 115.12/16.31 % SZS status Started for theBenchmark.p
% 115.12/16.31 % SZS status Theorem for theBenchmark.p
% 115.12/16.31
% 115.12/16.31 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 115.12/16.31
% 115.12/16.31 ------ iProver source info
% 115.12/16.31
% 115.12/16.31 git: date: 2024-05-02 19:28:25 +0000
% 115.12/16.31 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 115.12/16.31 git: non_committed_changes: false
% 115.12/16.31
% 115.12/16.31 ------ Parsing...
% 115.12/16.31 ------ Clausification by vclausify_rel & Parsing by iProver...
% 115.12/16.31
% 115.12/16.31 ------ Preprocessing... sf_s rm: 7 0s sf_e sf_s rm: 2 0s sf_e
% 115.12/16.31
% 115.12/16.31 ------ Preprocessing...
% 115.12/16.31
% 115.12/16.31 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 115.12/16.31 ------ Proving...
% 115.12/16.31 ------ Problem Properties
% 115.12/16.31
% 115.12/16.31
% 115.12/16.31 clauses 49
% 115.12/16.31 conjectures 4
% 115.12/16.31 EPR 10
% 115.12/16.31 Horn 35
% 115.12/16.31 unary 20
% 115.12/16.31 binary 14
% 115.12/16.31 lits 95
% 115.12/16.31 lits eq 27
% 115.12/16.31 fd_pure 0
% 115.12/16.31 fd_pseudo 0
% 115.12/16.31 fd_cond 5
% 115.12/16.31 fd_pseudo_cond 5
% 115.12/16.31 AC symbols 0
% 115.12/16.31
% 115.12/16.31 ------ Input Options Time Limit: Unbounded
% 115.12/16.31
% 115.12/16.31
% 115.12/16.31 ------
% 115.12/16.31 Current options:
% 115.12/16.31 ------
% 115.12/16.31
% 115.12/16.31
% 115.12/16.31
% 115.12/16.31
% 115.12/16.31 ------ Proving...
% 115.12/16.31
% 115.12/16.31
% 115.12/16.31 % SZS status Theorem for theBenchmark.p
% 115.12/16.31
% 115.12/16.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 115.12/16.31
% 115.12/16.32
%------------------------------------------------------------------------------