↑ 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  : LCL414-1 : TPTP v9.3.1. Released v2.5.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 : Mon Sep  7 01:09:30 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
% FILE RECORD
cnf(thm147_1,negated_conjecture,
    ( ~ a_truth(X0)
    | ~ a_truth(implies(X0,X1))
    | a_truth(X1) ),
    file('theBenchmark.p',thm147_1) ).

% FILE RECORD
cnf(thm147_3,negated_conjecture,
    a_truth(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
    file('theBenchmark.p',thm147_3) ).

% CNF SPASS RESOLUTION.
cnf(c_6,plain,
    ( ~ a_truth(implies(X0,implies(X1,X2)))
    | a_truth(implies(implies(X0,X1),implies(X0,X2))) ),
    inference(resolution,[status(thm)],[thm147_1,thm147_3]) ).

% FILE RECORD
cnf(thm147_5,negated_conjecture,
    ~ a_truth(implies(sk1,sk1)),
    file('theBenchmark.p',thm147_5) ).

% FILE RECORD
cnf(thm147_2,negated_conjecture,
    a_truth(implies(X0,implies(X1,X0))),
    file('theBenchmark.p',thm147_2) ).

% CNF SPASS RESOLUTION.
cnf(c_7,plain,
    $false,
    inference(resolution,[status(thm)],[thm147_1,c_6,thm147_5,thm147_2,thm147_2]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL414-1 : TPTP v9.3.1. Released v2.5.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.34  % Computer : n002.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.34  % CPULimit : 300
% 0.07/0.34  % WCLimit  : 300
% 0.07/0.34  % DateTime : Fri Sep  4 20:12:35 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.13/0.39  
% 0.13/0.39  % Input Clauses:
% 0.13/0.39  % 1:3:2:INP:TopTop: a_truth(x0),a_truth(implies(x0,x1)) -> a_truth(x1)
% 0.13/0.39  % 2:1:2:INP:TopTop:  -> a_truth(implies(x0,implies(x1,x0)))
% 0.13/0.39  % 3:1:3:INP:TopTopTop:  -> a_truth(implies(implies(x0,implies(x1,x2)),implies(implies(x0,x1),implies(x0,x2))))
% 0.13/0.39  % 4:1:2:INP:TopTop:  -> a_truth(implies(implies(not(x0),not(x1)),implies(x1,x0)))
% 0.13/0.39  % 5:1:0:INP:: a_truth(implies(sk1,sk1)) -> 
% 0.13/0.39  
% 0.13/0.39  % Predicates: a_truth 
% 0.13/0.39  % Fol Constants: sk1 
% 0.13/0.39  % Fol Functions: implies not 
% 0.13/0.39  % Problem Properties:
% 0.13/0.39  % This is a full first-order problem without equality. The Problem is non-linear. 
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  % Reduced Input Axiom Clauses:
% 0.13/0.39  
% 0.13/0.39  % Reduced Input Conjecture Clauses:
% 0.13/0.39  % 1:3:2:INP:TopTop: a_truth(x0),a_truth(implies(x0,x1)) -> a_truth(x1)
% 0.13/0.39  % 2:1:2:INP:TopTop:  -> a_truth(implies(x0,implies(x1,x0)))
% 0.13/0.39  % 3:1:3:INP:TopTopTop:  -> a_truth(implies(implies(x0,implies(x1,x2)),implies(implies(x0,x1),implies(x0,x2))))
% 0.13/0.39  % 4:1:2:INP:TopTop:  -> a_truth(implies(implies(not(x0),not(x1)),implies(x1,x0)))
% 0.13/0.39  % 5:1:0:INP:: a_truth(implies(sk1,sk1)) -> 
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  % === Starting SPASS-SCL-FOL A Little Less Naive, considering 75 atoms initially. Used heuristic: lcl ===
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  % SZS status Unsatisfiable
% 0.13/0.39  % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39  
% 0.13/0.39  % SPASS-SCL-FOL Statistics:
% 0.13/0.39  % Number of learned clauses: 1
% 0.13/0.39  % Number of propagations: 22
% 0.13/0.39  % Number of decisions: 67
% 0.13/0.39  % Number of resolutions: 5
% 0.13/0.39  % Number of condensations: 0
% 0.13/0.39  % Number of sub resolutions: 0
% 0.13/0.39  
% 0.13/0.39  % Solver is done. Empty clause found
% 0.13/0.39  
% 0.13/0.39  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.39  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  % Needed:       0:00:00.04
% 0.13/0.39  
% 0.13/0.39  % ###
% 0.13/0.39  % ### Pagesize: 8192
% 0.13/0.39  % ### Marksize: 0
% 0.13/0.39  % ### Memory demanded:  2578 KBytes
% 0.13/0.39  % ### Memory freed:     2578 KBytes
% 0.13/0.39  % ### Memory remaining: 0 Bytes
% 0.13/0.39  % ### Pages allocated:  360 Pages
% 0.13/0.39  % ###
%------------------------------------------------------------------------------