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

% Computer : n020.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:08:50 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
% FILE RECORD
cnf(condensed_detachment,axiom,
    ( ~ is_a_theorem(implies(X0,X1))
    | ~ is_a_theorem(X0)
    | is_a_theorem(X1) ),
    file('theBenchmark.p',condensed_detachment) ).

% FILE RECORD
cnf(cn_54,axiom,
    is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))),
    file('theBenchmark.p',cn_54) ).

% CNF SPASS RESOLUTION.
cnf(c_13,plain,
    ( ~ is_a_theorem(implies(X0,X1))
    | is_a_theorem(implies(implies(not(X0),X1),X1)) ),
    inference(resolution,[status(thm)],[condensed_detachment,cn_54]) ).

% FILE RECORD
cnf(cn_21,axiom,
    is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
    file('theBenchmark.p',cn_21) ).

% CNF SPASS RESOLUTION.
cnf(c_8,plain,
    ( ~ is_a_theorem(implies(X0,implies(X1,X2)))
    | is_a_theorem(implies(X1,implies(X0,X2))) ),
    inference(resolution,[status(thm)],[condensed_detachment,cn_21]) ).

% FILE RECORD
cnf(cn_3,axiom,
    is_a_theorem(implies(X0,implies(not(X0),X1))),
    file('theBenchmark.p',cn_3) ).

% CNF SPASS RESOLUTION.
cnf(c_9,plain,
    is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(resolution,[status(thm)],[c_8,cn_3]) ).

% FILE RECORD
cnf(cn_18,axiom,
    is_a_theorem(implies(X0,implies(X1,X0))),
    file('theBenchmark.p',cn_18) ).

% FILE RECORD
cnf(prove_cn_40,negated_conjecture,
    ~ is_a_theorem(implies(a,not(not(a)))),
    file('theBenchmark.p',prove_cn_40) ).

% CNF SPASS RESOLUTION.
cnf(c_19,plain,
    $false,
    inference(resolution,[status(thm)],[c_13,condensed_detachment,c_9,cn_18,prove_cn_40]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL044-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35  % Computer : n020.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Sat Sep  5 05:23:27 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.07/5.33  
% 5.07/5.33  % Input Clauses:
% 5.07/5.33  % 1:3:2:INP:TopTop: is_a_theorem(implies(x0,x1)),is_a_theorem(x0) -> is_a_theorem(x1)
% 5.07/5.33  % 2:1:2:INP:TopTop:  -> is_a_theorem(implies(x0,implies(not(x0),x1)))
% 5.07/5.33  % 3:1:2:INP:TopTop:  -> is_a_theorem(implies(x0,implies(x1,x0)))
% 5.07/5.33  % 4:1:3:INP:TopTopTop:  -> is_a_theorem(implies(implies(x0,implies(x1,x2)),implies(x1,implies(x0,x2))))
% 5.07/5.33  % 5:1:3:INP:TopTopTop:  -> is_a_theorem(implies(implies(x0,x1),implies(implies(x2,x0),implies(x2,x1))))
% 5.07/5.33  % 6:1:2:INP:TopTop:  -> is_a_theorem(implies(implies(x0,x1),implies(implies(not(x0),x1),x1)))
% 5.07/5.33  % 7:1:0:INP:: is_a_theorem(implies(a,not(not(a)))) -> 
% 5.07/5.33  
% 5.07/5.33  % Predicates: is_a_theorem 
% 5.07/5.33  % Fol Constants: a 
% 5.07/5.33  % Fol Functions: implies not 
% 5.07/5.33  % Problem Properties:
% 5.07/5.33  % This is a full first-order problem without equality. The Problem is non-linear. 
% 5.07/5.33  
% 5.07/5.33  
% 5.07/5.33  % Reduced Input Axiom Clauses:
% 5.07/5.33  % 1:3:2:INP:TopTop: is_a_theorem(implies(x0,x1)),is_a_theorem(x0) -> is_a_theorem(x1)
% 5.07/5.33  % 2:1:2:INP:TopTop:  -> is_a_theorem(implies(x0,implies(not(x0),x1)))
% 5.07/5.33  % 3:1:2:INP:TopTop:  -> is_a_theorem(implies(x0,implies(x1,x0)))
% 5.07/5.33  % 4:1:3:INP:TopTopTop:  -> is_a_theorem(implies(implies(x0,implies(x1,x2)),implies(x1,implies(x0,x2))))
% 5.07/5.33  % 5:1:3:INP:TopTopTop:  -> is_a_theorem(implies(implies(x0,x1),implies(implies(x2,x0),implies(x2,x1))))
% 5.07/5.33  % 6:1:2:INP:TopTop:  -> is_a_theorem(implies(implies(x0,x1),implies(implies(not(x0),x1),x1)))
% 5.07/5.33  
% 5.07/5.33  % Reduced Input Conjecture Clauses:
% 5.07/5.33  % 7:1:0:INP:: is_a_theorem(implies(a,not(not(a)))) -> 
% 5.07/5.33  
% 5.07/5.33  
% 5.07/5.33  % === Starting SPASS-SCL-FOL A Little Less Naive, considering 105 atoms initially. Used heuristic: lcl ===
% 5.07/5.33  
% 5.07/5.33  
% 5.07/5.33  
% 5.07/5.33  % SZS status Unsatisfiable
% 5.07/5.33  % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.07/5.33  
% 5.07/5.33  % SPASS-SCL-FOL Statistics:
% 5.07/5.33  % Number of learned clauses: 11
% 5.07/5.33  % Number of propagations: 875
% 5.07/5.33  % Number of decisions: 389
% 5.07/5.33  % Number of resolutions: 18
% 5.07/5.33  % Number of condensations: 0
% 5.07/5.33  % Number of sub resolutions: 0
% 5.07/5.33  
% 5.07/5.33  % Solver is done. Empty clause found
% 5.07/5.33  
% 5.07/5.33  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 5.07/5.33  % SZS output start Proof for theBenchmark
% See solution above
% 5.07/5.33  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 5.07/5.33  
% 5.07/5.33  
% 5.07/5.33  % Needed:       0:00:04.97
% 5.07/5.33  
% 5.07/5.33  % ###
% 5.07/5.33  % ### Pagesize: 8192
% 5.07/5.33  % ### Marksize: 0
% 5.07/5.33  % ### Memory demanded:  90684 KBytes
% 5.07/5.33  % ### Memory freed:     90684 KBytes
% 5.07/5.33  % ### Memory remaining: 0 Bytes
% 5.07/5.33  % ### Pages allocated:  10941 Pages
% 5.07/5.33  % ###
%------------------------------------------------------------------------------