%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL654+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 : n028.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:58 PM UTC 2026
% Result : Theorem 0.82s 1.06s
% Output : Proof 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 10 unt; 4 def)
% Number of atoms : 235 ( 0 equ)
% Maximal formula atoms : 29 ( 6 avg)
% Number of connectives : 432 ( 236 ~; 161 |; 31 &)
% ( 0 <=>; 0 =>; 4 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-1 aty)
% Number of variables : 168 ( 6 sgn 120 !; 13 ?)
% 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)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,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)
| $false ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [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)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,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)
| $false ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [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)
| ~ ! [X8] :
( ~ r1(X7,X8)
| p1(X8) ) )
& ~ ! [X9] :
( ~ r1(X6,X9)
| p1(X9) ) ) ) )
| ~ ! [X10] :
( ~ r1(X1,X10)
| ~ ( ~ ! [X11] :
( ~ r1(X10,X11)
| ~ ! [X12] :
( ~ r1(X11,X12)
| ~ ! [X13] :
( ~ r1(X12,X13)
| p1(X13) ) ) )
& ~ ! [X14] :
( ~ r1(X10,X14)
| ~ ! [X15] :
( ~ r1(X14,X15)
| p1(X15) ) ) ) )
| ~ ! [X16] :
( ~ r1(X1,X16)
| ~ ! [X17] : ~ r1(X16,X17) )
| ! [X18] :
( ~ r1(X1,X18)
| ! [X19] :
( ~ r1(X18,X19)
| ! [X20] :
( ~ r1(X19,X20)
| p1(X20) ) )
| ~ ! [X21] :
( ~ r1(X18,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,
! [X7,X8] :
( ren2(X7,X8)
<= ( ~ r1(X7,X8)
| p1(X8) ) ),
introduced(definition,[new_symbols(definition,[ren2])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren3_defn,definition,
! [X11,X12] :
( ren3(X11,X12)
<= ( ~ r1(X11,X12)
| ~ ! [X13] :
( ~ r1(X12,X13)
| p1(X13) ) ) ),
introduced(definition,[new_symbols(definition,[ren3])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren4_defn,definition,
! [X14,X15] :
( ren4(X14,X15)
<= ( ~ r1(X14,X15)
| p1(X15) ) ),
introduced(definition,[new_symbols(definition,[ren4])],[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] :
( ~ r1(X6,X7)
| ~ ! [X8] : ren2(X7,X8) )
& ~ ! [X9] :
( ~ r1(X6,X9)
| p1(X9) ) ) ) )
| ~ ! [X10] :
( ~ r1(X1,X10)
| ~ ( ~ ! [X11] :
( ~ r1(X10,X11)
| ~ ! [X12] : ren3(X11,X12) )
& ~ ! [X14] :
( ~ r1(X10,X14)
| ~ ! [X15] : ren4(X14,X15) ) ) )
| ~ ! [X16] :
( ~ r1(X1,X16)
| ~ ! [X17] : ~ r1(X16,X17) )
| ! [X18] :
( ~ r1(X1,X18)
| ! [X19] :
( ~ r1(X18,X19)
| ! [X20] :
( ~ r1(X19,X20)
| p1(X20) ) )
| ~ ! [X21] :
( ~ r1(X18,X21)
| p1(X21) ) ) ),
inference(renaming,[status(esa)],[main_nc_elimTB,ren1_defn,ren2_defn,ren3_defn,ren4_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] :
( ~ r1(X6,X7)
| ? [X8] : ~ ren2(X7,X8) )
| ! [X9] :
( ~ r1(X6,X9)
| p1(X9) ) ) )
& ! [X10] :
( ~ r1(X1,X10)
| ! [X11] :
( ~ r1(X10,X11)
| ? [X12] : ~ ren3(X11,X12) )
| ! [X13] :
( ~ r1(X10,X13)
| ? [X14] : ~ ren4(X13,X14) ) )
& ! [X15] :
( ~ r1(X1,X15)
| ? [X16] : r1(X15,X16) )
& ? [X17] :
( r1(X1,X17)
& ? [X18] :
( r1(X17,X18)
& ? [X19] :
( r1(X18,X19)
& ~ p1(X19) ) )
& ! [X20] :
( ~ r1(X17,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)
| ! [X7] :
( ~ r1(X6,X7)
| ~ ren2(X7,skf3(X7)) )
| ! [X9] :
( ~ r1(X6,X9)
| p1(X9) ) ) )
& ! [X10] :
( ~ r1(skc1,X10)
| ! [X11] :
( ~ r1(X10,X11)
| ~ ren3(X11,skf4(X11)) )
| ! [X13] :
( ~ r1(X10,X13)
| ~ ren4(X13,skf5(X13)) ) )
& ! [X15] :
( ~ r1(skc1,X15)
| r1(X15,skf6(X15)) )
& r1(skc1,skc7)
& r1(skc7,skc8)
& r1(skc8,skc9)
& ~ p1(skc9)
& ! [X20] :
( ~ r1(skc7,X20)
| p1(X20) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc1,skf2,skf3,skf4,skf5,skf6,skc7,skc8,skc9]),skolemize(X1,skc1),skolemize(X4,skf2(X3)),skolemize(X8,skf3(X7)),skolemize(X12,skf4(X11)),skolemize(X14,skf5(X13)),skolemize(X16,skf6(X15)),skolemize(X17,skc7),skolemize(X18,skc8),skolemize(X19,skc9)],[main_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_14,plain,
r1(skc1,skc7),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF SIMPLE INFERENCE
fof(ren4_elimImpEquivPushNegMiniScope,plain,
! [X1,X2] :
( ( r1(X1,X2)
& ~ p1(X2) )
| ren4(X1,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren4_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_8,plain,
( r1(X0,X1)
| ren4(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren4_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_9,plain,
( ~ p1(X0)
| ren4(X1,X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren4_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_18,plain,
( ~ r1(skc7,X0)
| p1(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_12,plain,
( ~ r1(skc1,X0)
| ~ r1(X0,X1)
| ~ ren3(X1,skf4(X1))
| ~ r1(X0,X2)
| ~ ren4(X2,skf5(X2)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_38,plain,
( ~ r1(skc7,skf5(X0))
| ~ r1(skc1,X1)
| ~ r1(X1,X2)
| ~ ren3(X2,skf4(X2))
| ~ r1(X1,X0) ),
inference(resolution,[status(thm)],[c_9,c_18,c_12]) ).
% FILE RECORD
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('theBenchmark.p',reflexivity) ).
% FOF SIMPLE INFERENCE
fof(reflexivity_elimTB,axiom,
! [X1] : r1(X1,X1),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity])]) ).
% FOF SIMPLE INFERENCE
fof(reflexivity_elimImpEquivPushNegMiniScope,axiom,
! [X1] : r1(X1,X1),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[reflexivity_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
r1(X0,X0),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[reflexivity_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_40,plain,
( ~ r1(skc1,skc7)
| ~ r1(skc7,X0)
| ~ ren3(X0,skf4(X0)) ),
inference(resolution,[status(thm)],[c_8,c_38,c_12,c_1]) ).
% CNF SPASS RESOLUTION.
cnf(c_41,plain,
( ~ r1(skc7,X0)
| ~ ren3(X0,skf4(X0)) ),
inference(resolution,[status(thm)],[c_14,c_40]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_15,plain,
r1(skc7,skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF SIMPLE INFERENCE
fof(ren3_elimImpEquivPushNegMiniScope,plain,
! [X1,X2] :
( ( r1(X1,X2)
& ! [X3] :
( ~ r1(X2,X3)
| p1(X3) ) )
| ren3(X1,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren3_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_7,plain,
( ~ r1(X0,X1)
| p1(X1)
| ren3(X2,X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren3_elimImpEquivPushNegMiniScope])]) ).
% FOF SIMPLE INFERENCE
fof(ren2_elimImpEquivPushNegMiniScope,plain,
! [X1,X2] :
( ( r1(X1,X2)
& ~ p1(X2) )
| ren2(X1,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren2_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_4,plain,
( r1(X0,X1)
| ren2(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
( ~ p1(X0)
| ren2(X1,X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_20,plain,
( ren3(X0,X1)
| ren2(X1,X2) ),
inference(resolution,[status(thm)],[c_7,c_4,c_5]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_11,plain,
( ~ r1(skc1,X0)
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ ren2(X2,skf3(X2))
| ~ r1(X1,X3)
| p1(X3) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_16,plain,
r1(skc8,skc9),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_17,plain,
~ p1(skc9),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_27,plain,
( ~ r1(skc1,X0)
| ~ r1(X0,skc8)
| ~ r1(skc8,X1)
| ~ ren2(X1,skf3(X1)) ),
inference(resolution,[status(thm)],[c_11,c_16,c_17]) ).
% CNF SPASS RESOLUTION.
cnf(c_28,plain,
( ~ r1(skc1,skc7)
| ~ r1(skc8,X0)
| ~ ren2(X0,skf3(X0)) ),
inference(resolution,[status(thm)],[c_27,c_15]) ).
% CNF SPASS RESOLUTION.
cnf(c_29,plain,
( ~ r1(skc8,X0)
| ~ ren2(X0,skf3(X0)) ),
inference(resolution,[status(thm)],[c_14,c_28]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_6,plain,
( r1(X0,X1)
| ren3(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren3_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_51,plain,
ren3(skc8,X0),
inference(resolution,[status(thm)],[c_20,c_29,c_6]) ).
% CNF SPASS RESOLUTION.
cnf(c_52,plain,
$false,
inference(resolution,[status(thm)],[c_41,c_15,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL654+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.10/0.34 % Computer : n028.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8046.5625MB
% 0.10/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Sat Sep 5 00:40:43 UTC 2026
% 0.10/0.34 % CPUTime :
% 0.10/0.34 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.82/1.06
% 0.82/1.06 % Input Clauses:
% 0.82/1.06 % 1:1:1:INP:Top: -> r1(x0,x0)
% 0.82/1.06 % 2:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1)
% 0.82/1.06 % 3:2:2:INP:TopTop: -> p1(x0),ren1(x1,x0)
% 0.82/1.06 % 4:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1)
% 0.82/1.06 % 5:2:2:INP:TopTop: p1(x0) -> ren2(x1,x0)
% 0.82/1.06 % 6:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1)
% 0.82/1.06 % 7:3:3:INP:TopTopTop: r1(x0,x1) -> p1(x1),ren3(x2,x0)
% 0.82/1.06 % 8:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1)
% 0.82/1.06 % 9:2:2:INP:TopTop: p1(x0) -> ren4(x1,x0)
% 0.82/1.06 % 10:4:2:INP:TopTop: r1(skc1,x0),r1(x0,x1),ren1(x1,skf2(x1)),p1(x0) ->
% 0.82/1.06 % 11:6:4:INP:TopTopTopTop: r1(skc1,x0),r1(x0,x1),r1(x1,x2),ren2(x2,skf3(x2)),r1(x1,x3) -> p1(x3)
% 0.82/1.06 % 12:5:3:INP:TopTopTop: r1(skc1,x0),r1(x0,x1),ren3(x1,skf4(x1)),r1(x0,x2),ren4(x2,skf5(x2)) ->
% 0.82/1.06 % 13:2:1:INP:Top: r1(skc1,x0) -> r1(x0,skf6(x0))
% 0.82/1.06 % 14:1:0:INP:: -> r1(skc1,skc7)
% 0.82/1.06 % 15:1:0:INP:: -> r1(skc7,skc8)
% 0.82/1.06 % 16:1:0:INP:: -> r1(skc8,skc9)
% 0.82/1.06 % 17:1:0:INP:: p1(skc9) ->
% 0.82/1.06 % 18:2:1:INP:Top: r1(skc7,x0) -> p1(x0)
% 0.82/1.06
% 0.82/1.06 % Predicates: r1 p1 ren1 ren2 ren3 ren4
% 0.82/1.06 % Fol Constants: skc1 skc7 skc8 skc9
% 0.82/1.06 % Fol Functions: skf2 skf3 skf4 skf5 skf6
% 0.82/1.06 % Problem Properties:
% 0.82/1.06 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.82/1.06
% 0.82/1.06
% 0.82/1.06 % Reduced Input Axiom Clauses:
% 0.82/1.06 % 1:1:1:INP:Top: -> r1(x0,x0)
% 0.82/1.06 % 2:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1)
% 0.82/1.06 % 3:2:2:INP:TopTop: -> p1(x0),ren1(x1,x0)
% 0.82/1.06 % 4:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1)
% 0.82/1.06 % 5:2:2:INP:TopTop: p1(x0) -> ren2(x1,x0)
% 0.82/1.06 % 6:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1)
% 0.82/1.06 % 7:3:3:INP:TopTopTop: r1(x0,x1) -> p1(x1),ren3(x2,x0)
% 0.82/1.06 % 8:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1)
% 0.82/1.06 % 9:2:2:INP:TopTop: p1(x0) -> ren4(x1,x0)
% 0.82/1.06
% 0.82/1.06 % Reduced Input Conjecture Clauses:
% 0.82/1.06 % 10:4:2:INP:TopTop: r1(skc1,x0),r1(x0,x1),ren1(x1,skf2(x1)),p1(x0) ->
% 0.82/1.06 % 11:6:4:INP:TopTopTopTop: r1(skc1,x0),r1(x0,x1),r1(x1,x2),ren2(x2,skf3(x2)),r1(x1,x3) -> p1(x3)
% 0.82/1.06 % 12:5:3:INP:TopTopTop: r1(skc1,x0),r1(x0,x1),ren3(x1,skf4(x1)),r1(x0,x2),ren4(x2,skf5(x2)) ->
% 0.82/1.06 % 13:2:1:INP:Top: r1(skc1,x0) -> r1(x0,skf6(x0))
% 0.82/1.06 % 14:1:0:INP:: -> r1(skc1,skc7)
% 0.82/1.06 % 15:1:0:INP:: -> r1(skc7,skc8)
% 0.82/1.06 % 16:1:0:INP:: -> r1(skc8,skc9)
% 0.82/1.06 % 17:1:0:INP:: p1(skc9) ->
% 0.82/1.06 % 18:2:1:INP:Top: r1(skc7,x0) -> p1(x0)
% 0.82/1.06
% 0.82/1.06
% 0.82/1.06 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 41 atoms initially. Used heuristic: lmodel_grow ===
% 0.82/1.06
% 0.82/1.06
% 0.82/1.06
% 0.82/1.06 % SZS status Theorem
% 0.82/1.06 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.82/1.06
% 0.82/1.06 % SPASS-SCL-FOL Statistics:
% 0.82/1.06 % Number of learned clauses: 29
% 0.82/1.06 % Number of propagations: 3003
% 0.82/1.06 % Number of decisions: 996
% 0.82/1.06 % Number of resolutions: 50
% 0.82/1.06 % Number of condensations: 6
% 0.82/1.06 % Number of sub resolutions: 4
% 0.82/1.06
% 0.82/1.06 % Solver is done. Empty clause found
% 0.82/1.06
% 0.82/1.06 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.82/1.06 % SZS output start Proof for theBenchmark
% See solution above
% 0.82/1.07 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.82/1.07
% 0.82/1.07
% 0.82/1.07 % Needed: 0:00:00.72
% 0.82/1.07
% 0.82/1.07 % ###
% 0.82/1.07 % ### Pagesize: 8192
% 0.82/1.07 % ### Marksize: 0
% 0.82/1.07 % ### Memory demanded: 5984 KBytes
% 0.82/1.07 % ### Memory freed: 5984 KBytes
% 0.82/1.07 % ### Memory remaining: 0 Bytes
% 0.82/1.07 % ### Pages allocated: 801 Pages
% 0.82/1.07 % ###
%------------------------------------------------------------------------------