%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL648+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 : n012.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:54 PM UTC 2026
% Result : Theorem 0.02s 0.34s
% Output : Proof 0.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 55 ( 28 ~; 15 |; 12 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn 8 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( p201(X2)
& p101(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ( p201(X2)
& p101(X2) ) ) ),
file('theBenchmark.p',main) ).
% NEGATING CONJECTURE
fof(main_nc,negated_conjecture,
? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( p201(X2)
& p101(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ( p201(X2)
& p101(X2) ) ) ),
inference(negating_conjecture,[status(cth)],[main]) ).
% FOF SIMPLE INFERENCE
fof(main_nc_elimTB,negated_conjecture,
? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( p201(X2)
& p101(X2) ) )
| ! [X3] :
( ~ r1(X1,X3)
| ~ ( p201(X3)
& p101(X3) ) ) ),
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)
| ~ p201(X2)
| ~ p101(X2) )
& ? [X3] :
( r1(X1,X3)
& p201(X3)
& p101(X3) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[main_nc_elimTB]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(main_nc_skol,negated_conjecture,
( ! [X2] :
( ~ r1(skc1,X2)
| ~ p201(X2)
| ~ p101(X2) )
& r1(skc1,skc2)
& p201(skc2)
& p101(skc2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc1,skc2]),skolemize(X1,skc1),skolemize(X3,skc2)],[main_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
( ~ r1(skc1,X0)
| ~ p201(X0)
| ~ p101(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_2,plain,
r1(skc1,skc2),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_3,plain,
p201(skc2),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_4,plain,
p101(skc2),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_5,plain,
$false,
inference(resolution,[status(thm)],[c_1,c_2,c_3,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL648+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.33 % Computer : n012.cluster.edu
% 0.02/0.33 % Model : x86_64 x86_64
% 0.02/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.33 % Memory : 8046.5625MB
% 0.02/0.33 % OS : Linux 6.8.0-71-generic
% 0.02/0.33 % CPULimit : 300
% 0.02/0.33 % WCLimit : 300
% 0.02/0.33 % DateTime : Fri Sep 4 12:26:11 UTC 2026
% 0.02/0.34 % CPUTime :
% 0.02/0.34 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.34
% 0.02/0.34 % Input Clauses:
% 0.02/0.34 % 1:3:1:INP:Top: r1(skc1,x0),p201(x0),p101(x0) ->
% 0.02/0.34 % 2:1:0:INP:: -> r1(skc1,skc2)
% 0.02/0.34 % 3:1:0:INP:: -> p201(skc2)
% 0.02/0.34 % 4:1:0:INP:: -> p101(skc2)
% 0.02/0.34
% 0.02/0.34 % Predicates: r1 p201 p101
% 0.02/0.34 % Fol Constants: skc1 skc2
% 0.02/0.34 % Fol Functions:
% 0.02/0.34 % Problem Properties:
% 0.02/0.34 % This is a Bernays Schoenfinkel problem. The Problem is linear.
% 0.02/0.34
% 0.02/0.34
% 0.02/0.34 % Reduced Input Axiom Clauses:
% 0.02/0.34
% 0.02/0.34 % Reduced Input Conjecture Clauses:
% 0.02/0.34 % 1:3:1:INP:Top: r1(skc1,x0),p201(x0),p101(x0) ->
% 0.02/0.34 % 2:1:0:INP:: -> r1(skc1,skc2)
% 0.02/0.34 % 3:1:0:INP:: -> p201(skc2)
% 0.02/0.34 % 4:1:0:INP:: -> p101(skc2)
% 0.02/0.34
% 0.02/0.34
% 0.02/0.34 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 3 atoms initially. Used heuristic: lmodel_grow ===
% 0.02/0.34
% 0.02/0.34
% 0.02/0.34
% 0.02/0.34 % SZS status Theorem
% 0.02/0.34 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.34
% 0.02/0.34 % SPASS-SCL-FOL Statistics:
% 0.02/0.34 % Number of learned clauses: 0
% 0.02/0.34 % Number of propagations: 3
% 0.02/0.34 % Number of decisions: 0
% 0.02/0.34 % Number of resolutions: 3
% 0.02/0.34 % Number of condensations: 0
% 0.02/0.34 % Number of sub resolutions: 0
% 0.02/0.34
% 0.02/0.34 % Solver is done. Empty clause found
% 0.02/0.34
% 0.02/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.02/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.02/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.02/0.34
% 0.02/0.34
% 0.02/0.34 % Needed: 0:00:00.00
% 0.02/0.34
% 0.02/0.34 % ###
% 0.02/0.34 % ### Pagesize: 8192
% 0.02/0.34 % ### Marksize: 0
% 0.02/0.34 % ### Memory demanded: 224 KBytes
% 0.02/0.34 % ### Memory freed: 224 KBytes
% 0.02/0.34 % ### Memory remaining: 0 Bytes
% 0.02/0.34 % ### Pages allocated: 83 Pages
% 0.02/0.34 % ###
%------------------------------------------------------------------------------