%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL230+1 : TPTP v9.3.1. Released v2.0.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:11 PM UTC 2026
% Result : Theorem 0.08s 0.36s
% Output : Proof 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 6 unt; 1 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 48 ( 12 ~; 19 |; 4 &)
% ( 0 <=>; 12 =>; 1 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 5 ( 4 usr; 5 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(pel5,conjecture,
( ( ( p
| q )
=> ( p
| r ) )
=> ( p
| ( q
=> r ) ) ),
file('theBenchmark.p',pel5) ).
% NEGATING CONJECTURE
fof(pel5_nc,negated_conjecture,
~ ( ( ( p
| q )
=> ( p
| r ) )
=> ( p
| ( q
=> r ) ) ),
inference(negating_conjecture,[status(cth)],[pel5]) ).
% FOF SIMPLE INFERENCE
fof(pel5_nc_elimTB,negated_conjecture,
~ ( ( ( p
| q )
=> ( p
| r ) )
=> ( p
| ( q
=> r ) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[pel5_nc])]) ).
% FOF INTRODUCE RENAMING
fof(ren1_defn,definition,
( ren1
<= ( p
| q ) ),
introduced(definition,[new_symbols(definition,[ren1])],[pel5_nc_elimTB]) ).
% FOF RENAMING INFERENCE
fof(pel5_nc_renObv,negated_conjecture,
~ ( ( ren1
=> ( p
| r ) )
=> ( p
| ( q
=> r ) ) ),
inference(renaming,[status(esa)],[pel5_nc_elimTB,ren1_defn]) ).
% FOF SIMPLE INFERENCE
fof(pel5_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
( ( ~ ren1
| p
| r )
& ~ p
& q
& ~ r ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[pel5_nc_renObv]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
q,
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[pel5_nc_elimImpEquivPushNegMiniScope])]) ).
% FOF SIMPLE INFERENCE
fof(ren1_elimImpEquivPushNegMiniScope,plain,
( ( ~ p
& ~ q )
| ren1 ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren1_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_2,plain,
( ~ q
| ren1 ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_7,plain,
ren1,
inference(resolution,[status(thm)],[c_5,c_2]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_3,plain,
( ~ ren1
| p
| r ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[pel5_nc_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_4,plain,
~ p,
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[pel5_nc_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_8,plain,
( p
| r ),
inference(resolution,[status(thm)],[c_7,c_3]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_6,plain,
~ r,
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[pel5_nc_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_9,plain,
r,
inference(resolution,[status(thm)],[c_7,c_3,c_4,c_8]) ).
% CNF SPASS RESOLUTION.
cnf(c_10,plain,
$false,
inference(resolution,[status(thm)],[c_7,c_3,c_4,c_8,c_6,c_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL230+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n002.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 5 13:00:50 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36
% 0.08/0.36 % Input Clauses:
% 0.08/0.36 % 1:2:0:INP:: p -> ren1
% 0.08/0.36 % 2:2:0:INP:: q -> ren1
% 0.08/0.36 % 3:3:0:INP:: ren1 -> p,r
% 0.08/0.36 % 4:1:0:INP:: p ->
% 0.08/0.36 % 5:1:0:INP:: -> q
% 0.08/0.36 % 6:1:0:INP:: r ->
% 0.08/0.36
% 0.08/0.36 % Predicates: p q r ren1
% 0.08/0.36 % Fol Constants: a
% 0.08/0.36 % Fol Functions:
% 0.08/0.36 % Problem Properties:
% 0.08/0.36 % This is a propositional problem.
% 0.08/0.36
% 0.08/0.36
% 0.08/0.36 % Reduced Input Axiom Clauses:
% 0.08/0.36 % 7:1:0:[5.0,2.0]:: -> ren1
% 0.08/0.36
% 0.08/0.36 % Reduced Input Conjecture Clauses:
% 0.08/0.36 % 6:1:0:INP:: r ->
% 0.08/0.36 % 10:0:0:[7.1,3.0,4.0,8.1,6.0,9.2]:: ->
% 0.08/0.36 % 4:1:0:INP:: p ->
% 0.08/0.36 % 5:1:0:INP:: -> q
% 0.08/0.36
% 0.08/0.36 % SZS status Theorem
% 0.08/0.36
% 0.08/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.08/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.08/0.36
% 0.08/0.36 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36
% 0.08/0.36 % SPASS-SCL-FOL Statistics:
% 0.08/0.36 % Number of learned clauses: 0
% 0.08/0.36 % Number of propagations: 0
% 0.08/0.36 % Number of decisions: 0
% 0.08/0.36 % Number of resolutions: 0
% 0.08/0.36 % Number of condensations: 0
% 0.08/0.36 % Number of sub resolutions: 4
% 0.08/0.36
% 0.08/0.36 % Needed: 0:00:00.00
% 0.08/0.36
% 0.08/0.36 % ###
% 0.08/0.36 % ### Pagesize: 8192
% 0.08/0.36 % ### Marksize: 0
% 0.08/0.36 % ### Memory demanded: 72 KBytes
% 0.08/0.36 % ### Memory freed: 72 KBytes
% 0.08/0.36 % ### Memory remaining: 0 Bytes
% 0.08/0.36 % ### Pages allocated: 58 Pages
% 0.08/0.36 % ###
%------------------------------------------------------------------------------