TSTP Solution File: LCL646+1.001 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL646+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 07:45:34 EDT 2023
% Result : Theorem 0.73s 1.15s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 5 unt; 0 def)
% Number of atoms : 194 ( 0 equ)
% Maximal formula atoms : 18 ( 7 avg)
% Number of connectives : 307 ( 139 ~; 131 |; 32 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 114 ( 0 sgn; 80 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
~ ? [X0] :
~ ( ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p2(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p3(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p5(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p4(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p6(X1)
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f2,negated_conjecture,
~ ~ ? [X0] :
~ ( ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p2(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p3(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p5(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p4(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p6(X1)
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ~ ? [X0] :
~ ( ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ! [X2] :
( p2(X2)
| ~ r1(X0,X2) )
| ! [X3] :
( p3(X3)
| ~ r1(X0,X3) )
| ! [X4] :
( p5(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p2(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p4(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p2(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p6(X8)
| ~ r1(X0,X8) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
? [X0] :
~ ( ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ! [X2] :
( p2(X2)
| ~ r1(X0,X2) )
| ! [X3] :
( p3(X3)
| ~ r1(X0,X3) )
| ! [X4] :
( p5(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p2(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p4(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p2(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p6(X8)
| ~ r1(X0,X8) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p2(X2)
| ~ r1(X0,X2) )
| ! [X3] :
( p3(X3)
| ~ r1(X0,X3) )
| ! [X4] :
( p5(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p2(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p4(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p2(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p6(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f6,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p2(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] :
( p5(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p2(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p4(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p2(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p6(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f5]) ).
fof(f7,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p2(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X5] :
( p2(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p4(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p2(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p6(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f8,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p2(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X5] :
( p2(X5)
| ~ r1(X0,X5) )
| ~ ! [X7] :
( p2(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p6(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f7]) ).
fof(f9,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p2(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X5] :
( p2(X5)
| ~ r1(X0,X5) )
| ~ ! [X7] :
( p2(X7)
| ~ r1(X0,X7) ) ),
inference(pure_predicate_removal,[],[f8]) ).
fof(f10,plain,
? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X2] :
( ~ p2(X2)
& r1(X0,X2) )
& ? [X3] : r1(X0,X3)
& ? [X4] : r1(X0,X4)
& ! [X5] :
( p2(X5)
| ~ r1(X0,X5) )
& ! [X7] :
( p2(X7)
| ~ r1(X0,X7) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f11,plain,
? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X2] :
( ~ p2(X2)
& r1(X0,X2) )
& ? [X3] : r1(X0,X3)
& ? [X4] : r1(X0,X4)
& ! [X5] :
( p2(X5)
| ~ r1(X0,X5) )
& ! [X6] :
( p2(X6)
| ~ r1(X0,X6) ) ),
inference(rectify,[],[f10]) ).
fof(f12,plain,
( ? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X2] :
( ~ p2(X2)
& r1(X0,X2) )
& ? [X3] : r1(X0,X3)
& ? [X4] : r1(X0,X4)
& ! [X5] :
( p2(X5)
| ~ r1(X0,X5) )
& ! [X6] :
( p2(X6)
| ~ r1(X0,X6) ) )
=> ( ? [X1] : r1(sK0,X1)
& ? [X2] :
( ~ p2(X2)
& r1(sK0,X2) )
& ? [X3] : r1(sK0,X3)
& ? [X4] : r1(sK0,X4)
& ! [X5] :
( p2(X5)
| ~ r1(sK0,X5) )
& ! [X6] :
( p2(X6)
| ~ r1(sK0,X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ? [X1] : r1(sK0,X1)
=> r1(sK0,sK1) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( ? [X2] :
( ~ p2(X2)
& r1(sK0,X2) )
=> ( ~ p2(sK2)
& r1(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X3] : r1(sK0,X3)
=> r1(sK0,sK3) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ? [X4] : r1(sK0,X4)
=> r1(sK0,sK4) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( r1(sK0,sK1)
& ~ p2(sK2)
& r1(sK0,sK2)
& r1(sK0,sK3)
& r1(sK0,sK4)
& ! [X5] :
( p2(X5)
| ~ r1(sK0,X5) )
& ! [X6] :
( p2(X6)
| ~ r1(sK0,X6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f11,f16,f15,f14,f13,f12]) ).
fof(f18,plain,
! [X6] :
( p2(X6)
| ~ r1(sK0,X6) ),
inference(cnf_transformation,[],[f17]) ).
fof(f22,plain,
r1(sK0,sK2),
inference(cnf_transformation,[],[f17]) ).
fof(f23,plain,
~ p2(sK2),
inference(cnf_transformation,[],[f17]) ).
cnf(c_50,negated_conjecture,
~ p2(sK2),
inference(cnf_transformation,[],[f23]) ).
cnf(c_51,negated_conjecture,
r1(sK0,sK2),
inference(cnf_transformation,[],[f22]) ).
cnf(c_55,negated_conjecture,
( ~ r1(sK0,X0)
| p2(X0) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_57,negated_conjecture,
( ~ r1(sK0,X0_14)
| p2(X0_14) ),
inference(subtyping,[status(esa)],[c_55]) ).
cnf(c_63,plain,
( ~ r1(sK0,sK2)
| p2(sK2) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_64,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_63,c_50,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL646+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.16/0.34 % Computer : n029.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Fri Aug 25 01:06:24 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.73/1.15 % SZS status Started for theBenchmark.p
% 0.73/1.15 % SZS status Theorem for theBenchmark.p
% 0.73/1.15
% 0.73/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.73/1.15
% 0.73/1.15 ------ iProver source info
% 0.73/1.15
% 0.73/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.73/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.73/1.15 git: non_committed_changes: false
% 0.73/1.15 git: last_make_outside_of_git: false
% 0.73/1.15
% 0.73/1.15 ------ Parsing...
% 0.73/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.73/1.15
% 0.73/1.15
% 0.73/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e sf_s rm: 0 0s sf_e
% 0.73/1.15
% 0.73/1.15 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.73/1.15 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.73/1.15 ------ Proving...
% 0.73/1.15 ------ Problem Properties
% 0.73/1.15
% 0.73/1.15
% 0.73/1.15 clauses 6
% 0.73/1.15 conjectures 6
% 0.73/1.15 EPR 6
% 0.73/1.15 Horn 6
% 0.73/1.15 unary 5
% 0.73/1.15 binary 1
% 0.73/1.15 lits 7
% 0.73/1.15 lits eq 0
% 0.73/1.15 fd_pure 0
% 0.73/1.15 fd_pseudo 0
% 0.73/1.15 fd_cond 0
% 0.73/1.15 fd_pseudo_cond 0
% 0.73/1.15 AC symbols 0
% 0.73/1.15
% 0.73/1.15 ------ Schedule EPR Horn non eq is on
% 0.73/1.15
% 0.73/1.15 ------ no equalities: superposition off
% 0.73/1.15
% 0.73/1.15 ------ Option_epr_horn Time Limit: Unbounded
% 0.73/1.15
% 0.73/1.15
% 0.73/1.15 ------
% 0.73/1.15 Current options:
% 0.73/1.15 ------
% 0.73/1.15
% 0.73/1.15
% 0.73/1.15
% 0.73/1.15
% 0.73/1.15 ------ Proving...
% 0.73/1.15
% 0.73/1.15
% 0.73/1.15 % SZS status Theorem for theBenchmark.p
% 0.73/1.15
% 0.73/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.73/1.15
% 0.73/1.15
%------------------------------------------------------------------------------