TSTP Solution File: KRS092+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS092+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:35 EDT 2024
% Result : Unsatisfiable 0.45s 1.14s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 6 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 76 ( 30 ~; 21 |; 15 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 40 ( 3 sgn 21 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1] :
( rr(X0,X1)
=> ( cc(X1)
& cd(X1) ) )
& ? [X1] :
( cowlThing(X1)
& rr(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f4,axiom,
! [X0] :
( cc(X0)
=> ~ cd(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f9,axiom,
cUnsatisfiable(i2003_11_14_17_20_04172),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f10,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1] :
( rr(X0,X1)
=> ( cc(X1)
& cd(X1) ) )
& ? [X2] :
( cowlThing(X2)
& rr(X0,X2) ) ) ),
inference(rectify,[],[f3]) ).
fof(f11,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ( ! [X1] :
( rr(X0,X1)
=> ( cc(X1)
& cd(X1) ) )
& ? [X2] :
( cowlThing(X2)
& rr(X0,X2) ) ) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f12,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ( ! [X1] :
( rr(X0,X1)
=> ( cc(X1)
& cd(X1) ) )
& ? [X2] : rr(X0,X2) ) ),
inference(pure_predicate_removal,[],[f11]) ).
fof(f19,plain,
! [X0] :
( ( ! [X1] :
( ( cc(X1)
& cd(X1) )
| ~ rr(X0,X1) )
& ? [X2] : rr(X0,X2) )
| ~ cUnsatisfiable(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f20,plain,
! [X0] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0] :
( ? [X2] : rr(X0,X2)
=> rr(X0,sK0(X0)) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0] :
( ( ! [X1] :
( ( cc(X1)
& cd(X1) )
| ~ rr(X0,X1) )
& rr(X0,sK0(X0)) )
| ~ cUnsatisfiable(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f21]) ).
fof(f23,plain,
! [X0] :
( rr(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( cd(X1)
| ~ rr(X0,X1)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f25,plain,
! [X0,X1] :
( cc(X1)
| ~ rr(X0,X1)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f26,plain,
! [X0] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f27,plain,
cUnsatisfiable(i2003_11_14_17_20_04172),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,plain,
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0)
| cc(X1) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_50,plain,
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0)
| cd(X1) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_51,plain,
( ~ cUnsatisfiable(X0)
| rr(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_52,plain,
( ~ cc(X0)
| ~ cd(X0) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_53,plain,
cUnsatisfiable(i2003_11_14_17_20_04172),
inference(cnf_transformation,[],[f27]) ).
cnf(c_80,plain,
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0)
| ~ cd(X1) ),
inference(resolution,[status(thm)],[c_52,c_49]) ).
cnf(c_82,plain,
( ~ cUnsatisfiable(X0)
| ~ rr(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_80,c_50,c_80]) ).
cnf(c_83,plain,
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0) ),
inference(renaming,[status(thm)],[c_82]) ).
cnf(c_92,plain,
~ cUnsatisfiable(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_83]) ).
cnf(c_94,plain,
~ cUnsatisfiable(i2003_11_14_17_20_04172),
inference(instantiation,[status(thm)],[c_92]) ).
cnf(c_95,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_94,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS092+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 22:33:19 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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
% 0.45/1.14 % SZS status Started for theBenchmark.p
% 0.45/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.14
% 0.45/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.45/1.14
% 0.45/1.14 ------ iProver source info
% 0.45/1.14
% 0.45/1.14 git: date: 2024-05-02 19:28:25 +0000
% 0.45/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.45/1.14 git: non_committed_changes: false
% 0.45/1.14
% 0.45/1.14 ------ Parsing...
% 0.45/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.45/1.14
% 0.45/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s
% 0.45/1.14
% 0.45/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.14
% 0.45/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.14
% 0.45/1.14
%------------------------------------------------------------------------------