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

% Computer : n019.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:33 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
% FILE RECORD
cnf(cls_Set_OinsertCI_1,axiom,
    c_in(X0,c_insert(X0,X1,X2),X2),
    file('theBenchmark.p',cls_Set_OinsertCI_1) ).

% FILE RECORD
cnf(cls_PropLog_Othms_OH_0,axiom,
    ( ~ c_in(X0,X1,tc_PropLog_Opl(X2))
    | c_in(X0,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2)) ),
    file('theBenchmark.p',cls_PropLog_Othms_OH_0) ).

% FILE RECORD
cnf(cls_PropLog_Osat__imp_0,axiom,
    ( ~ c_PropLog_Osat(c_insert(X0,X1,tc_PropLog_Opl(X2)),X3,X2)
    | c_PropLog_Osat(X1,c_PropLog_Opl_Oop_A_N_62(X0,X3,X2),X2) ),
    file('theBenchmark.p',cls_PropLog_Osat__imp_0) ).

% FILE RECORD
cnf(cls_conjecture_2,negated_conjecture,
    c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
    file('theBenchmark.p',cls_conjecture_2) ).

% FILE RECORD
cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
    ( ~ c_in(X0,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2))
    | c_in(X0,c_PropLog_Othms(c_insert(X3,X1,tc_PropLog_Opl(X2)),X2),tc_PropLog_Opl(X2)) ),
    file('theBenchmark.p',cls_PropLog_Oweaken__left__insert_0) ).

% FILE RECORD
cnf(cls_conjecture_4,negated_conjecture,
    ( ~ c_PropLog_Osat(v_F,X0,t_a)
    | c_in(X0,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)) ),
    file('theBenchmark.p',cls_conjecture_4) ).

