TSTP Solution File: KRS072+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS072+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:32 EDT 2024
% Result : Unsatisfiable 1.73s 1.12s
% Output : CNFRefutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 6 unt; 0 def)
% Number of atoms : 210 ( 25 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 255 ( 95 ~; 85 |; 62 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 113 ( 0 sgn 58 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( cp2(X3)
& ? [X4] :
( ? [X7] :
( cp1(X7)
& rr(X4,X7) )
& ! [X5,X6] :
( ( rr(X4,X6)
& rr(X4,X5) )
=> X5 = X6 )
& rinvR(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f18,axiom,
! [X3] :
( cp1(X3)
=> ~ ( cp5(X3)
| cp4(X3)
| cp2(X3)
| cp3(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f22,axiom,
! [X3,X4] :
( rinvR(X3,X4)
<=> rr(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f23,axiom,
cUnsatisfiable(i2003_11_14_17_18_50190),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(f26,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( cp2(X0)
& ? [X1] :
( ? [X2] :
( cp1(X2)
& rr(X1,X2) )
& ! [X3,X4] :
( ( rr(X1,X4)
& rr(X1,X3) )
=> X3 = X4 )
& rinvR(X0,X1) ) ) ),
inference(rectify,[],[f17]) ).
fof(f27,plain,
! [X0] :
( cp1(X0)
=> ~ ( cp5(X0)
| cp4(X0)
| cp2(X0)
| cp3(X0) ) ),
inference(rectify,[],[f18]) ).
fof(f31,plain,
! [X0,X1] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
inference(rectify,[],[f22]) ).
fof(f60,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( cp2(X0)
& ? [X1] :
( ? [X2] :
( cp1(X2)
& rr(X1,X2) )
& ! [X3,X4] :
( X3 = X4
| ~ rr(X1,X4)
| ~ rr(X1,X3) )
& rinvR(X0,X1) ) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f61,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( cp2(X0)
& ? [X1] :
( ? [X2] :
( cp1(X2)
& rr(X1,X2) )
& ! [X3,X4] :
( X3 = X4
| ~ rr(X1,X4)
| ~ rr(X1,X3) )
& rinvR(X0,X1) ) ) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0] :
( ( ~ cp5(X0)
& ~ cp4(X0)
& ~ cp2(X0)
& ~ cp3(X0) )
| ~ cp1(X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f67,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ cp2(X0)
| ! [X1] :
( ! [X2] :
( ~ cp1(X2)
| ~ rr(X1,X2) )
| ? [X3,X4] :
( X3 != X4
& rr(X1,X4)
& rr(X1,X3) )
| ~ rinvR(X0,X1) ) )
& ( ( cp2(X0)
& ? [X1] :
( ? [X2] :
( cp1(X2)
& rr(X1,X2) )
& ! [X3,X4] :
( X3 = X4
| ~ rr(X1,X4)
| ~ rr(X1,X3) )
& rinvR(X0,X1) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f61]) ).
fof(f68,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ cp2(X0)
| ! [X1] :
( ! [X2] :
( ~ cp1(X2)
| ~ rr(X1,X2) )
| ? [X3,X4] :
( X3 != X4
& rr(X1,X4)
& rr(X1,X3) )
| ~ rinvR(X0,X1) ) )
& ( ( cp2(X0)
& ? [X1] :
( ? [X2] :
( cp1(X2)
& rr(X1,X2) )
& ! [X3,X4] :
( X3 = X4
| ~ rr(X1,X4)
| ~ rr(X1,X3) )
& rinvR(X0,X1) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ cp2(X0)
| ! [X1] :
( ! [X2] :
( ~ cp1(X2)
| ~ rr(X1,X2) )
| ? [X3,X4] :
( X3 != X4
& rr(X1,X4)
& rr(X1,X3) )
| ~ rinvR(X0,X1) ) )
& ( ( cp2(X0)
& ? [X5] :
( ? [X6] :
( cp1(X6)
& rr(X5,X6) )
& ! [X7,X8] :
( X7 = X8
| ~ rr(X5,X8)
| ~ rr(X5,X7) )
& rinvR(X0,X5) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f68]) ).
fof(f70,plain,
! [X1] :
( ? [X3,X4] :
( X3 != X4
& rr(X1,X4)
& rr(X1,X3) )
=> ( sK0(X1) != sK1(X1)
& rr(X1,sK1(X1))
& rr(X1,sK0(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f71,plain,
! [X0] :
( ? [X5] :
( ? [X6] :
( cp1(X6)
& rr(X5,X6) )
& ! [X7,X8] :
( X7 = X8
| ~ rr(X5,X8)
| ~ rr(X5,X7) )
& rinvR(X0,X5) )
=> ( ? [X6] :
( cp1(X6)
& rr(sK2(X0),X6) )
& ! [X8,X7] :
( X7 = X8
| ~ rr(sK2(X0),X8)
| ~ rr(sK2(X0),X7) )
& rinvR(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f72,plain,
! [X0] :
( ? [X6] :
( cp1(X6)
& rr(sK2(X0),X6) )
=> ( cp1(sK3(X0))
& rr(sK2(X0),sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f73,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ cp2(X0)
| ! [X1] :
( ! [X2] :
( ~ cp1(X2)
| ~ rr(X1,X2) )
| ( sK0(X1) != sK1(X1)
& rr(X1,sK1(X1))
& rr(X1,sK0(X1)) )
| ~ rinvR(X0,X1) ) )
& ( ( cp2(X0)
& cp1(sK3(X0))
& rr(sK2(X0),sK3(X0))
& ! [X7,X8] :
( X7 = X8
| ~ rr(sK2(X0),X8)
| ~ rr(sK2(X0),X7) )
& rinvR(X0,sK2(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f69,f72,f71,f70]) ).
fof(f74,plain,
! [X0,X1] :
( ( rinvR(X0,X1)
| ~ rr(X1,X0) )
& ( rr(X1,X0)
| ~ rinvR(X0,X1) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f93,plain,
! [X0] :
( rinvR(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f94,plain,
! [X0,X8,X7] :
( X7 = X8
| ~ rr(sK2(X0),X8)
| ~ rr(sK2(X0),X7)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f95,plain,
! [X0] :
( rr(sK2(X0),sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f96,plain,
! [X0] :
( cp1(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f97,plain,
! [X0] :
( cp2(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f102,plain,
! [X0] :
( ~ cp2(X0)
| ~ cp1(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f111,plain,
! [X0,X1] :
( rr(X1,X0)
| ~ rinvR(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
fof(f113,plain,
cUnsatisfiable(i2003_11_14_17_18_50190),
inference(cnf_transformation,[],[f23]) ).
cnf(c_56,plain,
( ~ cUnsatisfiable(X0)
| cp2(X0) ),
inference(cnf_transformation,[],[f97]) ).
cnf(c_57,plain,
( ~ cUnsatisfiable(X0)
| cp1(sK3(X0)) ),
inference(cnf_transformation,[],[f96]) ).
cnf(c_58,plain,
( ~ cUnsatisfiable(X0)
| rr(sK2(X0),sK3(X0)) ),
inference(cnf_transformation,[],[f95]) ).
cnf(c_59,plain,
( ~ rr(sK2(X0),X1)
| ~ rr(sK2(X0),X2)
| ~ cUnsatisfiable(X0)
| X1 = X2 ),
inference(cnf_transformation,[],[f94]) ).
cnf(c_60,plain,
( ~ cUnsatisfiable(X0)
| rinvR(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f93]) ).
cnf(c_63,plain,
( ~ cp2(X0)
| ~ cp1(X0) ),
inference(cnf_transformation,[],[f102]) ).
cnf(c_72,plain,
( ~ rinvR(X0,X1)
| rr(X1,X0) ),
inference(cnf_transformation,[],[f111]) ).
cnf(c_73,plain,
cUnsatisfiable(i2003_11_14_17_18_50190),
inference(cnf_transformation,[],[f113]) ).
cnf(c_99,plain,
( ~ cUnsatisfiable(X0)
| cp2(X0) ),
inference(prop_impl_just,[status(thm)],[c_56]) ).
cnf(c_101,plain,
( ~ cUnsatisfiable(X0)
| cp1(sK3(X0)) ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
cnf(c_105,plain,
( ~ cUnsatisfiable(X0)
| rinvR(X0,sK2(X0)) ),
inference(prop_impl_just,[status(thm)],[c_60]) ).
cnf(c_109,plain,
( ~ cp2(X0)
| ~ cp1(X0) ),
inference(prop_impl_just,[status(thm)],[c_63]) ).
cnf(c_151,plain,
( ~ rinvR(X0,X1)
| rr(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_72]) ).
cnf(c_439,plain,
( X0 != X1
| ~ cUnsatisfiable(X0)
| ~ cp1(X1) ),
inference(resolution_lifted,[status(thm)],[c_99,c_109]) ).
cnf(c_440,plain,
( ~ cUnsatisfiable(X0)
| ~ cp1(X0) ),
inference(unflattening,[status(thm)],[c_439]) ).
cnf(c_456,plain,
( sK3(X0) != X1
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X1) ),
inference(resolution_lifted,[status(thm)],[c_101,c_440]) ).
cnf(c_457,plain,
( ~ cUnsatisfiable(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(unflattening,[status(thm)],[c_456]) ).
cnf(c_467,plain,
( sK2(X0) != X1
| X0 != X2
| ~ cUnsatisfiable(X0)
| rr(X1,X2) ),
inference(resolution_lifted,[status(thm)],[c_105,c_151]) ).
cnf(c_468,plain,
( ~ cUnsatisfiable(X0)
| rr(sK2(X0),X0) ),
inference(unflattening,[status(thm)],[c_467]) ).
cnf(c_641,plain,
( ~ rr(sK2(X0),X1)
| ~ cUnsatisfiable(X0)
| X0 = X1 ),
inference(superposition,[status(thm)],[c_468,c_59]) ).
cnf(c_655,plain,
( ~ cUnsatisfiable(X0)
| sK3(X0) = X0 ),
inference(superposition,[status(thm)],[c_58,c_641]) ).
cnf(c_664,plain,
sK3(i2003_11_14_17_18_50190) = i2003_11_14_17_18_50190,
inference(superposition,[status(thm)],[c_73,c_655]) ).
cnf(c_666,plain,
~ cUnsatisfiable(i2003_11_14_17_18_50190),
inference(superposition,[status(thm)],[c_664,c_457]) ).
cnf(c_667,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_666,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS072+1 : TPTP v8.1.2. Released v3.1.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n031.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:16:16 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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
% 1.73/1.12 % SZS status Started for theBenchmark.p
% 1.73/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 1.73/1.12
% 1.73/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.73/1.12
% 1.73/1.12 ------ iProver source info
% 1.73/1.12
% 1.73/1.12 git: date: 2024-05-02 19:28:25 +0000
% 1.73/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.73/1.12 git: non_committed_changes: false
% 1.73/1.12
% 1.73/1.12 ------ Parsing...
% 1.73/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.73/1.12
% 1.73/1.12 ------ Preprocessing... sup_sim: 0 sf_s rm: 14 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 1.73/1.12
% 1.73/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.73/1.12
% 1.73/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.73/1.12 ------ Proving...
% 1.73/1.12 ------ Problem Properties
% 1.73/1.12
% 1.73/1.12
% 1.73/1.12 clauses 5
% 1.73/1.12 conjectures 0
% 1.73/1.12 EPR 1
% 1.73/1.12 Horn 5
% 1.73/1.12 unary 1
% 1.73/1.12 binary 3
% 1.73/1.12 lits 11
% 1.73/1.12 lits eq 1
% 1.73/1.12 fd_pure 0
% 1.73/1.12 fd_pseudo 0
% 1.73/1.12 fd_cond 0
% 1.73/1.12 fd_pseudo_cond 1
% 1.73/1.12 AC symbols 0
% 1.73/1.12
% 1.73/1.12 ------ Schedule dynamic 5 is on
% 1.73/1.12
% 1.73/1.12 ------ no conjectures: strip conj schedule
% 1.73/1.12
% 1.73/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.73/1.12
% 1.73/1.12
% 1.73/1.12 ------
% 1.73/1.12 Current options:
% 1.73/1.12 ------
% 1.73/1.12
% 1.73/1.12
% 1.73/1.12
% 1.73/1.12
% 1.73/1.12 ------ Proving...
% 1.73/1.12
% 1.73/1.12
% 1.73/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 1.73/1.12
% 1.73/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.73/1.12
% 1.73/1.12
%------------------------------------------------------------------------------