↑ Up

SPASS-SCL---0.1.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1.1
% Problem  : MGT018-1 : TPTP v9.3.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n028.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  8 06:20:06 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.41s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   18 (  14 unt;   2 nHn;  18 RR)
%            Number of literals    :   57 (   0 equ;  39 neg)
%            Maximal clause size   :   18 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
% FILE RECORD
cnf(a14_FOL_3,hypothesis,
    ( ~ organization(X0,X1)
    | ~ organization(X2,X1)
    | ~ class(X0,X3,X1)
    | ~ class(X2,X3,X1)
    | ~ reorganization(X0,X1,X4)
    | ~ reorganization(X2,X1,X5)
    | ~ reorganization_type(X0,X6,X1)
    | ~ reorganization_type(X2,X6,X1)
    | ~ inertia(X0,X7,X1)
    | ~ inertia(X2,X8,X1)
    | ~ greater(X8,X7)
    | organization(X2,X5)
    | greater(X4,X5) ),
    file('theBenchmark.p',a14_FOL_3) ).

% FILE RECORD
cnf(a5_FOL_2,hypothesis,
    ( ~ organization(X0,X1)
    | ~ organization(X2,X3)
    | ~ class(X0,X4,X1)
    | ~ class(X2,X4,X3)
    | ~ size(X0,X5,X1)
    | ~ size(X2,X6,X3)
    | ~ inertia(X0,X7,X1)
    | ~ inertia(X2,X8,X3)
    | ~ greater(X6,X5)
    | greater(X8,X7) ),
    file('theBenchmark.p',a5_FOL_2) ).

% FILE RECORD
cnf(mp5_1,axiom,
    ( ~ organization(X0,X1)
    | inertia(X0,sk1(X1,X0),X1) ),
    file('theBenchmark.p',mp5_1) ).

% CNF SPASS RESOLUTION.
cnf(c_18,plain,
    ( ~ organization(X2,X1)
    | ~ class(X0,X3,X1)
    | ~ class(X2,X3,X1)
    | ~ reorganization(X0,X1,X4)
    | ~ reorganization(X2,X1,X5)
    | ~ reorganization_type(X0,X6,X1)
    | ~ reorganization_type(X2,X6,X1)
    | ~ inertia(X2,X7,X1)
    | ~ organization(X8,X9)
    | ~ class(X0,X10,X1)
    | ~ class(X8,X10,X9)
    | ~ size(X0,X11,X1)
    | ~ size(X8,X12,X9)
    | ~ inertia(X8,X7,X9)
    | ~ greater(X12,X11)
    | ~ organization(X0,X1)
    | organization(X2,X5)
    | greater(X4,X5) ),
    inference(resolution,[status(thm)],[a14_FOL_3,a5_FOL_2,mp5_1]) ).

% FILE RECORD
cnf(t18_FOL_9,negated_conjecture,
    reorganization(sk2,sk8,sk9),
    file('theBenchmark.p',t18_FOL_9) ).

% FILE RECORD
cnf(t18_FOL_10,negated_conjecture,
    reorganization(sk3,sk8,sk10),
    file('theBenchmark.p',t18_FOL_10) ).

% FILE RECORD
cnf(t18_FOL_11,negated_conjecture,
    reorganization_type(sk2,sk4,sk8),
    file('theBenchmark.p',t18_FOL_11) ).

% FILE RECORD
cnf(t18_FOL_12,negated_conjecture,
    reorganization_type(sk3,sk4,sk8),
    file('theBenchmark.p',t18_FOL_12) ).

% FILE RECORD
cnf(t18_FOL_7,negated_conjecture,
    class(sk2,sk5,sk8),
    file('theBenchmark.p',t18_FOL_7) ).

% FILE RECORD
cnf(t18_FOL_8,negated_conjecture,
    class(sk3,sk5,sk8),
    file('theBenchmark.p',t18_FOL_8) ).

% FILE RECORD
cnf(t18_FOL_13,negated_conjecture,
    size(sk2,sk6,sk8),
    file('theBenchmark.p',t18_FOL_13) ).

