%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL638+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 : n018.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:50 PM UTC 2026
% Result : Theorem 0.64s 0.98s
% Output : Proof 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 4 unt; 5 def)
% Number of atoms : 218 ( 0 equ)
% Maximal formula atoms : 31 ( 8 avg)
% Number of connectives : 426 ( 235 ~; 154 |; 32 &)
% ( 0 <=>; 0 =>; 5 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-1 aty)
% Number of variables : 151 ( 4 sgn 118 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
& ~ p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) ) )
& ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| $false ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) ),
file('theBenchmark.p',main) ).
% NEGATING CONJECTURE
fof(main_nc,negated_conjecture,
? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
& ~ p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) ) )
& ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| $false ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) ),
inference(negating_conjecture,[status(cth)],[main]) ).
% FOF SIMPLE INFERENCE
fof(main_nc_elimTB,negated_conjecture,
? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X3] :
( ~ r1(X2,X3)
| ~ ! [X4] :
( ~ r1(X3,X4)
| p1(X4) ) )
& ~ p1(X2) ) )
| ~ ! [X5] :
( ~ r1(X1,X5)
| ~ ( ~ ! [X6] :
( ~ r1(X5,X6)
| ~ ! [X7] :
( ~ r1(X6,X7)
| ~ p1(X7) ) )
& p1(X5) ) )
| ~ ! [X8] :
( ~ r1(X1,X8)
| ~ ( ~ ! [X9] :
( ~ r1(X8,X9)
| ! [X10] :
( ~ r1(X9,X10)
| ~ ! [X11] :
( ~ r1(X10,X11)
| ~ p1(X11) ) ) )
& ! [X12] :
( ~ r1(X8,X12)
| ~ ! [X13] :
( ~ r1(X12,X13)
| ~ p1(X13) ) ) ) )
| ~ ! [X14] :
( ~ r1(X1,X14)
| ~ ( ~ ! [X15] :
( ~ r1(X14,X15)
| ! [X16] :
( ~ r1(X15,X16)
| p1(X16) ) )
& ! [X17] :
( ~ r1(X14,X17)
| p1(X17) ) ) )
| ~ ! [X18] :
( ~ r1(X1,X18)
| ~ ! [X19] : ~ r1(X18,X19) )
| ! [X20] :
( ~ r1(X1,X20)
| p1(X20)
| ~ ! [X21] :
( ~ r1(X20,X21)
| p1(X21) ) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[main_nc])]) ).
% FOF INTRODUCE RENAMING
fof(ren1_defn,definition,
! [X3,X4] :
( ren1(X3,X4)
<= ( ~ r1(X3,X4)
| p1(X4) ) ),
introduced(definition,[new_symbols(definition,[ren1])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren2_defn,definition,
! [X6,X7] :
( ren2(X6,X7)
<= ( ~ r1(X6,X7)
| ~ p1(X7) ) ),
introduced(definition,[new_symbols(definition,[ren2])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren3_defn,definition,
! [X10,X11] :
( ren3(X10,X11)
<= ( ~ r1(X10,X11)
| ~ p1(X11) ) ),
introduced(definition,[new_symbols(definition,[ren3])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren4_defn,definition,
! [X8,X12] :
( ren4(X8,X12)
<= ( ~ r1(X8,X12)
| ~ ! [X13] :
( ~ r1(X12,X13)
| ~ p1(X13) ) ) ),
introduced(definition,[new_symbols(definition,[ren4])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren5_defn,definition,
! [X14,X17] :
( ren5(X14,X17)
<= ( ~ r1(X14,X17)
| p1(X17) ) ),
introduced(definition,[new_symbols(definition,[ren5])],[main_nc_elimTB]) ).
% FOF RENAMING INFERENCE
fof(main_nc_renObv,negated_conjecture,
? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X3] :
( ~ r1(X2,X3)
| ~ ! [X4] : ren1(X3,X4) )
& ~ p1(X2) ) )
| ~ ! [X5] :
( ~ r1(X1,X5)
| ~ ( ~ ! [X6] :
( ~ r1(X5,X6)
| ~ ! [X7] : ren2(X6,X7) )
& p1(X5) ) )
| ~ ! [X8] :
( ~ r1(X1,X8)
| ~ ( ~ ! [X9] :
( ~ r1(X8,X9)
| ! [X10] :
( ~ r1(X9,X10)
| ~ ! [X11] : ren3(X10,X11) ) )
& ! [X12] : ren4(X8,X12) ) )
| ~ ! [X14] :
( ~ r1(X1,X14)
| ~ ( ~ ! [X15] :
( ~ r1(X14,X15)
| ! [X16] :
( ~ r1(X15,X16)
| p1(X16) ) )
& ! [X17] : ren5(X14,X17) ) )
| ~ ! [X18] :
( ~ r1(X1,X18)
| ~ ! [X19] : ~ r1(X18,X19) )
| ! [X20] :
( ~ r1(X1,X20)
| p1(X20)
| ~ ! [X21] :
( ~ r1(X20,X21)
| p1(X21) ) ) ),
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)
| ! [X3] :
( ~ r1(X2,X3)
| ? [X4] : ~ ren1(X3,X4) )
| p1(X2) )
& ! [X5] :
( ~ r1(X1,X5)
| ! [X6] :
( ~ r1(X5,X6)
| ? [X7] : ~ ren2(X6,X7) )
| ~ p1(X5) )
& ! [X8] :
( ~ r1(X1,X8)
| ! [X9] :
( ~ r1(X8,X9)
| ! [X10] :
( ~ r1(X9,X10)
| ? [X11] : ~ ren3(X10,X11) ) )
| ? [X12] : ~ ren4(X8,X12) )
& ! [X13] :
( ~ r1(X1,X13)
| ! [X14] :
( ~ r1(X13,X14)
| ! [X15] :
( ~ r1(X14,X15)
| p1(X15) ) )
| ? [X16] : ~ ren5(X13,X16) )
& ! [X17] :
( ~ r1(X1,X17)
| ? [X18] : r1(X17,X18) )
& ? [X19] :
( r1(X1,X19)
& ~ p1(X19)
& ! [X20] :
( ~ r1(X19,X20)
| p1(X20) ) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[main_nc_renObv]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(main_nc_skol,negated_conjecture,
( ! [X2] :
( ~ r1(skc1,X2)
| ! [X3] :
( ~ r1(X2,X3)
| ~ ren1(X3,skf2(X3)) )
| p1(X2) )
& ! [X5] :
( ~ r1(skc1,X5)
| ! [X6] :
( ~ r1(X5,X6)
| ~ ren2(X6,skf3(X6)) )
| ~ p1(X5) )
& ! [X8] :
( ~ r1(skc1,X8)
| ! [X9] :
( ~ r1(X8,X9)
| ! [X10] :
( ~ r1(X9,X10)
| ~ ren3(X10,skf4(X10)) ) )
| ~ ren4(X8,skf5(X8)) )
& ! [X13] :
( ~ r1(skc1,X13)
| ! [X14] :
( ~ r1(X13,X14)
| ! [X15] :
( ~ r1(X14,X15)
| p1(X15) ) )
| ~ ren5(X13,skf6(X13)) )
& ! [X17] :
( ~ r1(skc1,X17)
| r1(X17,skf7(X17)) )
& r1(skc1,skc8)
& ~ p1(skc8)
& ! [X20] :
( ~ r1(skc8,X20)
| p1(X20) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc1,skf2,skf3,skf4,skf5,skf6,skf7,skc8]),skolemize(X1,skc1),skolemize(X4,skf2(X3)),skolemize(X7,skf3(X6)),skolemize(X11,skf4(X10)),skolemize(X12,skf5(X8)),skolemize(X16,skf6(X13)),skolemize(X18,skf7(X17)),skolemize(X19,skc8)],[main_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_14,plain,
( ~ r1(skc1,X0)
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ ren5(X0,skf6(X0))
| p1(X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF SIMPLE INFERENCE
fof(ren1_elimImpEquivPushNegMiniScope,plain,
! [X1,X2] :
( ( r1(X1,X2)
& ~ p1(X2) )
| ren1(X1,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren1_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_2,plain,
( ~ p1(X0)
| ren1(X1,X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_63,plain,
( ~ r1(skc1,X0)
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ ren5(X0,skf6(X0))
| ren1(X3,X2) ),
inference(resolution,[status(thm)],[c_14,c_2]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
( r1(X0,X1)
| ren1(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_18,plain,
( ~ r1(skc8,X0)
| p1(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF SIMPLE INFERENCE
fof(ren5_elimImpEquivPushNegMiniScope,plain,
! [X1,X2] :
( ( r1(X1,X2)
& ~ p1(X2) )
| ren5(X1,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren5_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_9,plain,
( r1(X0,X1)
| ren5(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren5_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_10,plain,
( ~ p1(X0)
| ren5(X1,X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren5_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_23,plain,
ren5(skc8,X0),
inference(resolution,[status(thm)],[c_18,c_9,c_10]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_11,plain,
( ~ r1(skc1,X0)
| ~ r1(X0,X1)
| ~ ren1(X1,skf2(X1))
| p1(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_17,plain,
~ p1(skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_16,plain,
r1(skc1,skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_40,plain,
( ~ r1(skc8,X0)
| ~ ren1(X0,skf2(X0)) ),
inference(resolution,[status(thm)],[c_11,c_17,c_16]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_15,plain,
( ~ r1(skc1,X0)
| r1(X0,skf7(X0)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_64,plain,
$false,
inference(resolution,[status(thm)],[c_63,c_1,c_23,c_40,c_15,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL638+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n018.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 : Fri Sep 4 19:40:17 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.98
% 0.64/0.98 % Input Clauses:
% 0.64/0.98 % 1:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1)
% 0.64/0.98 % 2:2:2:INP:TopTop: p1(x0) -> ren1(x1,x0)
% 0.64/0.98 % 3:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1)
% 0.64/0.98 % 4:2:2:INP:TopTop: -> p1(x0),ren2(x1,x0)
% 0.64/0.98 % 5:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1)
% 0.64/0.98 % 6:2:2:INP:TopTop: -> p1(x0),ren3(x1,x0)
% 0.64/0.98 % 7:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1)
% 0.64/0.98 % 8:3:3:INP:TopTopTop: r1(x0,x1),p1(x1) -> ren4(x2,x0)
% 0.64/0.98 % 9:2:2:INP:TopTop: -> r1(x0,x1),ren5(x0,x1)
% 0.64/0.98 % 10:2:2:INP:TopTop: p1(x0) -> ren5(x1,x0)
% 0.64/0.98 % 11:4:2:INP:TopTop: r1(skc1,x0),r1(x0,x1),ren1(x1,skf2(x1)) -> p1(x0)
% 0.64/0.98 % 12:4:2:INP:TopTop: r1(skc1,x0),r1(x0,x1),ren2(x1,skf3(x1)),p1(x0) ->
% 0.64/0.98 % 13:5:3:INP:TopTopTop: r1(skc1,x0),r1(x0,x1),r1(x1,x2),ren3(x2,skf4(x2)),ren4(x0,skf5(x0)) ->
% 0.64/0.98 % 14:5:3:INP:TopTopTop: r1(skc1,x0),r1(x0,x1),r1(x1,x2),ren5(x0,skf6(x0)) -> p1(x2)
% 0.64/0.98 % 15:2:1:INP:Top: r1(skc1,x0) -> r1(x0,skf7(x0))
% 0.64/0.98 % 16:1:0:INP:: -> r1(skc1,skc8)
% 0.64/0.98 % 17:1:0:INP:: p1(skc8) ->
% 0.64/0.98 % 18:2:1:INP:Top: r1(skc8,x0) -> p1(x0)
% 0.64/0.98
% 0.64/0.98 % Predicates: r1 p1 ren1 ren2 ren3 ren4 ren5
% 0.64/0.98 % Fol Constants: skc1 skc8
% 0.64/0.98 % Fol Functions: skf2 skf3 skf4 skf5 skf6 skf7
% 0.64/0.98 % Problem Properties:
% 0.64/0.98 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.64/0.98
% 0.64/0.98
% 0.64/0.98 % Reduced Input Axiom Clauses:
% 0.64/0.98 % 1:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1)
% 0.64/0.98 % 2:2:2:INP:TopTop: p1(x0) -> ren1(x1,x0)
% 0.64/0.98 % 3:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1)
% 0.64/0.98 % 4:2:2:INP:TopTop: -> p1(x0),ren2(x1,x0)
% 0.64/0.98 % 5:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1)
% 0.64/0.98 % 6:2:2:INP:TopTop: -> p1(x0),ren3(x1,x0)
% 0.64/0.98 % 7:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1)
% 0.64/0.98 % 8:3:3:INP:TopTopTop: r1(x0,x1),p1(x1) -> ren4(x2,x0)
% 0.64/0.98 % 9:2:2:INP:TopTop: -> r1(x0,x1),ren5(x0,x1)
% 0.64/0.98 % 10:2:2:INP:TopTop: p1(x0) -> ren5(x1,x0)
% 0.64/0.98
% 0.64/0.98 % Reduced Input Conjecture Clauses:
% 0.64/0.98 % 11:4:2:INP:TopTop: r1(skc1,x0),r1(x0,x1),ren1(x1,skf2(x1)) -> p1(x0)
% 0.64/0.98 % 12:4:2:INP:TopTop: r1(skc1,x0),r1(x0,x1),ren2(x1,skf3(x1)),p1(x0) ->
% 0.64/0.98 % 13:5:3:INP:TopTopTop: r1(skc1,x0),r1(x0,x1),r1(x1,x2),ren3(x2,skf4(x2)),ren4(x0,skf5(x0)) ->
% 0.64/0.98 % 14:5:3:INP:TopTopTop: r1(skc1,x0),r1(x0,x1),r1(x1,x2),ren5(x0,skf6(x0)) -> p1(x2)
% 0.64/0.98 % 15:2:1:INP:Top: r1(skc1,x0) -> r1(x0,skf7(x0))
% 0.64/0.98 % 16:1:0:INP:: -> r1(skc1,skc8)
% 0.64/0.98 % 17:1:0:INP:: p1(skc8) ->
% 0.64/0.98 % 18:2:1:INP:Top: r1(skc8,x0) -> p1(x0)
% 0.64/0.98
% 0.64/0.98
% 0.64/0.98 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 31 atoms initially. Used heuristic: lmodel_grow ===
% 0.64/0.98
% 0.64/0.98
% 0.64/0.98
% 0.64/0.98 % SZS status Theorem
% 0.64/0.98 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.98
% 0.64/0.98 % SPASS-SCL-FOL Statistics:
% 0.64/0.98 % Number of learned clauses: 37
% 0.64/0.98 % Number of propagations: 4948
% 0.64/0.98 % Number of decisions: 2073
% 0.64/0.98 % Number of resolutions: 56
% 0.64/0.98 % Number of condensations: 4
% 0.64/0.98 % Number of sub resolutions: 8
% 0.64/0.98
% 0.64/0.98 % Solver is done. Empty clause found
% 0.64/0.98
% 0.64/0.98 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.64/0.98 % SZS output start Proof for theBenchmark
% See solution above
% 0.64/0.99 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.64/0.99
% 0.64/0.99
% 0.64/0.99 % Needed: 0:00:00.62
% 0.64/0.99
% 0.64/0.99 % ###
% 0.64/0.99 % ### Pagesize: 8192
% 0.64/0.99 % ### Marksize: 0
% 0.64/0.99 % ### Memory demanded: 10455 KBytes
% 0.64/0.99 % ### Memory freed: 10455 KBytes
% 0.64/0.99 % ### Memory remaining: 0 Bytes
% 0.64/0.99 % ### Pages allocated: 1140 Pages
% 0.64/0.99 % ###
%------------------------------------------------------------------------------