%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL046-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 : n031.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:51 PM UTC 2026
% Result : Unsatisfiable 15.07s 15.32s
% Output : Proof 15.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 5
% Syntax : Number of clauses : 6 ( 5 unt; 0 nHn; 3 RR)
% Number of literals : 8 ( 0 equ; 3 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 8 ( 1 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_1,axiom,
is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('theBenchmark.p',cn_1) ).
% FILE RECORD
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X0),X0),X0)),
file('theBenchmark.p',cn_2) ).
% FILE RECORD
cnf(prove_cn_16,negated_conjecture,
~ is_a_theorem(implies(a,a)),
file('theBenchmark.p',prove_cn_16) ).
% 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_6,plain,
$false,
inference(resolution,[status(thm)],[condensed_detachment,cn_1,condensed_detachment,cn_2,prove_cn_16,cn_3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL046-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 : n031.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 22:39:40 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
% 15.07/15.32
% 15.07/15.32 % Input Clauses:
% 15.07/15.32 % 1:3:2:INP:TopTop: is_a_theorem(implies(x0,x1)),is_a_theorem(x0) -> is_a_theorem(x1)
% 15.07/15.32 % 2:1:3:INP:TopTopTop: -> is_a_theorem(implies(implies(x0,x1),implies(implies(x1,x2),implies(x0,x2))))
% 15.07/15.32 % 3:1:1:INP:Top: -> is_a_theorem(implies(implies(not(x0),x0),x0))
% 15.07/15.32 % 4:1:2:INP:TopTop: -> is_a_theorem(implies(x0,implies(not(x0),x1)))
% 15.07/15.32 % 5:1:0:INP:: is_a_theorem(implies(a,a)) ->
% 15.07/15.32
% 15.07/15.32 % Predicates: is_a_theorem
% 15.07/15.32 % Fol Constants: a
% 15.07/15.32 % Fol Functions: implies not
% 15.07/15.32 % Problem Properties:
% 15.07/15.32 % This is a full first-order problem without equality. The Problem is non-linear.
% 15.07/15.32
% 15.07/15.32
% 15.07/15.32 % Reduced Input Axiom Clauses:
% 15.07/15.32 % 1:3:2:INP:TopTop: is_a_theorem(implies(x0,x1)),is_a_theorem(x0) -> is_a_theorem(x1)
% 15.07/15.32 % 2:1:3:INP:TopTopTop: -> is_a_theorem(implies(implies(x0,x1),implies(implies(x1,x2),implies(x0,x2))))
% 15.07/15.32 % 3:1:1:INP:Top: -> is_a_theorem(implies(implies(not(x0),x0),x0))
% 15.07/15.32 % 4:1:2:INP:TopTop: -> is_a_theorem(implies(x0,implies(not(x0),x1)))
% 15.07/15.32
% 15.07/15.32 % Reduced Input Conjecture Clauses:
% 15.07/15.32 % 5:1:0:INP:: is_a_theorem(implies(a,a)) ->
% 15.07/15.32
% 15.07/15.32
% 15.07/15.32 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 85 atoms initially. Used heuristic: lcl ===
% 15.07/15.32
% 15.07/15.32
% 15.07/15.32
% 15.07/15.32 % SZS status Unsatisfiable
% 15.07/15.32 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.07/15.32
% 15.07/15.32 % SPASS-SCL-FOL Statistics:
% 15.07/15.32 % Number of learned clauses: 0
% 15.07/15.32 % Number of propagations: 579
% 15.07/15.32 % Number of decisions: 68
% 15.07/15.32 % Number of resolutions: 5
% 15.07/15.32 % Number of condensations: 0
% 15.07/15.32 % Number of sub resolutions: 0
% 15.07/15.32
% 15.07/15.32 % Solver is done. Empty clause found
% 15.07/15.32
% 15.07/15.32 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 15.07/15.32 % SZS output start Proof for theBenchmark
% See solution above
% 15.07/15.32 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 15.07/15.32
% 15.07/15.32
% 15.07/15.32 % Needed: 0:0:14.96
% 15.07/15.32
% 15.07/15.32 % ###
% 15.07/15.32 % ### Pagesize: 8192
% 15.07/15.32 % ### Marksize: 0
% 15.07/15.32 % ### Memory demanded: 26293 KBytes
% 15.07/15.32 % ### Memory freed: 26293 KBytes
% 15.07/15.32 % ### Memory remaining: 0 Bytes
% 15.07/15.32 % ### Pages allocated: 3181 Pages
% 15.07/15.32 % ###
%------------------------------------------------------------------------------