↑ Up

Vampire-SAT---5.0.1.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SYO908_13 : TPTP v9.3.1. Released v8.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 02:32:56 PM UTC 2026

% Result   : CounterSatisfiable 0.08s 0.25s
% Output   : Saturation 0.08s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u30,negated_conjecture,
    ~ '$ki_accessible'('$ki_local_world','$ki_local_world') ).

cnf(u20,negated_conjecture,
    ( ~ f(X0,sK1)
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | g(X0,sK1) ) ).

cnf(u32,negated_conjecture,
    ( ~ '$ki_accessible'('$ki_local_world',X0)
    | '$ki_exists_in_world_$i'(X0,sK1) ) ).

cnf(u34,negated_conjecture,
    '$ki_exists_in_world_$i'(sK2,sK1) ).

cnf(u35,negated_conjecture,
    ( ~ '$ki_accessible'(sK2,X0)
    | '$ki_exists_in_world_$i'(X0,sK1) ) ).

cnf(u15,negated_conjecture,
    ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X2)
    | ~ f(X3,X2)
    | ~ '$ki_accessible'('$ki_local_world',X3)
    | g(X3,X2) ) ).

cnf(u17,negated_conjecture,
    f('$ki_local_world',sK1) ).

cnf(u14,axiom,
    '$ki_exists_in_world_$i'(X0,sK0(X0)) ).

cnf(u16,negated_conjecture,
    '$ki_exists_in_world_$i'('$ki_local_world',sK1) ).

cnf(u19,negated_conjecture,
    ~ g(sK2,sK1) ).

cnf(u37,axiom,
    ( ~ '$ki_accessible'(X1,X2)
    | '$ki_exists_in_world_$i'(X2,sK0(X0))
    | ~ '$ki_accessible'(X0,X1) ) ).

cnf(u18,negated_conjecture,
    '$ki_accessible'('$ki_local_world',sK2) ).

cnf(u38,negated_conjecture,
    ( '$ki_exists_in_world_$i'(sK2,sK0(X0))
    | ~ '$ki_accessible'(X0,'$ki_local_world') ) ).

cnf(u13,axiom,
    ( ~ '$ki_exists_in_world_$i'(X0,X2)
    | '$ki_exists_in_world_$i'(X1,X2)
    | ~ '$ki_accessible'(X0,X1) ) ).

cnf(u36,negated_conjecture,
    ( ~ f(X1,sK0(X0))
    | ~ '$ki_accessible'(X0,'$ki_local_world')
    | ~ '$ki_accessible'('$ki_local_world',X1)
    | g(X1,sK0(X0)) ) ).

cnf(u39,negated_conjecture,
    ( '$ki_exists_in_world_$i'(X1,sK0(X0))
    | ~ '$ki_accessible'(X0,'$ki_local_world')
    | ~ '$ki_accessible'(sK2,X1) ) ).

cnf(u41,negated_conjecture,
    ( ~ '$ki_accessible'(sK2,X1)
    | ~ '$ki_accessible'(X0,'$ki_local_world')
    | '$ki_exists_in_world_$i'(X2,sK0(X0))
    | ~ '$ki_accessible'(X1,X2) ) ).

cnf(u21,negated_conjecture,
    ( ~ f(X0,sK0('$ki_local_world'))
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | g(X0,sK0('$ki_local_world')) ) ).

cnf(u33,axiom,
    ( '$ki_exists_in_world_$i'(X0,sK0(X1))
    | ~ '$ki_accessible'(X1,X0) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO908_13 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n009.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 18:40:45 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  Running first-order model finding
% 0.08/0.22  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.25  % (3330330)Will run a generic schedule for satisfiability detection.
% 0.08/0.25  % (3330338)dis+10_1_sil=32000:sp=arity:random_seed=1852559770:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.25  % (3330338) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3330330-3330338"...
% 0.08/0.25  % (3330338)...printing done.
% 0.08/0.25  % SZS status CounterSatisfiable for theBenchmark
% 0.08/0.25  % SZS output start Saturation.
% See solution above
% 0.08/0.25  % SZS output start Definitions and Model Updates.
% 0.08/0.25  % SZS output end Definitions and Model Updates.
% 0.08/0.25  % (3330338)------------------------------
% 0.08/0.25  % (3330338)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25  % (3330338)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25  % (3330338)CaDiCaL version: 2.1.3
% 0.08/0.25  % (3330338)Termination reason: Satisfiable
% 0.08/0.25  % (3330338)Time elapsed: 0.001 s
% 0.08/0.25  % (3330338)Peak memory usage: 11 MB
% 0.08/0.25  % (3330338)Instructions burned: 1 (million)
% 0.08/0.25  % (3330330)Success in time 0.024 s
% 0.08/0.25  % Vampire exiting
%------------------------------------------------------------------------------