%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL672+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 : n017.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:06 PM UTC 2026
% Result : Theorem 18.95s 19.24s
% Output : Proof 18.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 14 unt; 4 def)
% Number of atoms : 321 ( 0 equ)
% Maximal formula atoms : 49 ( 11 avg)
% Number of connectives : 596 ( 304 ~; 219 |; 69 &)
% ( 0 <=>; 0 =>; 4 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-1 aty)
% Number of variables : 199 ( 2 sgn 171 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(main,conjecture,
~ ? [X1] :
~ ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(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)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(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)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| $false ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(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)
| p1(X2) ) ),
file('theBenchmark.p',main) ).
% NEGATING CONJECTURE
fof(main_nc,negated_conjecture,
? [X1] :
~ ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(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)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(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)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| $false ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(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)
| 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(X1,X3)
| ~ ( ~ ! [X4] :
( ~ r1(X3,X4)
| ~ ! [X5] :
( ~ r1(X4,X5)
| ~ p1(X5) ) )
& p1(X3) ) )
& ~ ! [X6] :
( ~ r1(X1,X6)
| p1(X6) ) )
| ( ~ ! [X7] :
( ~ r1(X1,X7)
| p2(X7) )
& ~ ! [X8] :
( ~ r1(X1,X8)
| ! [X9] :
( ~ r1(X8,X9)
| ~ ( ~ ! [X10] :
( ~ r1(X9,X10)
| ~ ! [X11] :
( ~ r1(X10,X11)
| p1(X11) ) )
& ~ ! [X12] :
( ~ r1(X9,X12)
| p1(X12) ) ) ) )
& ~ ! [X13] :
( ~ r1(X1,X13)
| p1(X13) ) )
| ( ~ ! [X14] :
( ~ r1(X1,X14)
| p2(X14) )
& ~ ! [X15] :
( ~ r1(X1,X15)
| ~ ( ~ ! [X16] :
( ~ r1(X15,X16)
| ~ ! [X17] :
( ~ r1(X16,X17)
| ~ ! [X18] :
( ~ r1(X17,X18)
| p1(X18) ) ) )
& ~ ! [X19] :
( ~ r1(X15,X19)
| ~ ! [X20] :
( ~ r1(X19,X20)
| p1(X20) ) ) ) )
& ~ ! [X21] :
( ~ r1(X1,X21)
| p1(X21) ) )
| ( ~ ! [X22] :
( ~ r1(X1,X22)
| p2(X22) )
& ~ ! [X23] :
( ~ r1(X1,X23)
| ~ ! [X24] : ~ r1(X23,X24) )
& ~ ! [X25] :
( ~ r1(X1,X25)
| p1(X25) ) )
| ! [X26] :
( ~ r1(X1,X26)
| p2(X26) )
| ! [X27] :
( ~ r1(X1,X27)
| ! [X28] :
( ~ r1(X27,X28)
| ~ ! [X29] :
( ~ r1(X28,X29)
| p1(X29) ) )
| ! [X30] :
( ~ r1(X27,X30)
| p1(X30) ) )
| ! [X31] :
( ~ r1(X1,X31)
| p1(X31) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[main_nc])]) ).
% FOF INTRODUCE RENAMING
fof(ren1_defn,definition,
! [X4,X5] :
( ren1(X4,X5)
<= ( ~ r1(X4,X5)
| ~ p1(X5) ) ),
introduced(definition,[new_symbols(definition,[ren1])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren2_defn,definition,
! [X10,X11] :
( ren2(X10,X11)
<= ( ~ r1(X10,X11)
| p1(X11) ) ),
introduced(definition,[new_symbols(definition,[ren2])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren3_defn,definition,
! [X16,X17] :
( ren3(X16,X17)
<= ( ~ r1(X16,X17)
| ~ ! [X18] :
( ~ r1(X17,X18)
| p1(X18) ) ) ),
introduced(definition,[new_symbols(definition,[ren3])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren4_defn,definition,
! [X19,X20] :
( ren4(X19,X20)
<= ( ~ r1(X19,X20)
| p1(X20) ) ),
introduced(definition,[new_symbols(definition,[ren4])],[main_nc_elimTB]) ).
% FOF RENAMING INFERENCE
fof(main_nc_renObv,negated_conjecture,
? [X1] :
~ ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X3] :
( ~ r1(X1,X3)
| ~ ( ~ ! [X4] :
( ~ r1(X3,X4)
| ~ ! [X5] : ren1(X4,X5) )
& p1(X3) ) )
& ~ ! [X6] :
( ~ r1(X1,X6)
| p1(X6) ) )
| ( ~ ! [X7] :
( ~ r1(X1,X7)
| p2(X7) )
& ~ ! [X8] :
( ~ r1(X1,X8)
| ! [X9] :
( ~ r1(X8,X9)
| ~ ( ~ ! [X10] :
( ~ r1(X9,X10)
| ~ ! [X11] : ren2(X10,X11) )
& ~ ! [X12] :
( ~ r1(X9,X12)
| p1(X12) ) ) ) )
& ~ ! [X13] :
( ~ r1(X1,X13)
| p1(X13) ) )
| ( ~ ! [X14] :
( ~ r1(X1,X14)
| p2(X14) )
& ~ ! [X15] :
( ~ r1(X1,X15)
| ~ ( ~ ! [X16] :
( ~ r1(X15,X16)
| ~ ! [X17] : ren3(X16,X17) )
& ~ ! [X19] :
( ~ r1(X15,X19)
| ~ ! [X20] : ren4(X19,X20) ) ) )
& ~ ! [X21] :
( ~ r1(X1,X21)
| p1(X21) ) )
| ( ~ ! [X22] :
( ~ r1(X1,X22)
| p2(X22) )
& ~ ! [X23] :
( ~ r1(X1,X23)
| ~ ! [X24] : ~ r1(X23,X24) )
& ~ ! [X25] :
( ~ r1(X1,X25)
| p1(X25) ) )
| ! [X26] :
( ~ r1(X1,X26)
| p2(X26) )
| ! [X27] :
( ~ r1(X1,X27)
| ! [X28] :
( ~ r1(X27,X28)
| ~ ! [X29] :
( ~ r1(X28,X29)
| p1(X29) ) )
| ! [X30] :
( ~ r1(X27,X30)
| p1(X30) ) )
| ! [X31] :
( ~ r1(X1,X31)
| p1(X31) ) ),
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)
| p2(X2) )
| ! [X3] :
( ~ r1(X1,X3)
| ! [X4] :
( ~ r1(X3,X4)
| ? [X5] : ~ ren1(X4,X5) )
| ~ p1(X3) )
| ! [X6] :
( ~ r1(X1,X6)
| p1(X6) ) )
& ( ! [X7] :
( ~ r1(X1,X7)
| p2(X7) )
| ! [X8] :
( ~ r1(X1,X8)
| ! [X9] :
( ~ r1(X8,X9)
| ! [X10] :
( ~ r1(X9,X10)
| ? [X11] : ~ ren2(X10,X11) )
| ! [X12] :
( ~ r1(X9,X12)
| p1(X12) ) ) )
| ! [X13] :
( ~ r1(X1,X13)
| p1(X13) ) )
& ( ! [X14] :
( ~ r1(X1,X14)
| p2(X14) )
| ! [X15] :
( ~ r1(X1,X15)
| ! [X16] :
( ~ r1(X15,X16)
| ? [X17] : ~ ren3(X16,X17) )
| ! [X18] :
( ~ r1(X15,X18)
| ? [X19] : ~ ren4(X18,X19) ) )
| ! [X20] :
( ~ r1(X1,X20)
| p1(X20) ) )
& ( ! [X21] :
( ~ r1(X1,X21)
| p2(X21) )
| ! [X22] :
( ~ r1(X1,X22)
| ? [X23] : r1(X22,X23) )
| ! [X24] :
( ~ r1(X1,X24)
| p1(X24) ) )
& ? [X25] :
( r1(X1,X25)
& ~ p2(X25) )
& ? [X26] :
( r1(X1,X26)
& ? [X27] :
( r1(X26,X27)
& ! [X28] :
( ~ r1(X27,X28)
| p1(X28) ) )
& ? [X29] :
( r1(X26,X29)
& ~ p1(X29) ) )
& ? [X30] :
( r1(X1,X30)
& ~ p1(X30) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[main_nc_renObv]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(main_nc_skol,negated_conjecture,
( ( ! [X2] :
( ~ r1(skc1,X2)
| p2(X2) )
| ! [X3] :
( ~ r1(skc1,X3)
| ! [X4] :
( ~ r1(X3,X4)
| ~ ren1(X4,skf2(X4)) )
| ~ p1(X3) )
| ! [X6] :
( ~ r1(skc1,X6)
| p1(X6) ) )
& ( ! [X7] :
( ~ r1(skc1,X7)
| p2(X7) )
| ! [X8] :
( ~ r1(skc1,X8)
| ! [X9] :
( ~ r1(X8,X9)
| ! [X10] :
( ~ r1(X9,X10)
| ~ ren2(X10,skf3(X10)) )
| ! [X12] :
( ~ r1(X9,X12)
| p1(X12) ) ) )
| ! [X13] :
( ~ r1(skc1,X13)
| p1(X13) ) )
& ( ! [X14] :
( ~ r1(skc1,X14)
| p2(X14) )
| ! [X15] :
( ~ r1(skc1,X15)
| ! [X16] :
( ~ r1(X15,X16)
| ~ ren3(X16,skf4(X16)) )
| ! [X18] :
( ~ r1(X15,X18)
| ~ ren4(X18,skf5(X18)) ) )
| ! [X20] :
( ~ r1(skc1,X20)
| p1(X20) ) )
& ( ! [X21] :
( ~ r1(skc1,X21)
| p2(X21) )
| ! [X22] :
( ~ r1(skc1,X22)
| r1(X22,skf6(X22)) )
| ! [X24] :
( ~ r1(skc1,X24)
| p1(X24) ) )
& r1(skc1,skc7)
& ~ p2(skc7)
& r1(skc1,skc8)
& r1(skc8,skc9)
& ! [X28] :
( ~ r1(skc9,X28)
| p1(X28) )
& r1(skc8,skc10)
& ~ p1(skc10)
& r1(skc1,skc11)
& ~ p1(skc11) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc1,skf2,skf3,skf4,skf5,skf6,skc7,skc8,skc9,skc10,skc11]),skolemize(X1,skc1),skolemize(X5,skf2(X4)),skolemize(X11,skf3(X10)),skolemize(X17,skf4(X16)),skolemize(X19,skf5(X18)),skolemize(X23,skf6(X22)),skolemize(X25,skc7),skolemize(X26,skc8),skolemize(X27,skc9),skolemize(X29,skc10),skolemize(X30,skc11)],[main_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_12,plain,
( ~ r1(skc1,X0)
| ~ r1(skc1,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ ren2(X3,skf3(X3))
| ~ r1(X2,X4)
| ~ r1(skc1,X5)
| p2(X0)
| p1(X4)
| p1(X5) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% 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])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_17,plain,
r1(skc1,skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_18,plain,
r1(skc8,skc9),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_19,plain,
( ~ r1(skc9,X0)
| p1(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% 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_6,plain,
( ~ p1(X0)
| ren2(X1,X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
( r1(X0,X1)
| ren2(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_32,plain,
ren2(skc9,X0),
inference(resolution,[status(thm)],[c_19,c_6,c_5]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_20,plain,
r1(skc8,skc10),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_22,plain,
r1(skc1,skc11),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_16,plain,
~ p2(skc7),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_21,plain,
~ p1(skc10),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_23,plain,
~ p1(skc11),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_15,plain,
r1(skc1,skc7),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_33,plain,
$false,
inference(byPropositionalAbstraction,[status(thm)],[c_12,c_1,c_17,c_18,c_32,c_20,c_22,c_16,c_21,c_23,c_15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL672+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n017.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sat Sep 5 14:30:21 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.95/19.24
% 18.95/19.24 % Input Clauses:
% 18.95/19.24 % 1:1:1:INP:Top: -> r1(x0,x0)
% 18.95/19.24 % 2:3:3:INP:TopTopTop: r1(x0,x1),r1(x1,x2) -> r1(x0,x2)
% 18.95/19.24 % 3:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1)
% 18.95/19.24 % 4:2:2:INP:TopTop: -> p1(x0),ren1(x1,x0)
% 18.95/19.24 % 5:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1)
% 18.95/19.24 % 6:2:2:INP:TopTop: p1(x0) -> ren2(x1,x0)
% 18.95/19.24 % 7:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1)
% 18.95/19.24 % 8:3:3:INP:TopTopTop: r1(x0,x1) -> p1(x1),ren3(x2,x0)
% 18.95/19.24 % 9:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1)
% 18.95/19.24 % 10:2:2:INP:TopTop: p1(x0) -> ren4(x1,x0)
% 18.95/19.24 % 11:8:4:INP:TopTopTopTop: r1(skc1,x0),r1(skc1,x1),r1(x1,x2),ren1(x2,skf2(x2)),p1(x1),r1(skc1,x3) -> p2(x0),p1(x3)
% 18.95/19.24 % 12:10:6:INP:TopTopTopTopTopTop: r1(skc1,x0),r1(skc1,x1),r1(x1,x2),r1(x2,x3),ren2(x3,skf3(x3)),r1(x2,x4),r1(skc1,x5) -> p2(x0),p1(x4),p1(x5)
% 18.95/19.24 % 13:9:5:INP:TopTopTopTopTop: r1(skc1,x0),r1(skc1,x1),r1(x1,x2),ren3(x2,skf4(x2)),r1(x1,x3),ren4(x3,skf5(x3)),r1(skc1,x4) -> p2(x0),p1(x4)
% 18.95/19.24 % 14:6:3:INP:TopTopTop: r1(skc1,x0),r1(skc1,x1),r1(skc1,x2) -> p2(x0),r1(x1,skf6(x1)),p1(x2)
% 18.95/19.24 % 15:1:0:INP:: -> r1(skc1,skc7)
% 18.95/19.24 % 16:1:0:INP:: p2(skc7) ->
% 18.95/19.24 % 17:1:0:INP:: -> r1(skc1,skc8)
% 18.95/19.24 % 18:1:0:INP:: -> r1(skc8,skc9)
% 18.95/19.24 % 19:2:1:INP:Top: r1(skc9,x0) -> p1(x0)
% 18.95/19.24 % 20:1:0:INP:: -> r1(skc8,skc10)
% 18.95/19.24 % 21:1:0:INP:: p1(skc10) ->
% 18.95/19.24 % 22:1:0:INP:: -> r1(skc1,skc11)
% 18.95/19.24 % 23:1:0:INP:: p1(skc11) ->
% 18.95/19.24
% 18.95/19.24 % Predicates: r1 p2 p1 ren1 ren2 ren3 ren4
% 18.95/19.24 % Fol Constants: skc1 skc7 skc8 skc9 skc10 skc11
% 18.95/19.24 % Fol Functions: skf2 skf3 skf4 skf5 skf6
% 18.95/19.24 % Problem Properties:
% 18.95/19.24 % This is a full first-order problem without equality. The Problem is non-linear.
% 18.95/19.24
% 18.95/19.24
% 18.95/19.24 % Reduced Input Axiom Clauses:
% 18.95/19.24 % 1:1:1:INP:Top: -> r1(x0,x0)
% 18.95/19.24 % 2:3:3:INP:TopTopTop: r1(x0,x1),r1(x1,x2) -> r1(x0,x2)
% 18.95/19.24 % 3:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1)
% 18.95/19.24 % 4:2:2:INP:TopTop: -> p1(x0),ren1(x1,x0)
% 18.95/19.24 % 5:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1)
% 18.95/19.24 % 6:2:2:INP:TopTop: p1(x0) -> ren2(x1,x0)
% 18.95/19.24 % 7:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1)
% 18.95/19.24 % 8:3:3:INP:TopTopTop: r1(x0,x1) -> p1(x1),ren3(x2,x0)
% 18.95/19.24 % 9:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1)
% 18.95/19.24 % 10:2:2:INP:TopTop: p1(x0) -> ren4(x1,x0)
% 18.95/19.24
% 18.95/19.24 % Reduced Input Conjecture Clauses:
% 18.95/19.24 % 11:8:4:INP:TopTopTopTop: r1(skc1,x0),r1(skc1,x1),r1(x1,x2),ren1(x2,skf2(x2)),p1(x1),r1(skc1,x3) -> p2(x0),p1(x3)
% 18.95/19.24 % 12:10:6:INP:TopTopTopTopTopTop: r1(skc1,x0),r1(skc1,x1),r1(x1,x2),r1(x2,x3),ren2(x3,skf3(x3)),r1(x2,x4),r1(skc1,x5) -> p2(x0),p1(x4),p1(x5)
% 18.95/19.24 % 13:9:5:INP:TopTopTopTopTop: r1(skc1,x0),r1(skc1,x1),r1(x1,x2),ren3(x2,skf4(x2)),r1(x1,x3),ren4(x3,skf5(x3)),r1(skc1,x4) -> p2(x0),p1(x4)
% 18.95/19.24 % 14:6:3:INP:TopTopTop: r1(skc1,x0),r1(skc1,x1),r1(skc1,x2) -> p2(x0),r1(x1,skf6(x1)),p1(x2)
% 18.95/19.24 % 15:1:0:INP:: -> r1(skc1,skc7)
% 18.95/19.24 % 16:1:0:INP:: p2(skc7) ->
% 18.95/19.24 % 17:1:0:INP:: -> r1(skc1,skc8)
% 18.95/19.24 % 18:1:0:INP:: -> r1(skc8,skc9)
% 18.95/19.24 % 19:2:1:INP:Top: r1(skc9,x0) -> p1(x0)
% 18.95/19.24 % 20:1:0:INP:: -> r1(skc8,skc10)
% 18.95/19.24 % 21:1:0:INP:: p1(skc10) ->
% 18.95/19.24 % 22:1:0:INP:: -> r1(skc1,skc11)
% 18.95/19.24 % 23:1:0:INP:: p1(skc11) ->
% 18.95/19.24
% 18.95/19.24
% 18.95/19.24 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 64 atoms initially. Used heuristic: lmodel_grow ===
% 18.95/19.24
% 18.95/19.24 %
% 18.95/19.24
% 18.95/19.24 % === SAT Conflict found: 33:0:0:[12.0,1.0,17.0,18.0,32.0,20.0,22.0,16.0,21.0,23.0,15.0]:: ->
% 18.95/19.24
% 18.95/19.24 % SZS status Theorem
% 18.95/19.24 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.95/19.24
% 18.95/19.24 % SPASS-SCL-FOL Statistics:
% 18.95/19.24 % Number of learned clauses: 9
% 18.95/19.24 % Number of propagations: 1384
% 18.95/19.24 % Number of decisions: 309
% 18.95/19.24 % Number of resolutions: 15
% 18.95/19.24 % Number of condensations: 1
% 18.95/19.24 % Number of sub resolutions: 0
% 18.95/19.24
% 18.95/19.24 % Solver is done. Empty clause found
% 18.95/19.24
% 18.95/19.24 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 18.95/19.24 % SZS output start Proof for theBenchmark
% See solution above
% 18.95/19.25 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 18.95/19.25
% 18.95/19.25
% 18.95/19.25 % Needed: 0:0:18.89
% 18.95/19.25
% 18.95/19.25 % ###
% 18.95/19.25 % ### Pagesize: 8192
% 18.95/19.25 % ### Marksize: 0
% 18.95/19.25 % ### Memory demanded: 9238 KBytes
% 18.95/19.25 % ### Memory freed: 9238 KBytes
% 18.95/19.25 % ### Memory remaining: 0 Bytes
% 18.95/19.25 % ### Pages allocated: 1162 Pages
% 18.95/19.25 % ###
%------------------------------------------------------------------------------