TSTP Solution File: KRS085+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS085+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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 02:33:34 EDT 2024
% Result : Unsatisfiable 0.48s 1.16s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 4 unt; 0 def)
% Number of atoms : 174 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 212 ( 80 ~; 69 |; 51 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 94 ( 0 sgn 57 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( cp1(X3)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( rinvR(X5,X6)
=> ~ cp1(X6) )
& cp1(X5)
& rr(X4,X5) )
& rr(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f20,axiom,
! [X3,X4] :
( rinvR(X3,X4)
<=> rr(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f21,axiom,
! [X3,X4,X5] :
( ( rr(X4,X5)
& rr(X3,X4) )
=> rr(X3,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f22,axiom,
cUnsatisfiable(i2003_11_14_17_19_39537),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f25,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( cp1(X0)
& ? [X1] :
( ? [X2] :
( ! [X3] :
( rinvR(X2,X3)
=> ~ cp1(X3) )
& cp1(X2)
& rr(X1,X2) )
& rr(X0,X1) ) ) ),
inference(rectify,[],[f17]) ).
fof(f28,plain,
! [X0,X1] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
inference(rectify,[],[f20]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( rr(X1,X2)
& rr(X0,X1) )
=> rr(X0,X2) ),
inference(rectify,[],[f21]) ).
fof(f58,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( cp1(X0)
& ? [X1] :
( ? [X2] :
( ! [X3] :
( ~ cp1(X3)
| ~ rinvR(X2,X3) )
& cp1(X2)
& rr(X1,X2) )
& rr(X0,X1) ) ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f61,plain,
! [X0,X1,X2] :
( rr(X0,X2)
| ~ rr(X1,X2)
| ~ rr(X0,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f62,plain,
! [X0,X1,X2] :
( rr(X0,X2)
| ~ rr(X1,X2)
| ~ rr(X0,X1) ),
inference(flattening,[],[f61]) ).
fof(f64,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ cp1(X0)
| ! [X1] :
( ! [X2] :
( ? [X3] :
( cp1(X3)
& rinvR(X2,X3) )
| ~ cp1(X2)
| ~ rr(X1,X2) )
| ~ rr(X0,X1) ) )
& ( ( cp1(X0)
& ? [X1] :
( ? [X2] :
( ! [X3] :
( ~ cp1(X3)
| ~ rinvR(X2,X3) )
& cp1(X2)
& rr(X1,X2) )
& rr(X0,X1) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f58]) ).
fof(f65,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ cp1(X0)
| ! [X1] :
( ! [X2] :
( ? [X3] :
( cp1(X3)
& rinvR(X2,X3) )
| ~ cp1(X2)
| ~ rr(X1,X2) )
| ~ rr(X0,X1) ) )
& ( ( cp1(X0)
& ? [X1] :
( ? [X2] :
( ! [X3] :
( ~ cp1(X3)
| ~ rinvR(X2,X3) )
& cp1(X2)
& rr(X1,X2) )
& rr(X0,X1) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ cp1(X0)
| ! [X1] :
( ! [X2] :
( ? [X3] :
( cp1(X3)
& rinvR(X2,X3) )
| ~ cp1(X2)
| ~ rr(X1,X2) )
| ~ rr(X0,X1) ) )
& ( ( cp1(X0)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ~ cp1(X6)
| ~ rinvR(X5,X6) )
& cp1(X5)
& rr(X4,X5) )
& rr(X0,X4) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f65]) ).
fof(f67,plain,
! [X2] :
( ? [X3] :
( cp1(X3)
& rinvR(X2,X3) )
=> ( cp1(sK0(X2))
& rinvR(X2,sK0(X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
! [X0] :
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ~ cp1(X6)
| ~ rinvR(X5,X6) )
& cp1(X5)
& rr(X4,X5) )
& rr(X0,X4) )
=> ( ? [X5] :
( ! [X6] :
( ~ cp1(X6)
| ~ rinvR(X5,X6) )
& cp1(X5)
& rr(sK1(X0),X5) )
& rr(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
! [X0] :
( ? [X5] :
( ! [X6] :
( ~ cp1(X6)
| ~ rinvR(X5,X6) )
& cp1(X5)
& rr(sK1(X0),X5) )
=> ( ! [X6] :
( ~ cp1(X6)
| ~ rinvR(sK2(X0),X6) )
& cp1(sK2(X0))
& rr(sK1(X0),sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f70,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ cp1(X0)
| ! [X1] :
( ! [X2] :
( ( cp1(sK0(X2))
& rinvR(X2,sK0(X2)) )
| ~ cp1(X2)
| ~ rr(X1,X2) )
| ~ rr(X0,X1) ) )
& ( ( cp1(X0)
& ! [X6] :
( ~ cp1(X6)
| ~ rinvR(sK2(X0),X6) )
& cp1(sK2(X0))
& rr(sK1(X0),sK2(X0))
& rr(X0,sK1(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f66,f69,f68,f67]) ).
fof(f72,plain,
! [X0,X1] :
( ( rinvR(X0,X1)
| ~ rr(X1,X0) )
& ( rr(X1,X0)
| ~ rinvR(X0,X1) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f91,plain,
! [X0] :
( rr(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f92,plain,
! [X0] :
( rr(sK1(X0),sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f94,plain,
! [X0,X6] :
( ~ cp1(X6)
| ~ rinvR(sK2(X0),X6)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f95,plain,
! [X0] :
( cp1(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f102,plain,
! [X0,X1] :
( rinvR(X0,X1)
| ~ rr(X1,X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f103,plain,
! [X2,X0,X1] :
( rr(X0,X2)
| ~ rr(X1,X2)
| ~ rr(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
fof(f104,plain,
cUnsatisfiable(i2003_11_14_17_19_39537),
inference(cnf_transformation,[],[f22]) ).
cnf(c_55,plain,
( ~ cUnsatisfiable(X0)
| cp1(X0) ),
inference(cnf_transformation,[],[f95]) ).
cnf(c_56,plain,
( ~ rinvR(sK2(X0),X1)
| ~ cUnsatisfiable(X0)
| ~ cp1(X1) ),
inference(cnf_transformation,[],[f94]) ).
cnf(c_58,plain,
( ~ cUnsatisfiable(X0)
| rr(sK1(X0),sK2(X0)) ),
inference(cnf_transformation,[],[f92]) ).
cnf(c_59,plain,
( ~ cUnsatisfiable(X0)
| rr(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f91]) ).
cnf(c_63,plain,
( ~ rr(X0,X1)
| rinvR(X1,X0) ),
inference(cnf_transformation,[],[f102]) ).
cnf(c_65,plain,
( ~ rr(X0,X1)
| ~ rr(X1,X2)
| rr(X0,X2) ),
inference(cnf_transformation,[],[f103]) ).
cnf(c_66,plain,
cUnsatisfiable(i2003_11_14_17_19_39537),
inference(cnf_transformation,[],[f104]) ).
cnf(c_70,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_39537)
| cp1(i2003_11_14_17_19_39537) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_77,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_39537)
| rr(i2003_11_14_17_19_39537,sK1(i2003_11_14_17_19_39537)) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_78,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_39537)
| rr(sK1(i2003_11_14_17_19_39537),sK2(i2003_11_14_17_19_39537)) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_98,plain,
( ~ rr(X0,X1)
| rinvR(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_63]) ).
cnf(c_368,plain,
( ~ rr(X0,sK2(X1))
| ~ cUnsatisfiable(X1)
| ~ cp1(X0) ),
inference(resolution,[status(thm)],[c_56,c_98]) ).
cnf(c_369,plain,
( ~ rr(i2003_11_14_17_19_39537,sK2(i2003_11_14_17_19_39537))
| ~ cUnsatisfiable(i2003_11_14_17_19_39537)
| ~ cp1(i2003_11_14_17_19_39537) ),
inference(instantiation,[status(thm)],[c_368]) ).
cnf(c_1011,plain,
( ~ rr(sK1(X0),X1)
| ~ rr(X0,sK1(X0))
| rr(X0,X1) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_1020,plain,
( ~ rr(sK1(X0),sK2(X0))
| ~ rr(X0,sK1(X0))
| rr(X0,sK2(X0)) ),
inference(instantiation,[status(thm)],[c_1011]) ).
cnf(c_1021,plain,
( ~ rr(sK1(i2003_11_14_17_19_39537),sK2(i2003_11_14_17_19_39537))
| ~ rr(i2003_11_14_17_19_39537,sK1(i2003_11_14_17_19_39537))
| rr(i2003_11_14_17_19_39537,sK2(i2003_11_14_17_19_39537)) ),
inference(instantiation,[status(thm)],[c_1020]) ).
cnf(c_1022,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1021,c_369,c_78,c_77,c_70,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS085+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 23:14:45 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.16 % SZS status Started for theBenchmark.p
% 0.48/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.16
% 0.48/1.16 ------ iProver source info
% 0.48/1.16
% 0.48/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.16 git: non_committed_changes: false
% 0.48/1.16
% 0.48/1.16 ------ Parsing...
% 0.48/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 8 0s sf_e pe_s pe_e sf_s rm: 1 0s sf_e pe_s pe_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.16 ------ Proving...
% 0.48/1.16 ------ Problem Properties
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 clauses 11
% 0.48/1.16 conjectures 0
% 0.48/1.16 EPR 5
% 0.48/1.16 Horn 9
% 0.48/1.16 unary 1
% 0.48/1.16 binary 6
% 0.48/1.16 lits 31
% 0.48/1.16 lits eq 0
% 0.48/1.16 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 0.48/1.16 fd_cond 0
% 0.48/1.16 fd_pseudo_cond 0
% 0.48/1.16 AC symbols 0
% 0.48/1.16
% 0.48/1.16 ------ Schedule dynamic 5 is on
% 0.48/1.16
% 0.48/1.16 ------ no conjectures: strip conj schedule
% 0.48/1.16
% 0.48/1.16 ------ no equalities: superposition off
% 0.48/1.16
% 0.48/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------
% 0.48/1.16 Current options:
% 0.48/1.16 ------
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Proving...
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.16
% 0.48/1.17
%------------------------------------------------------------------------------