↑ 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  : MGT009-1 : TPTP v9.3.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

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

% Result   : Unsatisfiable 0.34s 0.59s
% Output   : Proof 0.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   17 (  13 unt;   0 nHn;  17 RR)
%            Number of literals    :   50 (   0 equ;  34 neg)
%            Maximal clause size   :   15 (   2 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   :   31 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
% FILE RECORD
cnf(a5_FOL_4,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_4) ).

% FILE RECORD
cnf(a3_FOL_3,hypothesis,
    ( ~ organization(X0,X1)
    | ~ organization(X2,X3)
    | ~ reorganization_free(X0,X1,X1)
    | ~ reorganization_free(X2,X3,X3)
    | ~ reproducibility(X0,X4,X1)
    | ~ reproducibility(X2,X5,X3)
    | ~ inertia(X0,X6,X1)
    | ~ inertia(X2,X7,X3)
    | ~ greater(X7,X6)
    | greater(X5,X4) ),
    file('theBenchmark.p',a3_FOL_3) ).

% 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_19,plain,
    ( ~ organization(X2,X3)
    | ~ class(X0,X4,X1)
    | ~ class(X2,X4,X3)
    | ~ size(X0,X5,X1)
    | ~ size(X2,X6,X3)
    | ~ inertia(X2,X7,X3)
    | ~ greater(X6,X5)
    | ~ organization(X8,X9)
    | ~ reorganization_free(X0,X1,X1)
    | ~ reorganization_free(X8,X9,X9)
    | ~ reproducibility(X0,X10,X1)
    | ~ reproducibility(X8,X11,X9)
    | ~ inertia(X8,X7,X9)
    | ~ organization(X0,X1)
    | greater(X11,X10) ),
    inference(resolution,[status(thm)],[a5_FOL_4,a3_FOL_3,mp5_1]) ).

% FILE RECORD
cnf(t9_FOL_7,negated_conjecture,
    reorganization_free(sk2,sk9,sk9),
    file('theBenchmark.p',t9_FOL_7) ).

% FILE RECORD
cnf(t9_FOL_8,negated_conjecture,
    reorganization_free(sk3,sk10,sk10),
    file('theBenchmark.p',t9_FOL_8) ).

% FILE RECORD
cnf(t9_FOL_11,negated_conjecture,
    reproducibility(sk2,sk5,sk9),
    file('theBenchmark.p',t9_FOL_11) ).

% FILE RECORD
cnf(t9_FOL_12,negated_conjecture,
    reproducibility(sk3,sk6,sk10),
    file('theBenchmark.p',t9_FOL_12) ).

% FILE RECORD
cnf(t9_FOL_9,negated_conjecture,
    class(sk2,sk4,sk9),
    file('theBenchmark.p',t9_FOL_9) ).

% FILE RECORD
cnf(t9_FOL_10,negated_conjecture,
    class(sk3,sk4,sk10),
    file('theBenchmark.p',t9_FOL_10) ).

% FILE RECORD
cnf(t9_FOL_13,negated_conjecture,
    size(sk2,sk7,sk9),
    file('theBenchmark.p',t9_FOL_13) ).

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

% FILE RECORD
cnf(t9_FOL_16,negated_conjecture,
    ~ greater(sk6,sk5),
    file('theBenchmark.p',t9_FOL_16) ).

% FILE RECORD
cnf(t9_FOL_5,negated_conjecture,
    organization(sk2,sk9),
    file('theBenchmark.p',t9_FOL_5) ).

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

% FILE RECORD
cnf(t9_FOL_15,negated_conjecture,
    greater(sk8,sk7),
    file('theBenchmark.p',t9_FOL_15) ).

% CNF SPASS RESOLUTION.
cnf(c_20,plain,
    $false,
    inference(resolution,[status(thm)],[c_19,mp5_1,t9_FOL_7,t9_FOL_8,t9_FOL_11,t9_FOL_12,t9_FOL_9,t9_FOL_10,t9_FOL_13,t9_FOL_14,t9_FOL_16,t9_FOL_5,t9_FOL_6,t9_FOL_15]) ).


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