TSTP Solution File: LCL954_19 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : LCL954_19 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n004.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 : Mon May 22 15:38:39 EDT 2023
% Result : Theorem 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 21
% Syntax : Number of formulae : 38 ( 6 unt; 16 typ; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 77 ( 26 ~; 14 |; 21 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 30 ( 12 >; 18 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 40 (; 30 !; 10 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_29,type,
sK0: ( $i * $i * '$ki_world' ) > '$ki_world' ).
tff(func_def_30,type,
sK1: '$ki_world' > $i ).
tff(func_def_31,type,
sK2: ( $i * $i * '$ki_world' ) > '$ki_world' ).
tff(func_def_32,type,
sK3: ( $i * $i * '$ki_world' ) > '$ki_world' ).
tff(func_def_33,type,
sK4: '$ki_world' ).
tff(func_def_34,type,
sK5: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
customqmltpeq: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_3,type,
true: '$ki_world' > $o ).
tff(pred_def_4,type,
geq: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_5,type,
lt: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_6,type,
leq: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_7,type,
gt: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_8,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(f191,plain,
$false,
inference(subsumption_resolution,[],[f189,f181]) ).
tff(f181,plain,
~ '$ki_accessible'('$ki_local_world',sK5),
inference(unit_resulting_resolution,[],[f179,f167]) ).
tff(f167,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| true(X0) ),
inference(cnf_transformation,[],[f144]) ).
tff(f144,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| true(X0) ),
inference(ennf_transformation,[],[f103]) ).
tff(f103,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> true(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ttrue) ).
tff(f179,plain,
~ true(sK5),
inference(cnf_transformation,[],[f165]) ).
tff(f165,plain,
( '$ki_accessible'(sK4,sK5)
& ~ true(sK5)
& '$ki_accessible'('$ki_local_world',sK4)
& ! [X2: '$ki_world'] :
( ~ '$ki_accessible'(sK4,X2)
| true(X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f162,f164,f163]) ).
tff(f163,plain,
( ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
& ~ true(X1) )
& '$ki_accessible'('$ki_local_world',X0)
& ! [X2: '$ki_world'] :
( ~ '$ki_accessible'(X0,X2)
| true(X2) ) )
=> ( ? [X1: '$ki_world'] :
( '$ki_accessible'(sK4,X1)
& ~ true(X1) )
& '$ki_accessible'('$ki_local_world',sK4)
& ! [X2: '$ki_world'] :
( ~ '$ki_accessible'(sK4,X2)
| true(X2) ) ) ),
introduced(choice_axiom,[]) ).
tff(f164,plain,
( ? [X1: '$ki_world'] :
( '$ki_accessible'(sK4,X1)
& ~ true(X1) )
=> ( '$ki_accessible'(sK4,sK5)
& ~ true(sK5) ) ),
introduced(choice_axiom,[]) ).
tff(f162,plain,
? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
& ~ true(X1) )
& '$ki_accessible'('$ki_local_world',X0)
& ! [X2: '$ki_world'] :
( ~ '$ki_accessible'(X0,X2)
| true(X2) ) ),
inference(rectify,[],[f146]) ).
tff(f146,plain,
? [X0: '$ki_world'] :
( ? [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
& ~ true(X2) )
& '$ki_accessible'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( ~ '$ki_accessible'(X0,X1)
| true(X1) ) ),
inference(flattening,[],[f145]) ).
tff(f145,plain,
? [X0: '$ki_world'] :
( ? [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
& ~ true(X2) )
& ! [X1: '$ki_world'] :
( ~ '$ki_accessible'(X0,X1)
| true(X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f139]) ).
tff(f139,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(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(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(f189,plain,
'$ki_accessible'('$ki_local_world',sK5),
inference(unit_resulting_resolution,[],[f178,f180,f166]) ).
tff(f166,plain,
! [X2: '$ki_world',X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X1,X2)
| '$ki_accessible'(X0,X2)
| ~ '$ki_accessible'(X0,X1) ),
inference(cnf_transformation,[],[f150]) ).
tff(f150,plain,
! [X0: '$ki_world',X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(X1,X2)
| '$ki_accessible'(X0,X2) ),
inference(flattening,[],[f149]) ).
tff(f149,plain,
! [X2: '$ki_world',X0: '$ki_world',X1: '$ki_world'] :
( '$ki_accessible'(X0,X2)
| ~ '$ki_accessible'(X1,X2)
| ~ '$ki_accessible'(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
tff(f2,axiom,
! [X2: '$ki_world',X0: '$ki_world',X1: '$ki_world'] :
( ( '$ki_accessible'(X1,X2)
& '$ki_accessible'(X0,X1) )
=> '$ki_accessible'(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_transitive) ).
tff(f180,plain,
'$ki_accessible'(sK4,sK5),
inference(cnf_transformation,[],[f165]) ).
tff(f178,plain,
'$ki_accessible'('$ki_local_world',sK4),
inference(cnf_transformation,[],[f165]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL954_19 : TPTP v8.2.0. Released v8.2.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n004.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 22 11:56:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.52 % (26072)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.52 % (26080)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.52 % (26080)First to succeed.
% 0.19/0.53 % (26078)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.53 % (26080)Refutation found. Thanks to Tanya!
% 0.19/0.53 % SZS status Theorem for theBenchmark
% 0.19/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (26080)------------------------------
% 0.19/0.53 % (26080)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (26080)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (26080)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (26080)Memory used [KB]: 6396
% 0.19/0.53 % (26080)Time elapsed: 0.098 s
% 0.19/0.53 % (26080)Instructions burned: 5 (million)
% 0.19/0.53 % (26080)------------------------------
% 0.19/0.53 % (26080)------------------------------
% 0.19/0.53 % (26064)Success in time 0.173 s
%------------------------------------------------------------------------------