↑ Up

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

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

% Computer : n007.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:18:12 PM UTC 2026

% Result   : Satisfiable 0.09s 0.26s
% Output   : Saturation 0.09s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause22,negated_conjecture,
    ( ~ ssPv1(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ssPv2(X4)
    | ssPv3(X5)
    | ssPv3(X2) ) ).

cnf(clause29,negated_conjecture,
    ( ~ ssPv3(X4)
    | ~ ssPv4(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X5,X6)
    | ~ ssRr(X2,X5)
    | ssPv4(X6)
    | ssPv3(X2) ) ).

cnf(clause5,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ssPv2(X3)
    | ssPv1(X2)
    | ssPv2(X2) ) ).

cnf(clause24,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssPv1(X2)
    | ssPv3(X4)
    | ssPv2(X5) ) ).

cnf(clause15,negated_conjecture,
    ( ~ ssPv2(X2)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X0,X1)
    | ssPv4(X1)
    | ssPv1(X4)
    | ssPv4(X2) ) ).

cnf(clause10,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssPv1(X3)
    | ~ ssPv1(X2)
    | ssPv3(X2) ) ).

cnf(clause4,negated_conjecture,
    ( ~ ssPv3(X2)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X0,X1)
    | ssPv4(X1)
    | ssPv3(X3)
    | ssPv1(X2) ) ).

cnf(clause17,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssPv1(X4)
    | ~ ssRr(X2,X3)
    | ssPv2(X2)
    | ssPv4(X2) ) ).

cnf(clause28,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X5,X6)
    | ~ ssRr(X2,X5)
    | ssPv4(X4)
    | ssPv2(X6)
    | ssPv3(X2) ) ).

cnf(clause27,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X5,X6)
    | ~ ssRr(X2,X5)
    | ssPv4(X4)
    | ssPv1(X6)
    | ssPv4(X2) ) ).

cnf(clause3,negated_conjecture,
    ( ~ ssPv3(X2)
    | ~ ssPv4(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X0,X1)
    | ~ ssPv4(X2)
    | ssPv1(X2) ) ).

cnf(clause14,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ssPv2(X4)
    | ssPv1(X2)
    | ssPv3(X2) ) ).

cnf(clause21,negated_conjecture,
    ( ~ ssPv4(X2)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ssPv4(X1)
    | ssPv1(X4)
    | ssPv2(X5) ) ).

cnf(clause16,negated_conjecture,
    ( ~ ssPv2(X2)
    | ~ ssPv1(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X4)
    | ~ ssRr(X0,X1)
    | ssPv2(X3)
    | ssPv1(X4) ) ).

cnf(clause7,negated_conjecture,
    ( ~ ssPv2(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssPv3(X3)
    | ~ ssPv4(X2)
    | ssPv2(X2) ) ).

cnf(clause31,negated_conjecture,
    ( ~ ssPv3(X4)
    | ~ ssPv4(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X5,X6)
    | ~ ssPv1(X6)
    | ~ ssRr(X2,X5)
    | ssPv2(X2) ) ).

cnf(clause26,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssPv3(X5)
    | ~ ssPv1(X2)
    | ssPv2(X4) ) ).

cnf(clause2,negated_conjecture,
    ( ~ ssPv4(X2)
    | ~ ssRr(X2,X0)
    | ~ ssPv1(X2)
    | ~ ssRr(X0,X1)
    | ssPv3(X1)
    | ssPv3(X2) ) ).

cnf(clause20,negated_conjecture,
    ( ~ ssPv3(X4)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssPv4(X3)
    | ~ ssRr(X2,X4)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X2)
    | ssPv1(X1) ) ).

cnf(clause19,negated_conjecture,
    ( ~ ssPv2(X3)
    | ~ ssPv3(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X4)
    | ~ ssPv1(X4)
    | ssPv2(X2) ) ).

cnf(clause30,negated_conjecture,
    ( ~ ssPv2(X2)
    | ~ ssPv4(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X5,X6)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ssPv3(X4)
    | ssPv2(X6) ) ).

cnf(clause6,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssPv4(X2)
    | ssPv1(X3)
    | ssPv2(X2) ) ).

cnf(clause13,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ssPv3(X4)
    | ssPv3(X2)
    | ssPv4(X2) ) ).

cnf(u32,negated_conjecture,
    ( ~ ssPv2(X2)
    | ~ ssPv1(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssPv4(X3)
    | ~ ssRr(X0,X1) ) ).

cnf(clause8,negated_conjecture,
    ( ~ ssPv3(X2)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssPv4(X3)
    | ~ ssRr(X0,X1)
    | ~ ssPv4(X2)
    | ssPv3(X1) ) ).

cnf(clause23,negated_conjecture,
    ( ~ ssPv2(X2)
    | ~ ssPv4(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ssPv4(X4)
    | ssPv1(X5) ) ).

cnf(clause18,negated_conjecture,
    ( ~ ssPv2(X3)
    | ~ ssPv1(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X4)
    | ssPv4(X4)
    | ssPv1(X2) ) ).

cnf(clause25,negated_conjecture,
    ( ~ ssPv2(X4)
    | ~ ssPv3(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssPv1(X5)
    | ssPv3(X2) ) ).

cnf(clause1,negated_conjecture,
    ssRr(X0,skf1(X0)) ).

cnf(clause12,negated_conjecture,
    ( ~ ssPv1(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X4)
    | ssPv3(X3)
    | ssPv2(X4)
    | ssPv3(X2) ) ).

cnf(clause11,negated_conjecture,
    ( ~ ssPv2(X2)
    | ~ ssPv1(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssPv4(X3)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X2) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN742-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n007.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 16:49:11 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/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.09/0.26  % (2547358)Will run a generic schedule for satisfiability detection.
% 0.09/0.26  % (2547368)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3825190231:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.26  % (2547368) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2547358-2547368"...
% 0.09/0.26  % (2547368)...printing done.
% 0.09/0.26  % SZS status Satisfiable for theBenchmark
% 0.09/0.26  % SZS output start Saturation.
% See solution above
% 0.09/0.26  % SZS output start Definitions and Model Updates.
% 0.09/0.26  % SZS output end Definitions and Model Updates.
% 0.09/0.26  % (2547368)------------------------------
% 0.09/0.26  % (2547368)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26  % (2547368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26  % (2547368)CaDiCaL version: 2.1.3
% 0.09/0.26  % (2547368)Termination reason: Satisfiable
% 0.09/0.26  % (2547368)Time elapsed: 0.001 s
% 0.09/0.26  % (2547368)Peak memory usage: 11 MB
% 0.09/0.26  % (2547368)Instructions burned: 3 (million)
% 0.09/0.26  % (2547358)Success in time 0.028 s
% 0.09/0.26  % Vampire exiting
%------------------------------------------------------------------------------