There is no solution for the requested system version SPASS-SCL---0.1.TMO-Non.f, showing result for SPASS-SCL---0.1.1.
%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL043-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n026.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 2.05s 2.32s
% Output : Proof 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 4 RR)
% Number of literals : 10 ( 0 equ; 4 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 : 10 ( 2 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_3,axiom,
is_a_theorem(implies(X0,implies(not(X0),X1))),
file('theBenchmark.p',cn_3) ).
% FILE RECORD
cnf(prove_cn_39,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('theBenchmark.p',prove_cn_39) ).
% FILE RECORD
cnf(cn_18,axiom,
is_a_theorem(implies(X0,implies(X1,X0))),
file('theBenchmark.p',cn_18) ).
% CNF SPASS RESOLUTION.
cnf(c_14,plain,
$false,
inference(resolution,[status(thm)],[condensed_detachment,c_13,cn_3,prove_cn_39,cn_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL043-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.34 % Computer : n026.cluster.edu
% 0.06/0.34 % Model : x86_64 x86_64
% 0.06/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.34 % Memory : 8046.5625MB
% 0.06/0.34 % OS : Linux 6.8.0-71-generic
% 0.06/0.34 % CPULimit : 300
% 0.06/0.34 % WCLimit : 300
% 0.06/0.34 % DateTime : Sat Sep 5 09:26:56 UTC 2026
% 0.06/0.34 % CPUTime :
% 0.06/0.34 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.05/2.32
% 2.05/2.32 % Input Clauses:
% 2.05/2.32 % 1:3:2:INP:TopTop: is_a_theorem(implies(x0,x1)),is_a_theorem(x0) -> is_a_theorem(x1)
% 2.05/2.32 % 2:1:2:INP:TopTop: -> is_a_theorem(implies(x0,implies(not(x0),x1)))
% 2.05/2.32 % 3:1:2:INP:TopTop: -> is_a_theorem(implies(x0,implies(x1,x0)))
% 2.05/2.32 % 4:1:3:INP:TopTopTop: -> is_a_theorem(implies(implies(x0,implies(x1,x2)),implies(x1,implies(x0,x2))))
% 2.05/2.32 % 5:1:3:INP:TopTopTop: -> is_a_theorem(implies(implies(x0,x1),implies(implies(x2,x0),implies(x2,x1))))
% 2.05/2.32 % 6:1:2:INP:TopTop: -> is_a_theorem(implies(implies(x0,x1),implies(implies(not(x0),x1),x1)))
% 2.05/2.32 % 7:1:0:INP:: is_a_theorem(implies(not(not(a)),a)) ->
% 2.05/2.32
% 2.05/2.32 % Predicates: is_a_theorem
% 2.05/2.32 % Fol Constants: a
% 2.05/2.32 % Fol Functions: implies not
% 2.05/2.32 % Problem Properties:
% 2.05/2.32 % This is a full first-order problem without equality. The Problem is non-linear.
% 2.05/2.32
% 2.05/2.32
% 2.05/2.32 % Reduced Input Axiom Clauses:
% 2.05/2.32 % 1:3:2:INP:TopTop: is_a_theorem(implies(x0,x1)),is_a_theorem(x0) -> is_a_theorem(x1)
% 2.05/2.32 % 2:1:2:INP:TopTop: -> is_a_theorem(implies(x0,implies(not(x0),x1)))
% 2.05/2.32 % 3:1:2:INP:TopTop: -> is_a_theorem(implies(x0,implies(x1,x0)))
% 2.05/2.32 % 4:1:3:INP:TopTopTop: -> is_a_theorem(implies(implies(x0,implies(x1,x2)),implies(x1,implies(x0,x2))))
% 2.05/2.32 % 5:1:3:INP:TopTopTop: -> is_a_theorem(implies(implies(x0,x1),implies(implies(x2,x0),implies(x2,x1))))
% 2.05/2.32 % 6:1:2:INP:TopTop: -> is_a_theorem(implies(implies(x0,x1),implies(implies(not(x0),x1),x1)))
% 2.05/2.32
% 2.05/2.32 % Reduced Input Conjecture Clauses:
% 2.05/2.32 % 7:1:0:INP:: is_a_theorem(implies(not(not(a)),a)) ->
% 2.05/2.32
% 2.05/2.32
% 2.05/2.32 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 105 atoms initially. Used heuristic: lcl ===
% 2.05/2.32
% 2.05/2.32
% 2.05/2.32
% 2.05/2.32 % SZS status Unsatisfiable
% 2.05/2.32 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.05/2.32
% 2.05/2.32 % SPASS-SCL-FOL Statistics:
% 2.05/2.32 % Number of learned clauses: 6
% 2.05/2.32 % Number of propagations: 388
% 2.05/2.32 % Number of decisions: 255
% 2.05/2.32 % Number of resolutions: 12
% 2.05/2.32 % Number of condensations: 0
% 2.05/2.32 % Number of sub resolutions: 0
% 2.05/2.32
% 2.05/2.32 % Solver is done. Empty clause found
% 2.05/2.32
% 2.05/2.32 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 2.05/2.32 % SZS output start Proof for theBenchmark
% See solution above
% 2.05/2.32 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 2.05/2.32
% 2.05/2.32
% 2.05/2.32 % Needed: 0:00:01.97
% 2.05/2.32
% 2.05/2.32 % ###
% 2.05/2.32 % ### Pagesize: 8192
% 2.05/2.32 % ### Marksize: 0
% 2.05/2.32 % ### Memory demanded: 24885 KBytes
% 2.05/2.32 % ### Memory freed: 24885 KBytes
% 2.05/2.32 % ### Memory remaining: 0 Bytes
% 2.05/2.32 % ### Pages allocated: 3018 Pages
% 2.05/2.32 % ###
%------------------------------------------------------------------------------