%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL432-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 : n028.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 0.09s 0.36s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 3
% Syntax : Number of clauses : 4 ( 3 unt; 0 nHn; 4 RR)
% Number of literals : 5 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(cls_PropLog_Ocompleteness__0_0,axiom,
( ~ c_PropLog_Osat(c_emptyset,X0,X1)
| c_in(X0,c_PropLog_Othms(c_emptyset,X1),tc_PropLog_Opl(X1)) ),
file('theBenchmark.p',cls_PropLog_Ocompleteness__0_0) ).
% FILE RECORD
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(v_x,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)),
file('theBenchmark.p',cls_conjecture_1) ).
% FILE RECORD
cnf(cls_conjecture_0,negated_conjecture,
c_PropLog_Osat(c_emptyset,v_x,t_a),
file('theBenchmark.p',cls_conjecture_0) ).
% CNF SPASS RESOLUTION.
cnf(c_4,plain,
$false,
inference(resolution,[status(thm)],[cls_PropLog_Ocompleteness__0_0,cls_conjecture_1,cls_conjecture_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL432-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.35 % Computer : n028.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 4 15:51:28 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
% 0.09/0.36
% 0.09/0.36 % Input Clauses:
% 0.09/0.36 % 1:1:0:INP:: -> c_PropLog_Osat(c_emptyset,v_x,t_a)
% 0.09/0.36 % 2:1:0:INP:: c_in(v_x,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)) ->
% 0.09/0.36 % 3:2:2:INP:TopTop: c_PropLog_Osat(c_emptyset,x0,x1) -> c_in(x0,c_PropLog_Othms(c_emptyset,x1),tc_PropLog_Opl(x1))
% 0.09/0.36
% 0.09/0.36 % Predicates: c_PropLog_Osat c_in
% 0.09/0.36 % Fol Constants: c_emptyset v_x t_a
% 0.09/0.36 % Fol Functions: c_PropLog_Othms tc_PropLog_Opl
% 0.09/0.36 % Problem Properties:
% 0.09/0.36 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.09/0.36
% 0.09/0.36
% 0.09/0.36 % Reduced Input Axiom Clauses:
% 0.09/0.36 % 3:2:2:INP:TopTop: c_PropLog_Osat(c_emptyset,x0,x1) -> c_in(x0,c_PropLog_Othms(c_emptyset,x1),tc_PropLog_Opl(x1))
% 0.09/0.36
% 0.09/0.36 % Reduced Input Conjecture Clauses:
% 0.09/0.36 % 1:1:0:INP:: -> c_PropLog_Osat(c_emptyset,v_x,t_a)
% 0.09/0.36 % 2:1:0:INP:: c_in(v_x,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)) ->
% 0.09/0.36
% 0.09/0.36
% 0.09/0.36 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 2 atoms initially. Used heuristic: lmodel_grow ===
% 0.09/0.36
% 0.09/0.36
% 0.09/0.36
% 0.09/0.36 % SZS status Unsatisfiable
% 0.09/0.36 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36
% 0.09/0.36 % SPASS-SCL-FOL Statistics:
% 0.09/0.36 % Number of learned clauses: 0
% 0.09/0.36 % Number of propagations: 2
% 0.09/0.36 % Number of decisions: 0
% 0.09/0.36 % Number of resolutions: 2
% 0.09/0.36 % Number of condensations: 0
% 0.09/0.36 % Number of sub resolutions: 0
% 0.09/0.36
% 0.09/0.36 % Solver is done. Empty clause found
% 0.09/0.36
% 0.09/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.09/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.09/0.36
% 0.09/0.36
% 0.09/0.36 % Needed: 0:00:00.00
% 0.09/0.36
% 0.09/0.36 % ###
% 0.09/0.36 % ### Pagesize: 8192
% 0.09/0.36 % ### Marksize: 0
% 0.09/0.36 % ### Memory demanded: 239 KBytes
% 0.09/0.36 % ### Memory freed: 239 KBytes
% 0.09/0.36 % ### Memory remaining: 0 Bytes
% 0.09/0.36 % ### Pages allocated: 83 Pages
% 0.09/0.36 % ###
%------------------------------------------------------------------------------