%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL644+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 : n027.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:52 PM UTC 2026
% Result : Theorem 0.13s 0.36s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 3 unt; 5 def)
% Number of atoms : 269 ( 0 equ)
% Maximal formula atoms : 53 ( 19 avg)
% Number of connectives : 413 ( 158 ~; 170 |; 80 &)
% ( 0 <=>; 0 =>; 5 <=; 0 <~>)
% Maximal formula depth : 24 ( 12 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 106 ( 0 sgn 94 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ! [X2] :
( ~ r1(X1,X2)
| p2(X2) ) )
| p1(X1) )
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
& ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2)
| ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ ( p1(X1)
& ! [X2] :
( ~ r1(X1,X2)
| p1(X2) )
& p1(X1) ) ) )
& ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2)
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) ) ),
file('theBenchmark.p',main) ).
% NEGATING CONJECTURE
fof(main_nc,negated_conjecture,
? [X1] :
~ ( ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ! [X2] :
( ~ r1(X1,X2)
| p2(X2) ) )
| p1(X1) )
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
& ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2)
| ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ ( p1(X1)
& ! [X2] :
( ~ r1(X1,X2)
| p1(X2) )
& p1(X1) ) ) )
& ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2)
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) ) ),
inference(negating_conjecture,[status(cth)],[main]) ).
% FOF SIMPLE INFERENCE
fof(main_nc_elimTB,negated_conjecture,
? [X1] :
~ ( ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X3] :
( ~ r1(X2,X3)
| p2(X3) ) )
| p1(X2) )
| ! [X4] :
( ~ r1(X1,X4)
| p2(X4)
| ~ ( p1(X4)
& ! [X5] :
( ~ r1(X4,X5)
| p1(X5) )
& p1(X4) ) )
| ~ ( ! [X6] :
( ~ r1(X1,X6)
| ! [X7] :
( ~ r1(X6,X7)
| ~ ( p2(X7)
& ! [X8] :
( ~ r1(X7,X8)
| p2(X8) ) )
| p1(X7) )
| p2(X6)
| ~ ( p1(X6)
& ! [X9] :
( ~ r1(X6,X9)
| p1(X9) )
& p1(X6) ) )
& ! [X10] :
( ~ r1(X1,X10)
| ~ ( p2(X10)
& ! [X11] :
( ~ r1(X10,X11)
| p2(X11) ) )
| p1(X10)
| ! [X12] :
( ~ r1(X10,X12)
| p2(X12)
| ~ ( p1(X12)
& ! [X13] :
( ~ r1(X12,X13)
| p1(X13) )
& p1(X12) ) ) )
& ! [X14] :
( ~ r1(X1,X14)
| ~ ( p2(X14)
& ! [X15] :
( ~ r1(X14,X15)
| p2(X15) ) )
| p1(X14)
| p2(X14)
| ~ ( p1(X14)
& ! [X16] :
( ~ r1(X14,X16)
| p1(X16) )
& p1(X14) ) ) ) )
| ! [X17] :
( ~ r1(X1,X17)
| p1(X17)
| ~ ( ! [X18] :
( ~ r1(X17,X18)
| p1(X18) )
& p1(X17) ) )
| ! [X19] :
( ~ r1(X1,X19)
| p1(X19)
| ~ ( ! [X20] :
( ~ r1(X19,X20)
| p1(X20) )
& p1(X19) ) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[main_nc])]) ).
% FOF INTRODUCE RENAMING
fof(ren1_defn,definition,
! [X2,X3] :
( ren1(X2,X3)
<= ( ~ r1(X2,X3)
| p2(X3) ) ),
introduced(definition,[new_symbols(definition,[ren1])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren2_defn,definition,
! [X4,X5] :
( ren2(X4,X5)
<= ( ~ r1(X4,X5)
| p1(X5) ) ),
introduced(definition,[new_symbols(definition,[ren2])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren3_defn,definition,
! [X1,X6] :
( ren3(X1,X6)
<= ( ~ r1(X1,X6)
| ! [X7] :
( ~ r1(X6,X7)
| ~ ( p2(X7)
& ! [X8] :
( ~ r1(X7,X8)
| p2(X8) ) )
| p1(X7) )
| p2(X6)
| ~ ( p1(X6)
& ! [X9] :
( ~ r1(X6,X9)
| p1(X9) )
& p1(X6) ) ) ),
introduced(definition,[new_symbols(definition,[ren3])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren4_defn,definition,
! [X1,X10] :
( ren4(X1,X10)
<= ( ~ r1(X1,X10)
| ~ ( p2(X10)
& ! [X11] :
( ~ r1(X10,X11)
| p2(X11) ) )
| p1(X10)
| ! [X12] :
( ~ r1(X10,X12)
| p2(X12)
| ~ ( p1(X12)
& ! [X13] :
( ~ r1(X12,X13)
| p1(X13) )
& p1(X12) ) ) ) ),
introduced(definition,[new_symbols(definition,[ren4])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren5_defn,definition,
! [X1,X14] :
( ren5(X1,X14)
<= ( ~ r1(X1,X14)
| ~ ( p2(X14)
& ! [X15] :
( ~ r1(X14,X15)
| p2(X15) ) )
| p1(X14)
| p2(X14)
| ~ ( p1(X14)
& ! [X16] :
( ~ r1(X14,X16)
| p1(X16) )
& p1(X14) ) ) ),
introduced(definition,[new_symbols(definition,[ren5])],[main_nc_elimTB]) ).
% FOF RENAMING INFERENCE
fof(main_nc_renObv,negated_conjecture,
? [X1] :
~ ( ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X3] : ren1(X2,X3) )
| p1(X2) )
| ! [X4] :
( ~ r1(X1,X4)
| p2(X4)
| ~ ( p1(X4)
& ! [X5] : ren2(X4,X5)
& p1(X4) ) )
| ~ ( ! [X6] : ren3(X1,X6)
& ! [X10] : ren4(X1,X10)
& ! [X14] : ren5(X1,X14) ) )
| ! [X17] :
( ~ r1(X1,X17)
| p1(X17)
| ~ ( ! [X18] :
( ~ r1(X17,X18)
| p1(X18) )
& p1(X17) ) )
| ! [X19] :
( ~ r1(X1,X19)
| p1(X19)
| ~ ( ! [X20] :
( ~ r1(X19,X20)
| p1(X20) )
& p1(X19) ) ) ),
inference(renaming,[status(esa)],[main_nc_elimTB,ren1_defn,ren2_defn,ren3_defn,ren4_defn,ren5_defn]) ).
% FOF SIMPLE INFERENCE
fof(main_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
? [X1] :
( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p2(X2)
| ? [X3] : ~ ren1(X2,X3)
| p1(X2) )
| ! [X4] :
( ~ r1(X1,X4)
| p2(X4)
| ~ p1(X4)
| ? [X5] : ~ ren2(X4,X5)
| ~ p1(X4) )
| ? [X6] : ~ ren3(X1,X6)
| ? [X7] : ~ ren4(X1,X7)
| ? [X8] : ~ ren5(X1,X8) )
& ? [X9] :
( r1(X1,X9)
& ~ p1(X9)
& ! [X10] :
( ~ r1(X9,X10)
| p1(X10) )
& p1(X9) )
& ? [X11] :
( r1(X1,X11)
& ~ p1(X11)
& ! [X12] :
( ~ r1(X11,X12)
| p1(X12) )
& p1(X11) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[main_nc_renObv]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(main_nc_skol,negated_conjecture,
( ( ! [X2] :
( ~ r1(skc3,X2)
| ~ p2(X2)
| ~ ren1(X2,skf4(X2))
| p1(X2) )
| ! [X4] :
( ~ r1(skc3,X4)
| p2(X4)
| ~ p1(X4)
| ~ ren2(X4,skf5(X4))
| ~ p1(X4) )
| ~ ren3(skc3,skc6)
| ~ ren4(skc3,skc7)
| ~ ren5(skc3,skc8) )
& r1(skc3,skc9)
& ~ p1(skc9)
& ! [X10] :
( ~ r1(skc9,X10)
| p1(X10) )
& p1(skc9)
& r1(skc3,skc10)
& ~ p1(skc10)
& ! [X12] :
( ~ r1(skc10,X12)
| p1(X12) )
& p1(skc10) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc3,skf4,skf5,skc6,skc7,skc8,skc9,skc10]),skolemize(X1,skc3),skolemize(X3,skf4(X2)),skolemize(X5,skf5(X4)),skolemize(X6,skc6),skolemize(X7,skc7),skolemize(X8,skc8),skolemize(X9,skc9),skolemize(X11,skc10)],[main_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_39,plain,
p1(skc10),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_37,plain,
~ p1(skc10),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_44,plain,
$false,
inference(resolution,[status(thm)],[c_39,c_37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL644+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.09/0.35 % Computer : n027.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 5 05:03:43 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36
% 0.13/0.36 % Input Clauses:
% 0.13/0.36 % 1:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1)
% 0.13/0.36 % 2:2:2:INP:TopTop: p2(x0) -> ren1(x1,x0)
% 0.13/0.36 % 3:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1)
% 0.13/0.36 % 4:2:2:INP:TopTop: p1(x0) -> ren2(x1,x0)
% 0.13/0.36 % 5:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1)
% 0.13/0.36 % 6:2:2:INP:TopTop: -> r1(x0,skf1(x0)),ren3(x1,x0)
% 0.13/0.36 % 7:2:2:INP:TopTop: -> p2(skf1(x0)),ren3(x1,x0)
% 0.13/0.36 % 8:3:3:INP:TopTopTop: r1(skf1(x0),x1) -> p2(x1),ren3(x2,x0)
% 0.13/0.36 % 9:2:2:INP:TopTop: p1(skf1(x0)) -> ren3(x1,x0)
% 0.13/0.36 % 10:2:2:INP:TopTop: p2(x0) -> ren3(x1,x0)
% 0.13/0.36 % 11:2:2:INP:TopTop: -> p1(x0),ren3(x1,x0)
% 0.13/0.36 % 12:3:3:INP:TopTopTop: r1(x0,x1) -> p1(x1),ren3(x2,x0)
% 0.13/0.36 % 13:2:2:INP:TopTop: -> p1(x0),ren3(x1,x0)
% 0.13/0.36 % 14:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1)
% 0.13/0.36 % 15:2:2:INP:TopTop: -> p2(x0),ren4(x1,x0)
% 0.13/0.36 % 16:3:3:INP:TopTopTop: r1(x0,x1) -> p2(x1),ren4(x2,x0)
% 0.13/0.36 % 17:2:2:INP:TopTop: p1(x0) -> ren4(x1,x0)
% 0.13/0.36 % 18:2:2:INP:TopTop: -> r1(x0,skf2(x0)),ren4(x1,x0)
% 0.13/0.36 % 19:2:2:INP:TopTop: p2(skf2(x0)) -> ren4(x1,x0)
% 0.13/0.36 % 20:2:2:INP:TopTop: -> p1(skf2(x0)),ren4(x1,x0)
% 0.13/0.36 % 21:3:3:INP:TopTopTop: r1(skf2(x0),x1) -> p1(x1),ren4(x2,x0)
% 0.13/0.36 % 22:2:2:INP:TopTop: -> p1(skf2(x0)),ren4(x1,x0)
% 0.13/0.36 % 23:2:2:INP:TopTop: -> r1(x0,x1),ren5(x0,x1)
% 0.13/0.36 % 24:2:2:INP:TopTop: -> p2(x0),ren5(x1,x0)
% 0.13/0.36 % 25:3:3:INP:TopTopTop: r1(x0,x1) -> p2(x1),ren5(x2,x0)
% 0.13/0.36 % 26:2:2:INP:TopTop: p1(x0) -> ren5(x1,x0)
% 0.13/0.36 % 27:2:2:INP:TopTop: p2(x0) -> ren5(x1,x0)
% 0.13/0.36 % 28:2:2:INP:TopTop: -> p1(x0),ren5(x1,x0)
% 0.13/0.36 % 29:3:3:INP:TopTopTop: r1(x0,x1) -> p1(x1),ren5(x2,x0)
% 0.13/0.36 % 30:2:2:INP:TopTop: -> p1(x0),ren5(x1,x0)
% 0.13/0.36 % 31:12:2:INP:TopTop: r1(skc3,x0),p2(x0),ren1(x0,skf4(x0)),r1(skc3,x1),p1(x1),ren2(x1,skf5(x1)),p1(x1),ren3(skc3,skc6),ren4(skc3,skc7),ren5(skc3,skc8) -> p1(x0),p2(x1)
% 0.13/0.36 % 32:1:0:INP:: -> r1(skc3,skc9)
% 0.13/0.36 % 33:1:0:INP:: p1(skc9) ->
% 0.13/0.36 % 34:2:1:INP:Top: r1(skc9,x0) -> p1(x0)
% 0.13/0.36 % 35:1:0:INP:: -> p1(skc9)
% 0.13/0.36 % 36:1:0:INP:: -> r1(skc3,skc10)
% 0.13/0.36 % 37:1:0:INP:: p1(skc10) ->
% 0.13/0.36 % 38:2:1:INP:Top: r1(skc10,x0) -> p1(x0)
% 0.13/0.36 % 39:1:0:INP:: -> p1(skc10)
% 0.13/0.36
% 0.13/0.36 % Predicates: r1 p2 p1 ren1 ren2 ren3 ren4 ren5
% 0.13/0.36 % Fol Constants: skc3 skc6 skc7 skc8 skc9 skc10
% 0.13/0.36 % Fol Functions: skf1 skf2 skf4 skf5
% 0.13/0.36 % Problem Properties:
% 0.13/0.36 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 % Reduced Input Axiom Clauses:
% 0.13/0.36 % 1:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1)
% 0.13/0.36 % 2:2:2:INP:TopTop: p2(x0) -> ren1(x1,x0)
% 0.13/0.36 % 3:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1)
% 0.13/0.36 % 4:2:2:INP:TopTop: p1(x0) -> ren2(x1,x0)
% 0.13/0.36 % 5:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1)
% 0.13/0.36 % 6:2:2:INP:TopTop: -> r1(x0,skf1(x0)),ren3(x1,x0)
% 0.13/0.36 % 7:2:2:INP:TopTop: -> p2(skf1(x0)),ren3(x1,x0)
% 0.13/0.36 % 8:3:3:INP:TopTopTop: r1(skf1(x0),x1) -> p2(x1),ren3(x2,x0)
% 0.13/0.36 % 9:2:2:INP:TopTop: p1(skf1(x0)) -> ren3(x1,x0)
% 0.13/0.36 % 10:2:2:INP:TopTop: p2(x0) -> ren3(x1,x0)
% 0.13/0.36 % 12:3:3:INP:TopTopTop: r1(x0,x1) -> p1(x1),ren3(x2,x0)
% 0.13/0.36 % 13:2:2:INP:TopTop: -> p1(x0),ren3(x1,x0)
% 0.13/0.36 % 14:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1)
% 0.13/0.36 % 15:2:2:INP:TopTop: -> p2(x0),ren4(x1,x0)
% 0.13/0.36 % 16:3:3:INP:TopTopTop: r1(x0,x1) -> p2(x1),ren4(x2,x0)
% 0.13/0.36 % 17:2:2:INP:TopTop: p1(x0) -> ren4(x1,x0)
% 0.13/0.36 % 18:2:2:INP:TopTop: -> r1(x0,skf2(x0)),ren4(x1,x0)
% 0.13/0.36 % 19:2:2:INP:TopTop: p2(skf2(x0)) -> ren4(x1,x0)
% 0.13/0.36 % 21:3:3:INP:TopTopTop: r1(skf2(x0),x1) -> p1(x1),ren4(x2,x0)
% 0.13/0.36 % 22:2:2:INP:TopTop: -> p1(skf2(x0)),ren4(x1,x0)
% 0.13/0.36 % 23:2:2:INP:TopTop: -> r1(x0,x1),ren5(x0,x1)
% 0.13/0.36 % 40:1:2:[27.0,24.0]:TopTop: -> ren5(x0,x1)
% 0.13/0.36 % 41:1:2:[28.0,26.0]:TopTop: -> ren5(x0,x1)
% 0.13/0.36
% 0.13/0.36 % Reduced Input Conjecture Clauses:
% 0.13/0.36 % 39:1:0:INP:: -> p1(skc10)
% 0.13/0.36 % 38:2:1:INP:Top: r1(skc10,x0) -> p1(x0)
% 0.13/0.36 % 44:0:0:[39.0,37.0]:: ->
% 0.13/0.36 % 36:1:0:INP:: -> r1(skc3,skc10)
% 0.13/0.36 % 35:1:0:INP:: -> p1(skc9)
% 0.13/0.36 % 34:2:1:INP:Top: r1(skc9,x0) -> p1(x0)
% 0.13/0.36 % 43:0:0:[35.0,33.0]:: ->
% 0.13/0.36 % 42:10:2:[41.1,31.8]:TopTop: r1(skc3,x0),p2(x0),ren1(x0,skf4(x0)),r1(skc3,x1),ren2(x1,skf5(x1)),p1(x1),ren3(skc3,skc6),ren4(skc3,skc7) -> p1(x0),p2(x1)
% 0.13/0.36 % 32:1:0:INP:: -> r1(skc3,skc9)
% 0.13/0.36
% 0.13/0.36 % SZS status Theorem
% 0.13/0.36
% 0.13/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.36
% 0.13/0.36 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36
% 0.13/0.36 % SPASS-SCL-FOL Statistics:
% 0.13/0.36 % Number of learned clauses: 0
% 0.13/0.36 % Number of propagations: 0
% 0.13/0.36 % Number of decisions: 0
% 0.13/0.36 % Number of resolutions: 0
% 0.13/0.36 % Number of condensations: 0
% 0.13/0.36 % Number of sub resolutions: 5
% 0.13/0.36
% 0.13/0.36 % Needed: 0:00:00.00
% 0.13/0.36
% 0.13/0.36 % ###
% 0.13/0.36 % ### Pagesize: 8192
% 0.13/0.36 % ### Marksize: 0
% 0.13/0.36 % ### Memory demanded: 175 KBytes
% 0.13/0.36 % ### Memory freed: 175 KBytes
% 0.13/0.36 % ### Memory remaining: 0 Bytes
% 0.13/0.36 % ### Pages allocated: 97 Pages
% 0.13/0.36 % ###
%------------------------------------------------------------------------------