%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL445-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 : n002.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:35 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.38s
% Output : Proof 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 6
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 6 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-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 12 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
% 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) ).
% FILE RECORD
cnf(cls_PropLog_Odeduction_0,axiom,
( ~ c_in(X0,c_PropLog_Othms(c_insert(X1,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(X1,X0,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('theBenchmark.p',cls_PropLog_Odeduction_0) ).
% FILE RECORD
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_q,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file('theBenchmark.p',cls_conjecture_1) ).
% FILE RECORD
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_q,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file('theBenchmark.p',cls_conjecture_0) ).
% FILE RECORD
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('theBenchmark.p',cls_conjecture_2) ).
% FILE RECORD
cnf(cls_PropLog_Othms__excluded__middle_0,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X0,X1,X2),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X0,c_PropLog_Opl_Ofalse,X2),X1,X2),X1,X2),X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)),
file('theBenchmark.p',cls_PropLog_Othms__excluded__middle_0) ).
% CNF SPASS RESOLUTION.
cnf(c_8,plain,
$false,
inference(resolution,[status(thm)],[cls_PropLog_Othms_OMP_0,cls_PropLog_Othms_OMP_0,cls_PropLog_Odeduction_0,cls_PropLog_Odeduction_0,cls_conjecture_1,cls_conjecture_0,cls_conjecture_2,cls_PropLog_Othms__excluded__middle_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL445-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.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 4 21:53:35 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.38
% 0.11/0.38 % Input Clauses:
% 0.11/0.38 % 1:1:0:INP:: -> c_in(v_q,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
% 0.11/0.38 % 2:1:0:INP:: -> c_in(v_q,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
% 0.11/0.38 % 3:1:0:INP:: c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ->
% 0.11/0.38 % 4:2:4:INP:TopTopTopTop: c_in(x0,c_PropLog_Othms(c_insert(x1,x2,tc_PropLog_Opl(x3)),x3),tc_PropLog_Opl(x3)) -> c_in(c_PropLog_Opl_Oop_A_N_62(x1,x0,x3),c_PropLog_Othms(x2,x3),tc_PropLog_Opl(x3))
% 0.11/0.38 % 5: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))
% 0.11/0.38 % 6:1:4:INP:TopTopTopTop: -> c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(x0,x1,x2),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(x0,c_PropLog_Opl_Ofalse,x2),x1,x2),x1,x2),x2),c_PropLog_Othms(x3,x2),tc_PropLog_Opl(x2))
% 0.11/0.38
% 0.11/0.38 % Predicates: c_in
% 0.11/0.38 % Fol Constants: v_q v_p v_H t_a c_PropLog_Opl_Ofalse
% 0.11/0.38 % Fol Functions: tc_PropLog_Opl c_insert c_PropLog_Othms c_PropLog_Opl_Oop_A_N_62
% 0.11/0.38 % Problem Properties:
% 0.11/0.38 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 % Reduced Input Axiom Clauses:
% 0.11/0.38 % 4:2:4:INP:TopTopTopTop: c_in(x0,c_PropLog_Othms(c_insert(x1,x2,tc_PropLog_Opl(x3)),x3),tc_PropLog_Opl(x3)) -> c_in(c_PropLog_Opl_Oop_A_N_62(x1,x0,x3),c_PropLog_Othms(x2,x3),tc_PropLog_Opl(x3))
% 0.11/0.38 % 5: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))
% 0.11/0.38 % 6:1:4:INP:TopTopTopTop: -> c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(x0,x1,x2),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(x0,c_PropLog_Opl_Ofalse,x2),x1,x2),x1,x2),x2),c_PropLog_Othms(x3,x2),tc_PropLog_Opl(x2))
% 0.11/0.38
% 0.11/0.38 % Reduced Input Conjecture Clauses:
% 0.11/0.38 % 1:1:0:INP:: -> c_in(v_q,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
% 0.11/0.38 % 2:1:0:INP:: -> c_in(v_q,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
% 0.11/0.38 % 3:1:0:INP:: c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ->
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 11 atoms initially. Used heuristic: lmodel_grow ===
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 % SZS status Unsatisfiable
% 0.11/0.38 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.38
% 0.11/0.38 % SPASS-SCL-FOL Statistics:
% 0.11/0.38 % Number of learned clauses: 1
% 0.11/0.38 % Number of propagations: 85
% 0.11/0.38 % Number of decisions: 15
% 0.11/0.38 % Number of resolutions: 8
% 0.11/0.38 % Number of condensations: 0
% 0.11/0.38 % Number of sub resolutions: 0
% 0.11/0.38
% 0.11/0.38 % Solver is done. Empty clause found
% 0.11/0.38
% 0.11/0.38 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.11/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.39 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.11/0.39
% 0.11/0.39
% 0.11/0.39 % Needed: 0:00:00.01
% 0.11/0.39
% 0.11/0.39 % ###
% 0.11/0.39 % ### Pagesize: 8192
% 0.11/0.39 % ### Marksize: 0
% 0.11/0.39 % ### Memory demanded: 1310 KBytes
% 0.11/0.39 % ### Memory freed: 1310 KBytes
% 0.11/0.39 % ### Memory remaining: 0 Bytes
% 0.11/0.39 % ### Pages allocated: 231 Pages
% 0.11/0.39 % ###
%------------------------------------------------------------------------------