% FILE RECORD
cnf(t18_FOL_14,negated_conjecture,
    size(sk3,sk7,sk8),
    file('theBenchmark.p',t18_FOL_14) ).

% FILE RECORD
cnf(t18_FOL_6,negated_conjecture,
    ~ organization(sk3,sk10),
    file('theBenchmark.p',t18_FOL_6) ).

% FILE RECORD
cnf(t18_FOL_16,negated_conjecture,
    ~ greater(sk9,sk10),
    file('theBenchmark.p',t18_FOL_16) ).

% FILE RECORD
cnf(t18_FOL_4,negated_conjecture,
    organization(sk2,sk8),
    file('theBenchmark.p',t18_FOL_4) ).

% FILE RECORD
cnf(t18_FOL_5,negated_conjecture,
    organization(sk3,sk8),
    file('theBenchmark.p',t18_FOL_5) ).

% FILE RECORD
cnf(t18_FOL_15,negated_conjecture,
    greater(sk7,sk6),
    file('theBenchmark.p',t18_FOL_15) ).

% CNF SPASS RESOLUTION.
cnf(c_19,plain,
    $false,
    inference(resolution,[status(thm)],[c_18,mp5_1,t18_FOL_9,t18_FOL_10,t18_FOL_11,t18_FOL_12,t18_FOL_7,t18_FOL_8,t18_FOL_13,t18_FOL_14,t18_FOL_6,t18_FOL_16,t18_FOL_4,t18_FOL_5,t18_FOL_15]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT018-1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35  % Computer : n028.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Mon Sep  7 12:00:47 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.41  
% 0.13/0.41  % Input Clauses:
% 0.13/0.41  % 1:2:2:INP:TopTop: organization(x0,x1) -> inertia(x0,sk1(x1,x0),x1)
% 0.13/0.41  % 2:10:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),class(x0,x4,x1),class(x2,x4,x3),size(x0,x5,x1),size(x2,x6,x3),inertia(x0,x7,x1),inertia(x2,x8,x3),greater(x6,x5) -> greater(x8,x7)
% 0.13/0.41  % 3:13:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x1),class(x0,x3,x1),class(x2,x3,x1),reorganization(x0,x1,x4),reorganization(x2,x1,x5),reorganization_type(x0,x6,x1),reorganization_type(x2,x6,x1),inertia(x0,x7,x1),inertia(x2,x8,x1),greater(x8,x7) -> organization(x2,x5),greater(x4,x5)
% 0.13/0.41  % 4:1:0:INP::  -> organization(sk2,sk8)
% 0.13/0.41  % 5:1:0:INP::  -> organization(sk3,sk8)
% 0.13/0.41  % 6:1:0:INP:: organization(sk3,sk10) -> 
% 0.13/0.41  % 7:1:0:INP::  -> class(sk2,sk5,sk8)
% 0.13/0.41  % 8:1:0:INP::  -> class(sk3,sk5,sk8)
% 0.13/0.41  % 9:1:0:INP::  -> reorganization(sk2,sk8,sk9)
% 0.13/0.41  % 10:1:0:INP::  -> reorganization(sk3,sk8,sk10)
% 0.13/0.41  % 11:1:0:INP::  -> reorganization_type(sk2,sk4,sk8)
% 0.13/0.41  % 12:1:0:INP::  -> reorganization_type(sk3,sk4,sk8)
% 0.13/0.41  % 13:1:0:INP::  -> size(sk2,sk6,sk8)
% 0.13/0.41  % 14:1:0:INP::  -> size(sk3,sk7,sk8)
% 0.13/0.41  % 15:1:0:INP::  -> greater(sk7,sk6)
% 0.13/0.41  % 16:1:0:INP:: greater(sk9,sk10) -> 
% 0.13/0.41  
% 0.13/0.41  % Predicates: organization inertia class size greater reorganization reorganization_type 
% 0.13/0.41  % Fol Constants: sk2 sk8 sk3 sk10 sk5 sk9 sk4 sk6 sk7 
% 0.13/0.41  % Fol Functions: sk1 
% 0.13/0.41  % Problem Properties:
% 0.13/0.41  % This is a full first-order problem without equality. The Problem is non-linear. 
% 0.13/0.41  
% 0.13/0.41  
% 0.13/0.41  % Reduced Input Axiom Clauses:
% 0.13/0.41  % 1:2:2:INP:TopTop: organization(x0,x1) -> inertia(x0,sk1(x1,x0),x1)
% 0.13/0.41  
% 0.13/0.41  % Reduced Input Conjecture Clauses:
% 0.13/0.41  % 2:10:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),class(x0,x4,x1),class(x2,x4,x3),size(x0,x5,x1),size(x2,x6,x3),inertia(x0,x7,x1),inertia(x2,x8,x3),greater(x6,x5) -> greater(x8,x7)
% 0.13/0.41  % 3:13:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x1),class(x0,x3,x1),class(x2,x3,x1),reorganization(x0,x1,x4),reorganization(x2,x1,x5),reorganization_type(x0,x6,x1),reorganization_type(x2,x6,x1),inertia(x0,x7,x1),inertia(x2,x8,x1),greater(x8,x7) -> organization(x2,x5),greater(x4,x5)
% 0.13/0.41  % 4:1:0:INP::  -> organization(sk2,sk8)
% 0.13/0.41  % 5:1:0:INP::  -> organization(sk3,sk8)
% 0.13/0.41  % 6:1:0:INP:: organization(sk3,sk10) -> 
% 0.13/0.41  % 7:1:0:INP::  -> class(sk2,sk5,sk8)
% 0.13/0.41  % 8:1:0:INP::  -> class(sk3,sk5,sk8)
% 0.13/0.41  % 9:1:0:INP::  -> reorganization(sk2,sk8,sk9)
% 0.13/0.41  % 10:1:0:INP::  -> reorganization(sk3,sk8,sk10)
% 0.13/0.41  % 11:1:0:INP::  -> reorganization_type(sk2,sk4,sk8)
% 0.13/0.41  % 12:1:0:INP::  -> reorganization_type(sk3,sk4,sk8)
% 0.13/0.41  % 13:1:0:INP::  -> size(sk2,sk6,sk8)
% 0.13/0.41  % 14:1:0:INP::  -> size(sk3,sk7,sk8)
% 0.13/0.41  % 15:1:0:INP::  -> greater(sk7,sk6)
% 0.13/0.41  % 16:1:0:INP:: greater(sk9,sk10) -> 
% 0.13/0.41  
% 0.13/0.41  
% 0.13/0.41  % === Starting SPASS-SCL-FOL A Little Less Naive, considering 38 atoms initially. Used heuristic: lmodel_grow ===
% 0.13/0.41  
% 0.13/0.41  
% 0.13/0.41  
% 0.13/0.41  % SZS status Unsatisfiable
% 0.13/0.41  % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.41  
% 0.13/0.41  % SPASS-SCL-FOL Statistics:
% 0.13/0.41  % Number of learned clauses: 2
% 0.13/0.41  % Number of propagations: 34
% 0.13/0.41  % Number of decisions: 31
% 0.13/0.41  % Number of resolutions: 17
% 0.13/0.41  % Number of condensations: 0
% 0.13/0.41  % Number of sub resolutions: 0
% 0.13/0.41  
% 0.13/0.41  % Solver is done. Empty clause found
% 0.13/0.41  
% 0.13/0.41  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.41  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.41  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.41  
% 0.13/0.41  
% 0.13/0.41  % Needed:       0:00:00.06
% 0.13/0.41  
% 0.13/0.41  % ###
% 0.13/0.41  % ### Pagesize: 8192
% 0.13/0.41  % ### Marksize: 0
% 0.13/0.41  % ### Memory demanded:  1285 KBytes
% 0.13/0.41  % ### Memory freed:     1285 KBytes
% 0.13/0.41  % ### Memory remaining: 0 Bytes
% 0.13/0.41  % ### Pages allocated:  228 Pages
% 0.13/0.41  % ###
%------------------------------------------------------------------------------