TSTP Solution File: DAT334_23 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : DAT334_23 : TPTP v8.2.0. Released v8.2.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:14:41 EDT 2024
% Result : Theorem 0.85s 1.20s
% Output : CNFRefutation 0.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 131 ( 0 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 61 ( 19 ~; 10 |; 25 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 64 ( 64 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 14 ( 13 usr; 10 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 41 ( 5 sgn 24 !; 9 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
tff(f2,axiom,
! [X0: '$ki_world',X2] : '$ki_exists_in_world_$i'(X0,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
tff(f4,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( teach(X0,sue,psych)
& teach(X0,mary,psych)
& ? [X2] :
( teach(X0,X2,cs)
& '$ki_exists_in_world_$i'(X0,X2) )
& teach(X0,john,math) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',db) ).
tff(f5,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X2] :
( teach(X0,X2,cs)
& '$ki_exists_in_world_$i'(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f6,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X2] :
( teach(X0,X2,cs)
& '$ki_exists_in_world_$i'(X0,X2) ) ),
inference(negated_conjecture,[],[f5]) ).
tff(f7,plain,
! [X0: '$ki_world',X1] : '$ki_exists_in_world_$i'(X0,X1),
inference(rectify,[],[f2]) ).
tff(f9,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( teach(X0,sue,psych)
& teach(X0,mary,psych)
& ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
& teach(X0,john,math) ) ),
inference(rectify,[],[f4]) ).
tff(f10,plain,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) ) ),
inference(rectify,[],[f6]) ).
tff(f11,plain,
! [X0: '$ki_world'] :
( ( teach(X0,sue,psych)
& teach(X0,mary,psych)
& ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
& teach(X0,john,math) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f9]) ).
tff(f12,plain,
? [X0: '$ki_world'] :
( ! [X1] :
( ~ teach(X0,X1,cs)
| ~ '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f10]) ).
tff(f15,plain,
! [X0: '$ki_world'] :
( ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
=> ( teach(X0,sK1(X0),cs)
& '$ki_exists_in_world_$i'(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f16,plain,
! [X0: '$ki_world'] :
( ( teach(X0,sue,psych)
& teach(X0,mary,psych)
& teach(X0,sK1(X0),cs)
& '$ki_exists_in_world_$i'(X0,sK1(X0))
& teach(X0,john,math) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f11,f15]) ).
tff(f17,plain,
( ? [X0: '$ki_world'] :
( ! [X1] :
( ~ teach(X0,X1,cs)
| ~ '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X1] :
( ~ teach(sK2,X1,cs)
| ~ '$ki_exists_in_world_$i'(sK2,X1) )
& '$ki_accessible'('$ki_local_world',sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f18,plain,
( ! [X1] :
( ~ teach(sK2,X1,cs)
| ~ '$ki_exists_in_world_$i'(sK2,X1) )
& '$ki_accessible'('$ki_local_world',sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f12,f17]) ).
tff(f19,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
inference(cnf_transformation,[],[f1]) ).
tff(f20,plain,
! [X0: '$ki_world',X1: $i] : '$ki_exists_in_world_$i'(X0,X1),
inference(cnf_transformation,[],[f7]) ).
tff(f24,plain,
! [X0: '$ki_world'] :
( teach(X0,sK1(X0),cs)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f16]) ).
tff(f28,plain,
! [X1: $i] :
( ~ teach(sK2,X1,cs)
| ~ '$ki_exists_in_world_$i'(sK2,X1) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_49,plain,
'$ki_accessible'(X0_13,X1_13),
inference(cnf_transformation,[],[f19]) ).
cnf(c_50,plain,
'$ki_exists_in_world_$i'(X0_13,X0),
inference(cnf_transformation,[],[f20]) ).
cnf(c_54,plain,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| teach(X0_13,sK1(X0_13),cs) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_57,negated_conjecture,
( ~ teach(sK2,X0,cs)
| ~ '$ki_exists_in_world_$i'(sK2,X0) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_74,plain,
teach(X0_13,sK1(X0_13),cs),
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_49]) ).
cnf(c_82,plain,
~ teach(sK2,X0,cs),
inference(backward_subsumption_resolution,[status(thm)],[c_57,c_50]) ).
cnf(c_94,plain,
$false,
inference(resolution,[status(thm)],[c_74,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT334_23 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n031.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 19:20:16 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 0.85/1.20 % SZS status Started for theBenchmark.p
% 0.85/1.20 % SZS status Theorem for theBenchmark.p
% 0.85/1.20
% 0.85/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.85/1.20
% 0.85/1.20 ------ iProver source info
% 0.85/1.20
% 0.85/1.20 git: date: 2024-05-02 19:28:25 +0000
% 0.85/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.85/1.20 git: non_committed_changes: false
% 0.85/1.20
% 0.85/1.20 ------ Parsing...
% 0.85/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 0.85/1.20
% 0.85/1.20
% 0.85/1.20 ------ Preprocessing... pe_s pe:1:0s
% 0.85/1.20
% 0.85/1.20 % SZS status Theorem for theBenchmark.p
% 0.85/1.20
% 0.85/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.85/1.20
% 0.85/1.20
%------------------------------------------------------------------------------