↑ 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  : SYN785-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 : n002.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:17 PM UTC 2026

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

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

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

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

cnf(clause5,negated_conjecture,
    ( ~ ssPv1(X1)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X1)
    | ssPv2(X0)
    | ssPv2(X1) ) ).

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

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

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

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

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

cnf(clause4,negated_conjecture,
    ( ~ ssPv2(X0)
    | ~ ssRr(X0,X1)
    | ~ ssPv2(X1)
    | ssPv3(X1)
    | ssPv4(X1) ) ).

cnf(clause41,negated_conjecture,
    ( ~ ssPv2(X0)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X1)
    | ~ ssRr(X1,X3)
    | ~ ssPv2(X3)
    | ~ ssPv2(X1)
    | ssPv2(X2) ) ).

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

cnf(clause28,negated_conjecture,
    ( ~ ssPv1(X0)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X1,X2)
    | ~ ssPv2(X1)
    | ~ ssPv3(X1)
    | ssPv1(X2) ) ).

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

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

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

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

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

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

cnf(clause7,negated_conjecture,
    ( ~ ssPv1(X1)
    | ~ ssPv3(X0)
    | ~ ssRr(X0,X1)
    | ssPv2(X1)
    | ssPv3(X1) ) ).

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

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

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

cnf(clause2,negated_conjecture,
    ssRr(X0,skf2(X0)) ).

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

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

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

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

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

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

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

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

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

cnf(clause8,negated_conjecture,
    ( ~ ssPv3(X0)
    | ~ ssPv2(X0)
    | ~ ssRr(X0,X1)
    | ssPv1(X1)
    | ssPv1(X0) ) ).

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

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

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

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

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

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

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

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


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