TSTP Solution File: KRS095+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS095+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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.76s 1.18s
% Output : CNFRefutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 147 ( 44 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 182 ( 71 ~; 57 |; 46 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 83 ( 0 sgn 40 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ! [X4,X5] :
( ( rr(X3,X5)
& rr(X3,X4) )
=> X4 = X5 )
& ? [X4,X5] :
( X4 != X5
& rr(X3,X5)
& rr(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f14,axiom,
cUnsatisfiable(i2003_11_14_17_20_14253),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f17,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( ( rr(X0,X2)
& rr(X0,X1) )
=> X1 = X2 )
& ? [X3,X4] :
( X3 != X4
& rr(X0,X4)
& rr(X0,X3) ) ) ),
inference(rectify,[],[f12]) ).
fof(f37,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3,X4] :
( X3 != X4
& rr(X0,X4)
& rr(X0,X3) ) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f38,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3,X4] :
( X3 != X4
& rr(X0,X4)
& rr(X0,X3) ) ) ),
inference(flattening,[],[f37]) ).
fof(f41,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3,X4] :
( X3 = X4
| ~ rr(X0,X4)
| ~ rr(X0,X3) ) )
& ( ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3,X4] :
( X3 != X4
& rr(X0,X4)
& rr(X0,X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f38]) ).
fof(f42,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3,X4] :
( X3 = X4
| ~ rr(X0,X4)
| ~ rr(X0,X3) ) )
& ( ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3,X4] :
( X3 != X4
& rr(X0,X4)
& rr(X0,X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f41]) ).
fof(f43,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3,X4] :
( X3 = X4
| ~ rr(X0,X4)
| ~ rr(X0,X3) ) )
& ( ( ! [X5,X6] :
( X5 = X6
| ~ rr(X0,X6)
| ~ rr(X0,X5) )
& ? [X7,X8] :
( X7 != X8
& rr(X0,X8)
& rr(X0,X7) ) )
| ~ 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,X8] :
( X7 != X8
& rr(X0,X8)
& rr(X0,X7) )
=> ( sK2(X0) != sK3(X0)
& rr(X0,sK3(X0))
& rr(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ( sK0(X0) != sK1(X0)
& rr(X0,sK1(X0))
& rr(X0,sK0(X0)) )
| ! [X3,X4] :
( X3 = X4
| ~ rr(X0,X4)
| ~ rr(X0,X3) ) )
& ( ( ! [X5,X6] :
( X5 = X6
| ~ rr(X0,X6)
| ~ rr(X0,X5) )
& sK2(X0) != sK3(X0)
& rr(X0,sK3(X0))
& rr(X0,sK2(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f43,f45,f44]) ).
fof(f60,plain,
! [X0] :
( rr(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f61,plain,
! [X0] :
( rr(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f62,plain,
! [X0] :
( sK2(X0) != sK3(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f63,plain,
! [X0,X6,X5] :
( X5 = X6
| ~ rr(X0,X6)
| ~ rr(X0,X5)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f68,plain,
cUnsatisfiable(i2003_11_14_17_20_14253),
inference(cnf_transformation,[],[f14]) ).
cnf(c_56,plain,
( ~ rr(X0,X1)
| ~ rr(X0,X2)
| ~ cUnsatisfiable(X0)
| X1 = X2 ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_57,plain,
( sK2(X0) != sK3(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_58,plain,
( ~ cUnsatisfiable(X0)
| rr(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_59,plain,
( ~ cUnsatisfiable(X0)
| rr(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_61,plain,
cUnsatisfiable(i2003_11_14_17_20_14253),
inference(cnf_transformation,[],[f68]) ).
cnf(c_84,plain,
( ~ cUnsatisfiable(X0)
| sK2(X0) != sK3(X0) ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
cnf(c_85,plain,
( sK2(X0) != sK3(X0)
| ~ cUnsatisfiable(X0) ),
inference(renaming,[status(thm)],[c_84]) ).
cnf(c_86,plain,
( ~ cUnsatisfiable(X0)
| rr(X0,sK3(X0)) ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
cnf(c_88,plain,
( ~ cUnsatisfiable(X0)
| rr(X0,sK2(X0)) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
cnf(c_242,plain,
( X0 != i2003_11_14_17_20_14253
| rr(X0,sK2(X0)) ),
inference(resolution_lifted,[status(thm)],[c_88,c_61]) ).
cnf(c_243,plain,
rr(i2003_11_14_17_20_14253,sK2(i2003_11_14_17_20_14253)),
inference(unflattening,[status(thm)],[c_242]) ).
cnf(c_247,plain,
( X0 != i2003_11_14_17_20_14253
| rr(X0,sK3(X0)) ),
inference(resolution_lifted,[status(thm)],[c_86,c_61]) ).
cnf(c_248,plain,
rr(i2003_11_14_17_20_14253,sK3(i2003_11_14_17_20_14253)),
inference(unflattening,[status(thm)],[c_247]) ).
cnf(c_252,plain,
( sK2(X0) != sK3(X0)
| X0 != i2003_11_14_17_20_14253 ),
inference(resolution_lifted,[status(thm)],[c_85,c_61]) ).
cnf(c_253,plain,
sK2(i2003_11_14_17_20_14253) != sK3(i2003_11_14_17_20_14253),
inference(unflattening,[status(thm)],[c_252]) ).
cnf(c_257,plain,
( X0 != i2003_11_14_17_20_14253
| ~ rr(X0,X1)
| ~ rr(X0,X2)
| X1 = X2 ),
inference(resolution_lifted,[status(thm)],[c_56,c_61]) ).
cnf(c_258,plain,
( ~ rr(i2003_11_14_17_20_14253,X0)
| ~ rr(i2003_11_14_17_20_14253,X1)
| X0 = X1 ),
inference(unflattening,[status(thm)],[c_257]) ).
cnf(c_479,plain,
( ~ rr(i2003_11_14_17_20_14253,X0)
| sK2(i2003_11_14_17_20_14253) = X0 ),
inference(superposition,[status(thm)],[c_243,c_258]) ).
cnf(c_492,plain,
sK2(i2003_11_14_17_20_14253) = sK3(i2003_11_14_17_20_14253),
inference(superposition,[status(thm)],[c_248,c_479]) ).
cnf(c_493,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_492,c_253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS095+1 : TPTP v8.1.2. Released v3.1.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n026.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:57:21 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/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
% 1.76/1.18 % SZS status Started for theBenchmark.p
% 1.76/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.76/1.18
% 1.76/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.76/1.18
% 1.76/1.18 ------ iProver source info
% 1.76/1.18
% 1.76/1.18 git: date: 2024-05-02 19:28:25 +0000
% 1.76/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.76/1.18 git: non_committed_changes: false
% 1.76/1.18
% 1.76/1.18 ------ Parsing...
% 1.76/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.76/1.18
% 1.76/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 6 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.76/1.18
% 1.76/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.76/1.18
% 1.76/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.76/1.18 ------ Proving...
% 1.76/1.18 ------ Problem Properties
% 1.76/1.18
% 1.76/1.18
% 1.76/1.18 clauses 7
% 1.76/1.18 conjectures 0
% 1.76/1.18 EPR 1
% 1.76/1.18 Horn 5
% 1.76/1.18 unary 3
% 1.76/1.18 binary 0
% 1.76/1.18 lits 18
% 1.76/1.18 lits eq 6
% 1.76/1.18 fd_pure 0
% 1.76/1.18 fd_pseudo 0
% 1.76/1.18 fd_cond 0
% 1.76/1.18 fd_pseudo_cond 4
% 1.76/1.18 AC symbols 0
% 1.76/1.18
% 1.76/1.18 ------ Schedule dynamic 5 is on
% 1.76/1.18
% 1.76/1.18 ------ no conjectures: strip conj schedule
% 1.76/1.18
% 1.76/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.76/1.18
% 1.76/1.18
% 1.76/1.18 ------
% 1.76/1.18 Current options:
% 1.76/1.18 ------
% 1.76/1.18
% 1.76/1.18
% 1.76/1.18
% 1.76/1.18
% 1.76/1.18 ------ Proving...
% 1.76/1.18
% 1.76/1.18
% 1.76/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.76/1.18
% 1.76/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.76/1.18
% 1.76/1.18
%------------------------------------------------------------------------------