TSTP Solution File: LCL954_19 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL954_19 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:40:22 EDT 2024
% Result : Theorem 3.64s 1.15s
% Output : CNFRefutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 65 ( 22 ~; 9 |; 20 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 25 ( 25 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 28 ( 0 sgn 16 !; 10 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
tff(f137,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> true(X4) )
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> true(X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f138,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> true(X4) )
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> true(X4) ) ) ),
inference(negated_conjecture,[],[f137]) ).
tff(f245,plain,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> true(X1) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> true(X2) ) ) ),
inference(rectify,[],[f138]) ).
tff(f464,plain,
? [X0: '$ki_world'] :
( ? [X2: '$ki_world'] :
( ~ true(X2)
& '$ki_accessible'(X0,X2) )
& ! [X1: '$ki_world'] :
( true(X1)
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f245]) ).
tff(f465,plain,
? [X0: '$ki_world'] :
( ? [X2: '$ki_world'] :
( ~ true(X2)
& '$ki_accessible'(X0,X2) )
& ! [X1: '$ki_world'] :
( true(X1)
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f464]) ).
tff(f1019,plain,
? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ~ true(X1)
& '$ki_accessible'(X0,X1) )
& ! [X2: '$ki_world'] :
( true(X2)
| ~ '$ki_accessible'(X0,X2) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(rectify,[],[f465]) ).
tff(f1020,plain,
( ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ~ true(X1)
& '$ki_accessible'(X0,X1) )
& ! [X2: '$ki_world'] :
( true(X2)
| ~ '$ki_accessible'(X0,X2) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ? [X1: '$ki_world'] :
( ~ true(X1)
& '$ki_accessible'(sK266,X1) )
& ! [X2: '$ki_world'] :
( true(X2)
| ~ '$ki_accessible'(sK266,X2) )
& '$ki_accessible'('$ki_local_world',sK266) ) ),
introduced(choice_axiom,[]) ).
tff(f1021,plain,
( ? [X1: '$ki_world'] :
( ~ true(X1)
& '$ki_accessible'(sK266,X1) )
=> ( ~ true(sK267)
& '$ki_accessible'(sK266,sK267) ) ),
introduced(choice_axiom,[]) ).
tff(f1022,plain,
( ~ true(sK267)
& '$ki_accessible'(sK266,sK267)
& ! [X2: '$ki_world'] :
( true(X2)
| ~ '$ki_accessible'(sK266,X2) )
& '$ki_accessible'('$ki_local_world',sK266) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK266,sK267])],[f1019,f1021,f1020]) ).
tff(f1549,plain,
! [X2: '$ki_world'] :
( true(X2)
| ~ '$ki_accessible'(sK266,X2) ),
inference(cnf_transformation,[],[f1022]) ).
tff(f1550,plain,
'$ki_accessible'(sK266,sK267),
inference(cnf_transformation,[],[f1022]) ).
tff(f1551,plain,
~ true(sK267),
inference(cnf_transformation,[],[f1022]) ).
cnf(c_574,negated_conjecture,
~ true(sK267),
inference(cnf_transformation,[],[f1551]) ).
cnf(c_575,negated_conjecture,
'$ki_accessible'(sK266,sK267),
inference(cnf_transformation,[],[f1550]) ).
cnf(c_576,negated_conjecture,
( ~ '$ki_accessible'(sK266,X0_13)
| true(X0_13) ),
inference(cnf_transformation,[],[f1549]) ).
cnf(c_1337,plain,
( ~ '$ki_accessible'(sK266,X0_13)
| true(X0_13) ),
inference(prop_impl_just,[status(thm)],[c_576]) ).
cnf(c_1549,plain,
~ '$ki_accessible'(sK266,sK267),
inference(resolution,[status(thm)],[c_1337,c_574]) ).
cnf(c_1550,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1549,c_575]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : LCL954_19 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.15 % Command : run_iprover %s %d THM
% 0.13/0.36 % Computer : n029.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu May 2 19:38:22 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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
% 3.64/1.15 % SZS status Started for theBenchmark.p
% 3.64/1.15 % SZS status Theorem for theBenchmark.p
% 3.64/1.15
% 3.64/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.64/1.15
% 3.64/1.15 ------ iProver source info
% 3.64/1.15
% 3.64/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.64/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.64/1.15 git: non_committed_changes: false
% 3.64/1.15
% 3.64/1.15 ------ Parsing...
% 3.64/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.64/1.15
% 3.64/1.15 ------ Preprocessing... pe_s
% 3.64/1.15
% 3.64/1.15 % SZS status Theorem for theBenchmark.p
% 3.64/1.15
% 3.64/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.64/1.15
% 3.64/1.15
%------------------------------------------------------------------------------