TSTP Solution File: KRS096+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS096+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:36 EDT 2024
% Result : Unsatisfiable 1.87s 1.19s
% Output : CNFRefutation 1.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 4 unt; 0 def)
% Number of atoms : 171 ( 22 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 209 ( 78 ~; 66 |; 54 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 89 ( 0 sgn 46 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ! [X5,X6] :
( ( rr(X3,X6)
& rr(X3,X5) )
=> X5 = X6 )
& ? [X4] :
( cd(X4)
& rr(X3,X4) )
& ? [X4] :
( cc(X4)
& rr(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f13,axiom,
! [X3] :
( cc(X3)
=> ~ cd(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f14,axiom,
cUnsatisfiable(i2003_11_14_17_20_18265),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f17,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( ( rr(X0,X2)
& rr(X0,X1) )
=> X1 = X2 )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) ) ),
inference(rectify,[],[f12]) ).
fof(f18,plain,
! [X0] :
( cc(X0)
=> ~ cd(X0) ),
inference(rectify,[],[f13]) ).
fof(f37,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f38,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) ) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
! [X0] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f41,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ! [X4] :
( ~ cc(X4)
| ~ rr(X0,X4) ) )
& ( ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f38]) ).
fof(f42,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ! [X4] :
( ~ cc(X4)
| ~ rr(X0,X4) ) )
& ( ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f41]) ).
fof(f43,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ! [X4] :
( ~ cc(X4)
| ~ rr(X0,X4) ) )
& ( ( ! [X5,X6] :
( X5 = X6
| ~ rr(X0,X6)
| ~ rr(X0,X5) )
& ? [X7] :
( cd(X7)
& rr(X0,X7) )
& ? [X8] :
( cc(X8)
& rr(X0,X8) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f42]) ).
fof(f44,plain,
! [X0] :
( ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
=> ( sK0(X0) != sK1(X0)
& rr(X0,sK1(X0))
& rr(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
! [X0] :
( ? [X7] :
( cd(X7)
& rr(X0,X7) )
=> ( cd(sK2(X0))
& rr(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
! [X0] :
( ? [X8] :
( cc(X8)
& rr(X0,X8) )
=> ( cc(sK3(X0))
& rr(X0,sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f47,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ( sK0(X0) != sK1(X0)
& rr(X0,sK1(X0))
& rr(X0,sK0(X0)) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ! [X4] :
( ~ cc(X4)
| ~ rr(X0,X4) ) )
& ( ( ! [X5,X6] :
( X5 = X6
| ~ rr(X0,X6)
| ~ rr(X0,X5) )
& cd(sK2(X0))
& rr(X0,sK2(X0))
& cc(sK3(X0))
& rr(X0,sK3(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f43,f46,f45,f44]) ).
fof(f61,plain,
! [X0] :
( rr(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f62,plain,
! [X0] :
( cc(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f63,plain,
! [X0] :
( rr(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f64,plain,
! [X0] :
( cd(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f65,plain,
! [X0,X6,X5] :
( X5 = X6
| ~ rr(X0,X6)
| ~ rr(X0,X5)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f69,plain,
! [X0] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f70,plain,
cUnsatisfiable(i2003_11_14_17_20_18265),
inference(cnf_transformation,[],[f14]) ).
cnf(c_56,plain,
( ~ rr(X0,X1)
| ~ rr(X0,X2)
| ~ cUnsatisfiable(X0)
| X1 = X2 ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_57,plain,
( ~ cUnsatisfiable(X0)
| cd(sK2(X0)) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_58,plain,
( ~ cUnsatisfiable(X0)
| rr(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_59,plain,
( ~ cUnsatisfiable(X0)
| cc(sK3(X0)) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_60,plain,
( ~ cUnsatisfiable(X0)
| rr(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_61,plain,
( ~ cd(X0)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f69]) ).
cnf(c_62,plain,
cUnsatisfiable(i2003_11_14_17_20_18265),
inference(cnf_transformation,[],[f70]) ).
cnf(c_77,plain,
( ~ cUnsatisfiable(X0)
| cd(sK2(X0)) ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
cnf(c_81,plain,
( ~ cUnsatisfiable(X0)
| cc(sK3(X0)) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
cnf(c_85,plain,
( ~ cd(X0)
| ~ cc(X0) ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
cnf(c_337,plain,
( sK2(X0) != X1
| ~ cUnsatisfiable(X0)
| ~ cc(X1) ),
inference(resolution_lifted,[status(thm)],[c_77,c_85]) ).
cnf(c_338,plain,
( ~ cc(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(unflattening,[status(thm)],[c_337]) ).
cnf(c_426,plain,
( sK2(X0) != sK3(X1)
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X1) ),
inference(resolution_lifted,[status(thm)],[c_81,c_338]) ).
cnf(c_427,plain,
( sK2(i2003_11_14_17_20_18265) != sK3(i2003_11_14_17_20_18265)
| ~ cUnsatisfiable(i2003_11_14_17_20_18265) ),
inference(instantiation,[status(thm)],[c_426]) ).
cnf(c_883,plain,
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0)
| sK2(X0) = X1 ),
inference(superposition,[status(thm)],[c_58,c_56]) ).
cnf(c_900,plain,
( ~ cUnsatisfiable(X0)
| sK2(X0) = sK3(X0) ),
inference(superposition,[status(thm)],[c_60,c_883]) ).
cnf(c_903,plain,
( ~ cUnsatisfiable(i2003_11_14_17_20_18265)
| sK2(i2003_11_14_17_20_18265) = sK3(i2003_11_14_17_20_18265) ),
inference(instantiation,[status(thm)],[c_900]) ).
cnf(c_904,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_903,c_427,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS096+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n010.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 22:28:04 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/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
% 1.87/1.19 % SZS status Started for theBenchmark.p
% 1.87/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.87/1.19
% 1.87/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.87/1.19
% 1.87/1.19 ------ iProver source info
% 1.87/1.19
% 1.87/1.19 git: date: 2024-05-02 19:28:25 +0000
% 1.87/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.87/1.19 git: non_committed_changes: false
% 1.87/1.19
% 1.87/1.19 ------ Parsing...
% 1.87/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.87/1.19
% 1.87/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 1.87/1.19
% 1.87/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.87/1.19
% 1.87/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.87/1.19 ------ Proving...
% 1.87/1.19 ------ Problem Properties
% 1.87/1.19
% 1.87/1.19
% 1.87/1.19 clauses 9
% 1.87/1.19 conjectures 0
% 1.87/1.19 EPR 2
% 1.87/1.19 Horn 7
% 1.87/1.19 unary 1
% 1.87/1.19 binary 4
% 1.87/1.19 lits 31
% 1.87/1.19 lits eq 2
% 1.87/1.19 fd_pure 0
% 1.87/1.19 fd_pseudo 0
% 1.87/1.19 fd_cond 0
% 1.87/1.19 fd_pseudo_cond 1
% 1.87/1.19 AC symbols 0
% 1.87/1.19
% 1.87/1.19 ------ Schedule dynamic 5 is on
% 1.87/1.19
% 1.87/1.19 ------ no conjectures: strip conj schedule
% 1.87/1.19
% 1.87/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.87/1.19
% 1.87/1.19
% 1.87/1.19 ------
% 1.87/1.19 Current options:
% 1.87/1.19 ------
% 1.87/1.19
% 1.87/1.19
% 1.87/1.19
% 1.87/1.19
% 1.87/1.19 ------ Proving...
% 1.87/1.19
% 1.87/1.19
% 1.87/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.87/1.19
% 1.87/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.87/1.19
% 1.87/1.19
%------------------------------------------------------------------------------