%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL680+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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:10:10 PM UTC 2026
% Result : Theorem 0.09s 0.35s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 13 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 10 ~; 3 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn 0 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(main,conjecture,
~ ? [X1] :
~ ( ~ p1(X1)
| p1(X1) ),
file('theBenchmark.p',main) ).
% NEGATING CONJECTURE
fof(main_nc,negated_conjecture,
? [X1] :
~ ( ~ p1(X1)
| p1(X1) ),
inference(negating_conjecture,[status(cth)],[main]) ).
% FOF SIMPLE INFERENCE
fof(main_nc_elimTB,negated_conjecture,
? [X1] :
~ ( ~ p1(X1)
| p1(X1) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[main_nc])]) ).
% FOF SIMPLE INFERENCE
fof(main_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
? [X1] :
( p1(X1)
& ~ p1(X1) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[main_nc_elimTB]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(main_nc_skol,negated_conjecture,
( p1(skc1)
& ~ p1(skc1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc1]),skolemize(X1,skc1)],[main_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_2,plain,
~ p1(skc1),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
p1(skc1),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_3,plain,
$false,
inference(resolution,[status(thm)],[c_2,c_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL680+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n007.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Fri Sep 4 22:59:24 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.34 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35
% 0.09/0.35 % Input Clauses:
% 0.09/0.35 % 1:1:0:INP:: -> p1(skc1)
% 0.09/0.35 % 2:1:0:INP:: p1(skc1) ->
% 0.09/0.35
% 0.09/0.35 % Predicates: p1
% 0.09/0.35 % Fol Constants: skc1
% 0.09/0.35 % Fol Functions:
% 0.09/0.35 % Problem Properties:
% 0.09/0.35 % This is a first-order ground problem without equality.
% 0.09/0.35
% 0.09/0.35
% 0.09/0.35 % Reduced Input Axiom Clauses:
% 0.09/0.35
% 0.09/0.35 % Reduced Input Conjecture Clauses:
% 0.09/0.35 % 3:0:0:[2.0,1.0]:: ->
% 0.09/0.35 % 2:1:0:INP:: p1(skc1) ->
% 0.09/0.35
% 0.09/0.35 % SZS status Theorem
% 0.09/0.35
% 0.09/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.09/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.09/0.35
% 0.09/0.35 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35
% 0.09/0.35 % SPASS-SCL-FOL Statistics:
% 0.09/0.35 % Number of learned clauses: 0
% 0.09/0.35 % Number of propagations: 0
% 0.09/0.35 % Number of decisions: 0
% 0.09/0.35 % Number of resolutions: 0
% 0.09/0.35 % Number of condensations: 0
% 0.09/0.35 % Number of sub resolutions: 1
% 0.09/0.35
% 0.09/0.35 % Needed: 0:00:00.00
% 0.09/0.35
% 0.09/0.35 % ###
% 0.09/0.35 % ### Pagesize: 8192
% 0.09/0.35 % ### Marksize: 0
% 0.09/0.35 % ### Memory demanded: 63 KBytes
% 0.09/0.35 % ### Memory freed: 63 KBytes
% 0.09/0.35 % ### Memory remaining: 0 Bytes
% 0.09/0.35 % ### Pages allocated: 53 Pages
% 0.09/0.35 % ###
%------------------------------------------------------------------------------