TSTP Solution File: SWW469_1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SWW469_1 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n015.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 Jun 24 18:32:37 EDT 2024
% Result : Theorem 0.25s 0.44s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 26 ( 18 ~; 4 |; 0 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 21 ( 11 !; 10 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
state: $tType ).
tff(func_def_0,type,
sK0: state ).
tff(func_def_1,type,
sK1: state ).
tff(func_def_2,type,
sK2: state ).
tff(f25,plain,
$false,
inference(subsumption_resolution,[],[f24,f20]) ).
tff(f20,plain,
hoare_1310879719gleton,
inference(cnf_transformation,[],[f5]) ).
tff(f5,axiom,
hoare_1310879719gleton,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f24,plain,
~ hoare_1310879719gleton,
inference(subsumption_resolution,[],[f23,f19]) ).
tff(f19,plain,
! [X1: state] : ( sK0 = X1 ),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
! [X1: state] : ( sK0 = X1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f13,f15]) ).
tff(f15,plain,
( ? [X0: state] :
! [X1: state] : ( X0 = X1 )
=> ! [X1: state] : ( sK0 = X1 ) ),
introduced(choice_axiom,[]) ).
tff(f13,plain,
? [X0: state] :
! [X1: state] : ( X0 = X1 ),
inference(ennf_transformation,[],[f8]) ).
tff(f8,plain,
~ ! [X0: state] :
~ ! [X1: state] : ( X0 = X1 ),
inference(rectify,[],[f7]) ).
tff(f7,negated_conjecture,
~ ! [X1: state] :
~ ! [X0: state] : ( X0 = X1 ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
! [X1: state] :
~ ! [X0: state] : ( X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f23,plain,
( ( sK0 != sK1 )
| ~ hoare_1310879719gleton ),
inference(superposition,[],[f21,f19]) ).
tff(f21,plain,
( ( sK1 != sK2 )
| ~ hoare_1310879719gleton ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
( ( sK1 != sK2 )
| ~ hoare_1310879719gleton ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f14,f17]) ).
tff(f17,plain,
( ? [X0: state,X1: state] : ( X0 != X1 )
=> ( sK1 != sK2 ) ),
introduced(choice_axiom,[]) ).
tff(f14,plain,
( ? [X0: state,X1: state] : ( X0 != X1 )
| ~ hoare_1310879719gleton ),
inference(ennf_transformation,[],[f9]) ).
tff(f9,plain,
( hoare_1310879719gleton
=> ? [X0: state,X1: state] : ( X0 != X1 ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
tff(f1,axiom,
( hoare_1310879719gleton
<=> ? [X0: state,X1: state] : ( X0 != X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWW469_1 : TPTP v8.2.0. Released v5.3.0.
% 0.11/0.13 % Command : run_vampire %s %d THM
% 0.12/0.37 % Computer : n015.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8042.1875MB
% 0.12/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Wed Jun 19 08:09:39 EDT 2024
% 0.12/0.37 % CPUTime :
% 0.12/0.38 This is a TF0_THM_EQU_NAR problem
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.25/0.43 % (11042)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.43 % (11049)lrs+1010_1:1_to=lpo:sil=2000:sos=on:fd=off:i=117:bd=off_0 on theBenchmark for (2999ds/117Mi)
% 0.25/0.44 % (11049)First to succeed.
% 0.25/0.44 % (11049)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11042"
% 0.25/0.44 % (11042)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.44 % (11049)Refutation found. Thanks to Tanya!
% 0.25/0.44 % SZS status Theorem for theBenchmark
% 0.25/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.44 % (11049)------------------------------
% 0.25/0.44 % (11049)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.25/0.44 % (11049)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.25/0.44 % (11049)Termination reason: Refutation
% 0.25/0.44
% 0.25/0.44 % (11049)Memory used [KB]: 1059
% 0.25/0.44 % (11049)Time elapsed: 0.002 s
% 0.25/0.44 % (11049)Instructions burned: 2 (million)
% 0.25/0.44 % (11049)------------------------------
% 0.25/0.44 % (11049)------------------------------
% 0.25/0.44 % (11042)Success in time 0.033 s
%------------------------------------------------------------------------------