TPTP Problem File: SYN776-1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SYN776-1 : TPTP v8.2.0. Released v2.5.0.
% Domain : Syntactic (Translated)
% Problem : PSAT inverse - K=4 C=30 V=4 D=2.1
% Version : Especial.
% English :
% Refs : [Sch99] Schmidt (1999), Decidability by Resolution for Proposit
% : [HS00a] Hustadt & Schmidt (2000), MSPASS: Modal Reasoning by Tr
% : [HS00b] Hustadt & Schmidt (2000), Issues of Decidability for De
% : [Sch01] Schmidt (2001), Email to G. Sutcliffe
% Source : [Sch01]
% Names : p-psat-inv-cnf-K4-C30-V4-D2.1 [Sch01]
% Status : Satisfiable
% Rating : 0.00 v5.5.0, 0.25 v5.4.0, 0.78 v5.3.0, 0.71 v5.0.0, 0.50 v4.1.0, 0.43 v4.0.0, 0.50 v3.5.0, 0.57 v3.4.0, 0.50 v3.3.0, 0.67 v3.2.0, 0.80 v3.1.0, 0.86 v2.7.0, 0.80 v2.6.0, 0.75 v2.5.0
% Syntax : Number of clauses : 32 ( 2 unt; 20 nHn; 30 RR)
% Number of literals : 242 ( 0 equ; 179 neg)
% Maximal clause size : 10 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 5 usr; 0 prp; 1-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 152 ( 0 sgn)
% SPC : CNF_SAT_RFO_NEQ
% Comments : The relational translation for the PSAT inverse problem.
%--------------------------------------------------------------------------
cnf(clause1,negated_conjecture,
ssRr(skf3(U),U) ).
cnf(clause2,negated_conjecture,
ssRr(U,skf2(U)) ).
cnf(clause3,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(V,W)
| ssPv1(U)
| ssPv1(W)
| ssPv2(W)
| ssPv3(W) ) ).
cnf(clause4,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv3(U)
| ~ ssRr(V,W)
| ~ ssPv2(W)
| ssPv3(W)
| ssPv4(W) ) ).
cnf(clause5,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(V,W)
| ~ ssPv1(W)
| ~ ssPv3(W)
| ssPv3(U)
| ssPv2(W) ) ).
cnf(clause6,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv1(U)
| ~ ssRr(V,W)
| ~ ssPv3(W)
| ssPv1(W)
| ssPv2(W) ) ).
cnf(clause7,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(V,W)
| ~ ssRr(X,W)
| ~ ssPv1(W)
| ~ ssPv3(W)
| ssPv2(U)
| ssPv1(X) ) ).
cnf(clause8,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(W,U)
| ~ ssRr(W,X)
| ~ ssPv3(X)
| ~ ssPv2(W)
| ssPv4(V)
| ssPv1(W) ) ).
cnf(clause9,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(W,U)
| ~ ssRr(W,X)
| ~ ssPv3(X)
| ~ ssPv2(W)
| ssPv2(V)
| ssPv1(W) ) ).
cnf(clause10,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv1(U)
| ~ ssRr(V,W)
| ~ ssRr(W,X)
| ~ ssPv3(W)
| ~ ssPv4(W)
| ssPv3(X) ) ).
cnf(clause11,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv4(U)
| ~ ssRr(V,W)
| ~ ssRr(X,W)
| ~ ssPv4(X)
| ~ ssPv2(W)
| ssPv4(W) ) ).
cnf(clause12,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv3(U)
| ~ ssRr(W,X)
| ~ ssPv2(X)
| ~ ssRr(V,W)
| ~ ssPv1(V)
| ~ ssPv2(V) ) ).
cnf(clause13,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(V,W)
| ~ ssRr(X,Y)
| ~ ssRr(Y,W)
| ssPv4(U)
| ssPv1(X)
| ssPv1(W)
| ssPv2(W) ) ).
cnf(clause14,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(V,W)
| ~ ssRr(X,Y)
| ~ ssRr(W,X)
| ~ ssPv1(W)
| ssPv3(U)
| ssPv2(Y)
| ssPv3(W) ) ).
cnf(clause15,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv3(U)
| ~ ssRr(V,W)
| ~ ssRr(X,Y)
| ~ ssRr(W,X)
| ssPv2(Y)
| ssPv3(W)
| ssPv4(W) ) ).
cnf(clause16,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(V,W)
| ~ ssRr(X,Y)
| ~ ssPv2(Y)
| ~ ssRr(W,X)
| ssPv1(U)
| ssPv1(W)
| ssPv3(W) ) ).
cnf(clause17,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(V,W)
| ~ ssRr(X,Y)
| ~ ssRr(Y,W)
| ~ ssPv4(W)
| ssPv3(U)
| ssPv2(X)
| ssPv1(W) ) ).
cnf(clause18,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv2(U)
| ~ ssRr(W,X)
| ~ ssRr(V,W)
| ~ ssRr(V,Y)
| ~ ssPv4(Y)
| ssPv4(X)
| ssPv2(V) ) ).
cnf(clause19,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv1(U)
| ~ ssRr(V,W)
| ~ ssRr(X,W)
| ~ ssRr(Y,W)
| ~ ssPv4(W)
| ssPv4(X)
| ssPv2(Y) ) ).
cnf(clause20,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv4(U)
| ~ ssRr(W,X)
| ~ ssPv4(X)
| ~ ssRr(V,W)
| ~ ssRr(V,Y)
| ~ ssPv3(Y)
| ssPv2(V) ) ).
cnf(clause21,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv1(U)
| ~ ssRr(W,V)
| ~ ssRr(X,Y)
| ~ ssPv2(Y)
| ~ ssRr(V,X)
| ~ ssPv2(V)
| ssPv3(W) ) ).
cnf(clause22,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(V,W)
| ~ ssRr(X,Y)
| ~ ssPv2(Y)
| ~ ssRr(W,X)
| ~ ssPv2(W)
| ~ ssPv3(W)
| ssPv3(U) ) ).
cnf(clause23,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv1(U)
| ~ ssRr(V,W)
| ~ ssRr(X,W)
| ~ ssRr(Y,Z)
| ~ ssRr(W,Y)
| ssPv4(X)
| ssPv3(Z)
| ssPv2(W) ) ).
cnf(clause24,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(V,W)
| ~ ssRr(X,W)
| ~ ssRr(Y,Z)
| ~ ssPv3(Z)
| ~ ssRr(W,Y)
| ssPv4(U)
| ssPv4(X)
| ssPv3(W) ) ).
cnf(clause25,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv1(V)
| ~ ssRr(W,U)
| ~ ssRr(X,Y)
| ~ ssRr(W,X)
| ~ ssRr(W,Z)
| ~ ssPv1(Z)
| ssPv1(Y)
| ssPv1(W) ) ).
cnf(clause26,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(W,X)
| ~ ssPv4(X)
| ~ ssRr(V,W)
| ~ ssRr(Y,Z)
| ~ ssRr(V,Y)
| ~ ssPv3(V)
| ssPv2(U)
| ssPv3(Z) ) ).
cnf(clause27,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(V,W)
| ~ ssRr(X,W)
| ~ ssPv1(X)
| ~ ssRr(Y,Z)
| ~ ssPv1(Z)
| ~ ssRr(W,Y)
| ~ ssPv1(W)
| ssPv1(U) ) ).
cnf(clause28,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(W,X)
| ~ ssPv3(X)
| ~ ssRr(V,W)
| ~ ssRr(Y,Z)
| ~ ssPv1(Z)
| ~ ssRr(V,Y)
| ~ ssPv3(V)
| ssPv1(U) ) ).
cnf(clause29,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssRr(V,W)
| ~ ssRr(X,Y)
| ~ ssPv1(Y)
| ~ ssRr(W,X)
| ~ ssRr(Z,X1)
| ~ ssRr(W,Z)
| ssPv2(U)
| ssPv1(X1)
| ssPv4(W) ) ).
cnf(clause30,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv3(V)
| ~ ssRr(W,U)
| ~ ssRr(X,Y)
| ~ ssRr(W,X)
| ~ ssRr(Z,X1)
| ~ ssRr(W,Z)
| ssPv4(Y)
| ssPv3(X1)
| ssPv1(W) ) ).
cnf(clause31,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv3(V)
| ~ ssRr(W,U)
| ~ ssRr(X,Y)
| ~ ssPv2(Y)
| ~ ssRr(W,X)
| ~ ssRr(Z,X1)
| ~ ssRr(W,Z)
| ~ ssPv4(W)
| ssPv3(X1) ) ).
cnf(clause32,negated_conjecture,
( ~ ssRr(U,V)
| ~ ssPv4(U)
| ~ ssRr(V,W)
| ~ ssRr(X,Y)
| ~ ssRr(Y,W)
| ~ ssRr(Z,X1)
| ~ ssPv3(X1)
| ~ ssRr(W,Z)
| ~ ssPv4(W)
| ssPv1(X) ) ).
%--------------------------------------------------------------------------