↑ 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  : MGT041-2 : 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 : n011.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:10 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
% FILE RECORD
cnf(a15_3,hypothesis,
    ( ~ organisation_at_time(X0,X1)
    | ~ first_mover(X0)
    | ~ founding_time(X0,X1)
    | number_of_routines(X0,X1,low) ),
    file('theBenchmark.p',a15_3) ).

% FILE RECORD
cnf(mp_not_high_and_low_1,axiom,
    ( ~ number_of_routines(X0,X1,low)
    | ~ number_of_routines(X0,X1,high) ),
    file('theBenchmark.p',mp_not_high_and_low_1) ).

% FILE RECORD
cnf(prove_t10_8,negated_conjecture,
    ( ~ organisation_at_time(X0,X1)
    | first_mover(X0)
    | efficient_producer(X0) ),
    file('theBenchmark.p',prove_t10_8) ).

% FILE RECORD
cnf(a14_2,hypothesis,
    ( ~ organisation_at_time(X0,X1)
    | ~ efficient_producer(X0)
    | ~ founding_time(X0,X1)
    | has_elaborated_routines(X0,X1) ),
    file('theBenchmark.p',a14_2) ).

% FILE RECORD
cnf(a16_6,hypothesis,
    number_of_routines(sk1,sk2,high),
    file('theBenchmark.p',a16_6) ).

% FILE RECORD
cnf(a16_7,hypothesis,
    ~ has_elaborated_routines(sk1,sk2),
    file('theBenchmark.p',a16_7) ).

% FILE RECORD
cnf(a16_4,hypothesis,
    organisation_at_time(sk1,sk2),
    file('theBenchmark.p',a16_4) ).

% FILE RECORD
cnf(a16_5,hypothesis,
    founding_time(sk1,sk2),
    file('theBenchmark.p',a16_5) ).

% CNF SPASS RESOLUTION.
cnf(c_9,plain,
    $false,
    inference(resolution,[status(thm)],[a15_3,mp_not_high_and_low_1,prove_t10_8,a14_2,a16_6,a16_7,a16_4,a16_5]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT041-2 : 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.07/0.35  % Computer : n011.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 13:03:15 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35  
% 0.07/0.35  % Input Clauses:
% 0.07/0.35  % 1:2:2:INP:TopTop: number_of_routines(x0,x1,low),number_of_routines(x0,x1,high) -> 
% 0.07/0.35  % 2:4:2:INP:TopTop: organisation_at_time(x0,x1),efficient_producer(x0),founding_time(x0,x1) -> has_elaborated_routines(x0,x1)
% 0.07/0.35  % 3:4:2:INP:TopTop: organisation_at_time(x0,x1),first_mover(x0),founding_time(x0,x1) -> number_of_routines(x0,x1,low)
% 0.07/0.35  % 4:1:0:INP::  -> organisation_at_time(sk1,sk2)
% 0.07/0.35  % 5:1:0:INP::  -> founding_time(sk1,sk2)
% 0.07/0.35  % 6:1:0:INP::  -> number_of_routines(sk1,sk2,high)
% 0.07/0.35  % 7:1:0:INP:: has_elaborated_routines(sk1,sk2) -> 
% 0.07/0.35  % 8:3:2:INP:TopTop: organisation_at_time(x0,x1) -> first_mover(x0),efficient_producer(x0)
% 0.07/0.35  
% 0.07/0.35  % Predicates: number_of_routines organisation_at_time efficient_producer founding_time has_elaborated_routines first_mover 
% 0.07/0.35  % Fol Constants: low high sk1 sk2 
% 0.07/0.35  % Fol Functions: 
% 0.07/0.35  % Problem Properties:
% 0.07/0.35  % This is a Bernays Schoenfinkel problem. The Problem is linear. 
% 0.07/0.35  
% 0.07/0.35  
% 0.07/0.35  % Reduced Input Axiom Clauses:
% 0.07/0.35  % 1:2:2:INP:TopTop: number_of_routines(x0,x1,low),number_of_routines(x0,x1,high) -> 
% 0.07/0.35  
% 0.07/0.35  % Reduced Input Conjecture Clauses:
% 0.07/0.36  % 2:4:2:INP:TopTop: organisation_at_time(x0,x1),efficient_producer(x0),founding_time(x0,x1) -> has_elaborated_routines(x0,x1)
% 0.07/0.36  % 3:4:2:INP:TopTop: organisation_at_time(x0,x1),first_mover(x0),founding_time(x0,x1) -> number_of_routines(x0,x1,low)
% 0.07/0.36  % 4:1:0:INP::  -> organisation_at_time(sk1,sk2)
% 0.07/0.36  % 5:1:0:INP::  -> founding_time(sk1,sk2)
% 0.07/0.36  % 6:1:0:INP::  -> number_of_routines(sk1,sk2,high)
% 0.07/0.36  % 7:1:0:INP:: has_elaborated_routines(sk1,sk2) -> 
% 0.07/0.36  % 8:3:2:INP:TopTop: organisation_at_time(x0,x1) -> first_mover(x0),efficient_producer(x0)
% 0.07/0.36  
% 0.07/0.36  
% 0.07/0.36  % === Starting SPASS-SCL-FOL A Little Less Naive, considering 14 atoms initially. Used heuristic: lmodel_grow ===
% 0.07/0.36  
% 0.07/0.36  
% 0.07/0.36  
% 0.07/0.36  % SZS status Unsatisfiable
% 0.07/0.36  % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.36  
% 0.07/0.36  % SPASS-SCL-FOL Statistics:
% 0.07/0.36  % Number of learned clauses: 0
% 0.07/0.36  % Number of propagations: 7
% 0.07/0.36  % Number of decisions: 2
% 0.07/0.36  % Number of resolutions: 7
% 0.07/0.36  % Number of condensations: 0
% 0.07/0.36  % Number of sub resolutions: 0
% 0.07/0.36  
% 0.07/0.36  % Solver is done. Empty clause found
% 0.07/0.36  
% 0.07/0.36  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.07/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.36  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.07/0.36  
% 0.07/0.36  
% 0.07/0.36  % Needed:       0:00:00.00
% 0.07/0.36  
% 0.07/0.36  % ###
% 0.07/0.36  % ### Pagesize: 8192
% 0.07/0.36  % ### Marksize: 0
% 0.07/0.36  % ### Memory demanded:  273 KBytes
% 0.07/0.36  % ### Memory freed:     273 KBytes
% 0.07/0.36  % ### Memory remaining: 0 Bytes
% 0.07/0.36  % ### Pages allocated:  95 Pages
% 0.07/0.36  % ###
%------------------------------------------------------------------------------