%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL664+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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:02 PM UTC 2026
% Result : Theorem 0.10s 0.36s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 16 ( 9 avg)
% Number of connectives : 134 ( 58 ~; 54 |; 22 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 41 ( 0 sgn 32 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p16(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p14(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p15(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p13(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p11(X2) ) ),
file('theBenchmark.p',main) ).
% NEGATING CONJECTURE
fof(main_nc,negated_conjecture,
? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p16(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p14(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p15(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p13(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p12(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p11(X2) ) ),
inference(negating_conjecture,[status(cth)],[main]) ).
% FOF SIMPLE INFERENCE
fof(main_nc_elimTB,negated_conjecture,
? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p16(X2) )
| ~ ! [X3] :
( ~ r1(X1,X3)
| p12(X3) )
| ~ ! [X4] :
( ~ r1(X1,X4)
| p14(X4) )
| ~ ! [X5] :
( ~ r1(X1,X5)
| p12(X5) )
| ! [X6] :
( ~ r1(X1,X6)
| p15(X6) )
| ! [X7] :
( ~ r1(X1,X7)
| p13(X7) )
| ! [X8] :
( ~ r1(X1,X8)
| p12(X8) )
| ! [X9] :
( ~ r1(X1,X9)
| p11(X9) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[main_nc])]) ).
% FOF SIMPLE INFERENCE
fof(main_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
? [X1] :
( ! [X2] :
( ~ r1(X1,X2)
| p16(X2) )
& ! [X3] :
( ~ r1(X1,X3)
| p12(X3) )
& ! [X4] :
( ~ r1(X1,X4)
| p14(X4) )
& ! [X5] :
( ~ r1(X1,X5)
| p12(X5) )
& ? [X6] :
( r1(X1,X6)
& ~ p15(X6) )
& ? [X7] :
( r1(X1,X7)
& ~ p13(X7) )
& ? [X8] :
( r1(X1,X8)
& ~ p12(X8) )
& ? [X9] :
( r1(X1,X9)
& ~ p11(X9) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[main_nc_elimTB]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(main_nc_skol,negated_conjecture,
( ! [X2] :
( ~ r1(skc1,X2)
| p16(X2) )
& ! [X3] :
( ~ r1(skc1,X3)
| p12(X3) )
& ! [X4] :
( ~ r1(skc1,X4)
| p14(X4) )
& ! [X5] :
( ~ r1(skc1,X5)
| p12(X5) )
& r1(skc1,skc2)
& ~ p15(skc2)
& r1(skc1,skc3)
& ~ p13(skc3)
& r1(skc1,skc4)
& ~ p12(skc4)
& r1(skc1,skc5)
& ~ p11(skc5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc1,skc2,skc3,skc4,skc5]),skolemize(X1,skc1),skolemize(X6,skc2),skolemize(X7,skc3),skolemize(X8,skc4),skolemize(X9,skc5)],[main_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
( ~ r1(skc1,X0)
| p12(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_10,plain,
r1(skc1,skc4),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_11,plain,
~ p12(skc4),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_14,plain,
$false,
inference(resolution,[status(thm)],[c_5,c_10,c_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL664+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n011.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 : Sun Sep 6 01:40:14 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36
% 0.10/0.36 % Input Clauses:
% 0.10/0.36 % 1:1:1:INP:Top: -> r1(x0,x0)
% 0.10/0.36 % 2:2:1:INP:Top: r1(skc1,x0) -> p16(x0)
% 0.10/0.36 % 3:2:1:INP:Top: r1(skc1,x0) -> p12(x0)
% 0.10/0.36 % 4:2:1:INP:Top: r1(skc1,x0) -> p14(x0)
% 0.10/0.36 % 5:2:1:INP:Top: r1(skc1,x0) -> p12(x0)
% 0.10/0.36 % 6:1:0:INP:: -> r1(skc1,skc2)
% 0.10/0.36 % 7:1:0:INP:: p15(skc2) ->
% 0.10/0.36 % 8:1:0:INP:: -> r1(skc1,skc3)
% 0.10/0.36 % 9:1:0:INP:: p13(skc3) ->
% 0.10/0.36 % 10:1:0:INP:: -> r1(skc1,skc4)
% 0.10/0.36 % 11:1:0:INP:: p12(skc4) ->
% 0.10/0.36 % 12:1:0:INP:: -> r1(skc1,skc5)
% 0.10/0.36 % 13:1:0:INP:: p11(skc5) ->
% 0.10/0.36
% 0.10/0.36 % Predicates: r1 p16 p12 p14 p15 p13 p11
% 0.10/0.36 % Fol Constants: skc1 skc2 skc3 skc4 skc5
% 0.10/0.36 % Fol Functions:
% 0.10/0.36 % Problem Properties:
% 0.10/0.36 % This is a Bernays Schoenfinkel problem. The Problem is non-linear.
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36 % Reduced Input Axiom Clauses:
% 0.10/0.36 % 1:1:1:INP:Top: -> r1(x0,x0)
% 0.10/0.36
% 0.10/0.36 % Reduced Input Conjecture Clauses:
% 0.10/0.36 % 2:2:1:INP:Top: r1(skc1,x0) -> p16(x0)
% 0.10/0.36 % 13:1:0:INP:: p11(skc5) ->
% 0.10/0.36 % 4:2:1:INP:Top: r1(skc1,x0) -> p14(x0)
% 0.10/0.36 % 5:2:1:INP:Top: r1(skc1,x0) -> p12(x0)
% 0.10/0.36 % 6:1:0:INP:: -> r1(skc1,skc2)
% 0.10/0.36 % 7:1:0:INP:: p15(skc2) ->
% 0.10/0.36 % 8:1:0:INP:: -> r1(skc1,skc3)
% 0.10/0.36 % 9:1:0:INP:: p13(skc3) ->
% 0.10/0.36 % 10:1:0:INP:: -> r1(skc1,skc4)
% 0.10/0.36 % 11:1:0:INP:: p12(skc4) ->
% 0.10/0.36 % 12:1:0:INP:: -> r1(skc1,skc5)
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 15 atoms initially. Used heuristic: lmodel_grow ===
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36 % SZS status Theorem
% 0.10/0.36 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36
% 0.10/0.36 % SPASS-SCL-FOL Statistics:
% 0.10/0.36 % Number of learned clauses: 0
% 0.10/0.36 % Number of propagations: 2
% 0.10/0.36 % Number of decisions: 0
% 0.10/0.36 % Number of resolutions: 2
% 0.10/0.36 % Number of condensations: 0
% 0.10/0.36 % Number of sub resolutions: 0
% 0.10/0.36
% 0.10/0.36 % Solver is done. Empty clause found
% 0.10/0.36
% 0.10/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.10/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36 % Needed: 0:00:00.00
% 0.10/0.36
% 0.10/0.36 % ###
% 0.10/0.36 % ### Pagesize: 8192
% 0.10/0.36 % ### Marksize: 0
% 0.10/0.36 % ### Memory demanded: 254 KBytes
% 0.10/0.36 % ### Memory freed: 254 KBytes
% 0.10/0.36 % ### Memory remaining: 0 Bytes
% 0.10/0.36 % ### Pages allocated: 97 Pages
% 0.10/0.36 % ###
%------------------------------------------------------------------------------