TSTP Solution File: SYO902_8 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO902_8 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n013.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 : Tue May 21 09:16:11 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 25 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 75 ( 24 ~; 16 |; 27 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 41 ( 21 !; 20 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_1,type,
sK0: '$ki_world' ).
tff(func_def_2,type,
sK1: '$ki_world' > '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
p: '$ki_world' > $o ).
tff(f25,plain,
$false,
inference(subsumption_resolution,[],[f24,f10]) ).
tff(f10,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
( ! [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X3: '$ki_world'] :
( ( p(sK1(X3))
& '$ki_accessible'(X3,sK1(X3)) )
| ~ '$ki_accessible'(sK0,X3) )
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
tff(f7,plain,
( ? [X2: '$ki_world'] :
( ! [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( p(X4)
& '$ki_accessible'(X3,X4) )
| ~ '$ki_accessible'(X2,X3) )
& '$ki_accessible'('$ki_local_world',X2) )
=> ( ! [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( p(X4)
& '$ki_accessible'(X3,X4) )
| ~ '$ki_accessible'(sK0,X3) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f8,plain,
! [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( p(X4)
& '$ki_accessible'(X3,X4) )
=> ( p(sK1(X3))
& '$ki_accessible'(X3,sK1(X3)) ) ),
introduced(choice_axiom,[]) ).
tff(f6,plain,
( ! [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ? [X2: '$ki_world'] :
( ! [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( p(X4)
& '$ki_accessible'(X3,X4) )
| ~ '$ki_accessible'(X2,X3) )
& '$ki_accessible'('$ki_local_world',X2) ) ),
inference(rectify,[],[f5]) ).
tff(f5,plain,
( ! [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( ~ p(X4)
| ~ '$ki_accessible'(X3,X4) )
| ~ '$ki_accessible'('$ki_local_world',X3) )
& ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'(X1,X2) )
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,plain,
~ ( ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ? [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( p(X4)
& '$ki_accessible'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) ) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ( ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
( ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f24,plain,
~ '$ki_accessible'('$ki_local_world',sK0),
inference(subsumption_resolution,[],[f21,f15]) ).
tff(f15,plain,
p(sK1(sK0)),
inference(resolution,[],[f14,f12]) ).
tff(f12,plain,
! [X3: '$ki_world'] :
( ~ '$ki_accessible'(sK0,X3)
| p(sK1(X3)) ),
inference(cnf_transformation,[],[f9]) ).
tff(f14,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f21,plain,
( ~ p(sK1(sK0))
| ~ '$ki_accessible'('$ki_local_world',sK0) ),
inference(resolution,[],[f13,f16]) ).
tff(f16,plain,
'$ki_accessible'(sK0,sK1(sK0)),
inference(resolution,[],[f11,f14]) ).
tff(f11,plain,
! [X3: '$ki_world'] :
( ~ '$ki_accessible'(sK0,X3)
| '$ki_accessible'(X3,sK1(X3)) ),
inference(cnf_transformation,[],[f9]) ).
tff(f13,plain,
! [X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X0,X1)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO902_8 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.37 % Computer : n013.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 11:01:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 % (14034)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.39 % (14038)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.39 % (14041)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 % (14035)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.39 % (14036)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.39 % (14037)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.15/0.39 % (14039)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [4]
% 0.15/0.39 TRYING [4]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 % (14041)Also succeeded, but the first one will report.
% 0.15/0.39 % (14039)First to succeed.
% 0.15/0.39 % (14038)Also succeeded, but the first one will report.
% 0.15/0.39 TRYING [2]
% 0.15/0.39 % (14037)Also succeeded, but the first one will report.
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [4]
% 0.15/0.39 % (14039)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-14034"
% 0.15/0.39 TRYING [4]
% 0.15/0.39 % (14035)Also succeeded, but the first one will report.
% 0.15/0.39 % (14039)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (14039)------------------------------
% 0.15/0.39 % (14039)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (14039)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (14039)Memory used [KB]: 746
% 0.15/0.39 % (14039)Time elapsed: 0.003 s
% 0.15/0.39 % (14039)Instructions burned: 3 (million)
% 0.15/0.39 % (14034)Success in time 0.014 s
%------------------------------------------------------------------------------