% CNF SPASS RESOLUTION.
cnf(c_24,plain,
    ( ~ c_PropLog_Osat(v_F,X0,t_a)
    | c_in(X0,c_PropLog_Othms(c_insert(X1,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
    inference(resolution,[status(thm)],[cls_PropLog_Oweaken__left__insert_0,cls_conjecture_4]) ).

% FILE RECORD
cnf(cls_PropLog_Othms_OMP_0,axiom,
    ( ~ c_in(X0,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X0,X3,X2),c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2))
    | c_in(X3,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2)) ),
    file('theBenchmark.p',cls_PropLog_Othms_OMP_0) ).

% CNF SPASS RESOLUTION.
cnf(c_27,plain,
    ( ~ c_in(v_x,c_PropLog_Othms(c_insert(X0,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
    | c_in(v_xa,c_PropLog_Othms(c_insert(X0,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
    inference(resolution,[status(thm)],[cls_PropLog_Osat__imp_0,cls_conjecture_2,c_24,cls_PropLog_Othms_OMP_0]) ).

% FILE RECORD
cnf(cls_conjecture_3,negated_conjecture,
    ~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
    file('theBenchmark.p',cls_conjecture_3) ).

% CNF SPASS RESOLUTION.
cnf(c_28,plain,
    $false,
    inference(resolution,[status(thm)],[cls_Set_OinsertCI_1,cls_PropLog_Othms_OH_0,c_27,cls_conjecture_3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL433-2 : TPTP v9.3.1. Released v3.2.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.36  % Computer : n019.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep  5 09:10:38 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
% 151.36/151.64  
% 151.36/151.64  % Input Clauses:
% 151.36/151.64  % 1:1:0:INP::  -> c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a)
% 151.36/151.64  % 2:1:0:INP:: c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) -> 
% 151.36/151.64  % 3:2:1:INP:Top: c_PropLog_Osat(v_F,x0,t_a) -> c_in(x0,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
% 151.36/151.64  % 4:2:4:INP:TopTopTopTop: c_PropLog_Osat(c_insert(x0,x1,tc_PropLog_Opl(x2)),x3,x2) -> c_PropLog_Osat(x1,c_PropLog_Opl_Oop_A_N_62(x0,x3,x2),x2)
% 151.36/151.64  % 5:2:3:INP:TopTopTop: c_in(x0,x1,tc_PropLog_Opl(x2)) -> c_in(x0,c_PropLog_Othms(x1,x2),tc_PropLog_Opl(x2))
% 151.36/151.64  % 6:3:4:INP:TopTopTopTop: c_in(x0,c_PropLog_Othms(x1,x2),tc_PropLog_Opl(x2)),c_in(c_PropLog_Opl_Oop_A_N_62(x0,x3,x2),c_PropLog_Othms(x1,x2),tc_PropLog_Opl(x2)) -> c_in(x3,c_PropLog_Othms(x1,x2),tc_PropLog_Opl(x2))
% 151.36/151.64  % 7:2:4:INP:TopTopTopTop: c_in(x0,c_PropLog_Othms(x1,x2),tc_PropLog_Opl(x2)) -> c_in(x0,c_PropLog_Othms(c_insert(x3,x1,tc_PropLog_Opl(x2)),x2),tc_PropLog_Opl(x2))
% 151.36/151.64  % 8:1:3:INP:TopTopTop:  -> c_in(x0,c_insert(x0,x1,x2),x2)
% 151.36/151.64  
% 151.36/151.64  % Predicates: c_PropLog_Osat c_in 
% 151.36/151.64  % Fol Constants: v_x v_F t_a v_xa 
% 151.36/151.64  % Fol Functions: tc_PropLog_Opl c_insert c_PropLog_Othms c_PropLog_Opl_Oop_A_N_62 
% 151.36/151.64  % Problem Properties:
% 151.36/151.64  % This is a full first-order problem without equality. The Problem is non-linear. 
% 151.36/151.64  
% 151.36/151.64  
% 151.36/151.64  % Reduced Input Axiom Clauses:
% 151.36/151.64  % 4:2:4:INP:TopTopTopTop: c_PropLog_Osat(c_insert(x0,x1,tc_PropLog_Opl(x2)),x3,x2) -> c_PropLog_Osat(x1,c_PropLog_Opl_Oop_A_N_62(x0,x3,x2),x2)
% 151.36/151.64  % 5:2:3:INP:TopTopTop: c_in(x0,x1,tc_PropLog_Opl(x2)) -> c_in(x0,c_PropLog_Othms(x1,x2),tc_PropLog_Opl(x2))
% 151.36/151.64  % 6:3:4:INP:TopTopTopTop: c_in(x0,c_PropLog_Othms(x1,x2),tc_PropLog_Opl(x2)),c_in(c_PropLog_Opl_Oop_A_N_62(x0,x3,x2),c_PropLog_Othms(x1,x2),tc_PropLog_Opl(x2)) -> c_in(x3,c_PropLog_Othms(x1,x2),tc_PropLog_Opl(x2))
% 151.36/151.64  % 7:2:4:INP:TopTopTopTop: c_in(x0,c_PropLog_Othms(x1,x2),tc_PropLog_Opl(x2)) -> c_in(x0,c_PropLog_Othms(c_insert(x3,x1,tc_PropLog_Opl(x2)),x2),tc_PropLog_Opl(x2))
% 151.36/151.64  % 8:1:3:INP:TopTopTop:  -> c_in(x0,c_insert(x0,x1,x2),x2)
% 151.36/151.64  
% 151.36/151.64  % Reduced Input Conjecture Clauses:
% 151.36/151.64  % 1:1:0:INP::  -> c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a)
% 151.36/151.64  % 2:1:0:INP:: c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) -> 
% 151.36/151.64  % 3:2:1:INP:Top: c_PropLog_Osat(v_F,x0,t_a) -> c_in(x0,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
% 151.36/151.64  
% 151.36/151.64  
% 151.36/151.64  % === Starting SPASS-SCL-FOL A Little Less Naive, considering 14 atoms initially. Used heuristic: lmodel_grow ===
% 151.36/151.64  
% 151.36/151.64  
% 151.36/151.64  
% 151.36/151.64  % SZS status Unsatisfiable
% 151.36/151.64  % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 151.36/151.64  
% 151.36/151.64  % SPASS-SCL-FOL Statistics:
% 151.36/151.64  % Number of learned clauses: 19
% 151.36/151.64  % Number of propagations: 32909
% 151.36/151.64  % Number of decisions: 31096
% 151.36/151.64  % Number of resolutions: 26
% 151.36/151.64  % Number of condensations: 0
% 151.36/151.64  % Number of sub resolutions: 0
% 151.36/151.64  
% 151.36/151.64  % Solver is done. Empty clause found
% 151.36/151.64  
% 151.36/151.64  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 151.36/151.64  % SZS output start Proof for theBenchmark
% See solution above
% 151.36/151.66  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 151.36/151.66  
% 151.36/151.66  
% 151.36/151.66  % Needed:       0:2:31.28
% 151.36/151.66  
% 151.36/151.66  % ###
% 151.36/151.66  % ### Pagesize: 8192
% 151.36/151.66  % ### Marksize: 0
% 151.36/151.66  % ### Memory demanded:  200816 KBytes
% 151.36/151.66  % ### Memory freed:     200816 KBytes
% 151.36/151.66  % ### Memory remaining: 0 Bytes
% 151.36/151.66  % ### Pages allocated:  12876 Pages
% 151.36/151.66  % ###
%------------------------------------------------------------------------------