%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL650+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 : n007.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:56 PM UTC 2026
% Result : Theorem 0.10s 0.38s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 5 unt; 5 def)
% Number of atoms : 351 ( 0 equ)
% Maximal formula atoms : 43 ( 8 avg)
% Number of connectives : 573 ( 262 ~; 219 |; 87 &)
% ( 0 <=>; 0 =>; 5 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-1 aty)
% Number of variables : 170 ( 0 sgn 110 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(main,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( ~ p8(X1)
& ~ p6(X1)
& ~ p4(X1)
& ~ p2(X1) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p3(X1)
& ~ p1(X1) )
| ( p1(X1)
& p3(X1) ) ) ) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p4(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p2(X1)
& ~ p3(X1) )
| ( p3(X1)
& p2(X1) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p1(X1)
& ~ p2(X1) )
| ( p2(X1)
& p1(X1) ) ) ) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( p4(X1)
& p3(X1)
& p2(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)
| ! [X1] :
( ~ r1(X2,X1)
| ( ~ p8(X1)
& ~ p6(X1)
& ~ p4(X1)
& ~ p2(X1) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p3(X1)
& ~ p1(X1) )
| ( p1(X1)
& p3(X1) ) ) ) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p4(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p2(X1)
& ~ p3(X1) )
| ( p3(X1)
& p2(X1) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p1(X1)
& ~ p2(X1) )
| ( p2(X1)
& p1(X1) ) ) ) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( p4(X1)
& p3(X1)
& p2(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)
| ! [X5] :
( ~ r1(X4,X5)
| ( ~ p8(X5)
& ~ p6(X5)
& ~ p4(X5)
& ~ p2(X5) ) ) ) ) )
| ! [X6] :
( ~ r1(X1,X6)
| p5(X6) )
| ~ ! [X7] :
( ~ r1(X1,X7)
| ~ ( ~ ! [X8] :
( ~ r1(X7,X8)
| ! [X9] :
( ~ r1(X8,X9)
| ! [X10] :
( ~ r1(X9,X10)
| ~ ( ( ~ p3(X10)
& ~ p1(X10) )
| ( p1(X10)
& p3(X10) ) ) ) ) )
| ! [X11] :
( ~ r1(X7,X11)
| p4(X11) )
| ~ ! [X12] :
( ~ r1(X7,X12)
| ~ ( ~ ! [X13] :
( ~ r1(X12,X13)
| ! [X14] :
( ~ r1(X13,X14)
| ~ ( ( ~ p2(X14)
& ~ p3(X14) )
| ( p3(X14)
& p2(X14) ) ) ) )
| ! [X15] :
( ~ r1(X12,X15)
| p3(X15) )
| ~ ! [X16] :
( ~ r1(X12,X16)
| ! [X17] :
( ~ r1(X16,X17)
| ~ ( ( ~ p1(X17)
& ~ p2(X17) )
| ( p2(X17)
& p1(X17) ) ) ) ) ) ) ) )
| ! [X18] :
( ~ r1(X1,X18)
| ! [X19] :
( ~ r1(X18,X19)
| ! [X20] :
( ~ r1(X19,X20)
| ! [X21] :
( ~ r1(X20,X21)
| ( p4(X21)
& p3(X21)
& p2(X21)
& p1(X21) ) ) ) ) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[main_nc])]) ).
% FOF INTRODUCE RENAMING
fof(ren5_defn,definition,
! [X7] :
( ren5(X7)
<= ( ~ ! [X8] :
( ~ r1(X7,X8)
| ! [X9] :
( ~ r1(X8,X9)
| ! [X10] :
( ~ r1(X9,X10)
| ~ ren1(X10) ) ) )
| ! [X11] :
( ~ r1(X7,X11)
| p4(X11) )
| ~ ! [X12] :
( ~ r1(X7,X12)
| ~ ren4(X12) ) ) ),
introduced(definition,[new_symbols(definition,[ren5])],[main_nc_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren5_elimImpEquivPushNegMiniScope,plain,
! [X1] :
( ( ! [X2] :
( ~ r1(X1,X2)
| ! [X3] :
( ~ r1(X2,X3)
| ! [X4] :
( ~ r1(X3,X4)
| ~ ren1(X4) ) ) )
& ? [X5] :
( r1(X1,X5)
& ~ p4(X5) )
& ! [X6] :
( ~ r1(X1,X6)
| ~ ren4(X6) ) )
| ren5(X1) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren5_defn]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(ren5_skol,plain,
! [X1] :
( ( ! [X2] :
( ~ r1(X1,X2)
| ! [X3] :
( ~ r1(X2,X3)
| ! [X4] :
( ~ r1(X3,X4)
| ~ ren1(X4) ) ) )
& r1(X1,skf2(X1))
& ~ p4(skf2(X1))
& ! [X6] :
( ~ r1(X1,X6)
| ~ ren4(X6) ) )
| ren5(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skf2]),skolemize(X5,skf2(X1))],[ren5_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_14,plain,
( ~ r1(X0,X1)
| ~ ren4(X1)
| ren5(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren5_skol])]) ).
% FOF INTRODUCE RENAMING
fof(ren1_defn,definition,
! [X10] :
( ren1(X10)
<= ( ( ~ p3(X10)
& ~ p1(X10) )
| ( p1(X10)
& p3(X10) ) ) ),
introduced(definition,[new_symbols(definition,[ren1])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren2_defn,definition,
! [X14] :
( ren2(X14)
<= ( ( ~ p2(X14)
& ~ p3(X14) )
| ( p3(X14)
& p2(X14) ) ) ),
introduced(definition,[new_symbols(definition,[ren2])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren3_defn,definition,
! [X17] :
( ren3(X17)
<= ( ( ~ p1(X17)
& ~ p2(X17) )
| ( p2(X17)
& p1(X17) ) ) ),
introduced(definition,[new_symbols(definition,[ren3])],[main_nc_elimTB]) ).
% FOF INTRODUCE RENAMING
fof(ren4_defn,definition,
! [X12] :
( ren4(X12)
<= ( ~ ! [X13] :
( ~ r1(X12,X13)
| ! [X14] :
( ~ r1(X13,X14)
| ~ ren2(X14) ) )
| ! [X15] :
( ~ r1(X12,X15)
| p3(X15) )
| ~ ! [X16] :
( ~ r1(X12,X16)
| ! [X17] :
( ~ r1(X16,X17)
| ~ ren3(X17) ) ) ) ),
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] :
( ~ r1(X3,X4)
| ! [X5] :
( ~ r1(X4,X5)
| ( ~ p8(X5)
& ~ p6(X5)
& ~ p4(X5)
& ~ p2(X5) ) ) ) ) )
| ! [X6] :
( ~ r1(X1,X6)
| p5(X6) )
| ~ ! [X7] :
( ~ r1(X1,X7)
| ~ ren5(X7) )
| ! [X18] :
( ~ r1(X1,X18)
| ! [X19] :
( ~ r1(X18,X19)
| ! [X20] :
( ~ r1(X19,X20)
| ! [X21] :
( ~ r1(X20,X21)
| ( p4(X21)
& p3(X21)
& p2(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] :
( r1(X3,X4)
& ? [X5] :
( r1(X4,X5)
& ( p8(X5)
| p6(X5)
| p4(X5)
| p2(X5) ) ) ) ) )
& ? [X6] :
( r1(X1,X6)
& ~ p5(X6) )
& ! [X7] :
( ~ r1(X1,X7)
| ~ ren5(X7) )
& ? [X8] :
( r1(X1,X8)
& ? [X9] :
( r1(X8,X9)
& ? [X10] :
( r1(X9,X10)
& ? [X11] :
( r1(X10,X11)
& ( ~ p4(X11)
| ~ p3(X11)
| ~ p2(X11)
| ~ p1(X11) ) ) ) ) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[main_nc_renObv]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(main_nc_skol,negated_conjecture,
( r1(skc3,skc4)
& r1(skc4,skc5)
& r1(skc5,skc6)
& r1(skc6,skc7)
& ( p8(skc7)
| p6(skc7)
| p4(skc7)
| p2(skc7) )
& r1(skc3,skc8)
& ~ p5(skc8)
& ! [X7] :
( ~ r1(skc3,X7)
| ~ ren5(X7) )
& r1(skc3,skc9)
& r1(skc9,skc10)
& r1(skc10,skc11)
& r1(skc11,skc12)
& ( ~ p4(skc12)
| ~ p3(skc12)
| ~ p2(skc12)
| ~ p1(skc12) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc3,skc4,skc5,skc6,skc7,skc8,skc9,skc10,skc11,skc12]),skolemize(X1,skc3),skolemize(X2,skc4),skolemize(X3,skc5),skolemize(X4,skc6),skolemize(X5,skc7),skolemize(X6,skc8),skolemize(X8,skc9),skolemize(X9,skc10),skolemize(X10,skc11),skolemize(X11,skc12)],[main_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_22,plain,
( ~ r1(skc3,X0)
| ~ ren5(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_28,plain,
( ~ r1(X0,X1)
| ~ ren4(X1)
| ~ r1(skc3,X0) ),
inference(resolution,[status(thm)],[c_14,c_22]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_15,plain,
r1(skc3,skc4),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_11,plain,
( ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ ren1(X3)
| ren5(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren5_skol])]) ).
% FOF SIMPLE INFERENCE
fof(ren1_elimImpEquivPushNegMiniScope,plain,
! [X1] :
( ( ( p3(X1)
| p1(X1) )
& ( ~ p1(X1)
| ~ p3(X1) ) )
| ren1(X1) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren1_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
( p3(X0)
| p1(X0)
| ren1(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% FOF SIMPLE INFERENCE
fof(ren2_elimImpEquivPushNegMiniScope,plain,
! [X1] :
( ( ( p2(X1)
| p3(X1) )
& ( ~ p3(X1)
| ~ p2(X1) ) )
| ren2(X1) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren2_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_4,plain,
( ~ p3(X0)
| ~ p2(X0)
| ren2(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% FOF SIMPLE INFERENCE
fof(ren3_elimImpEquivPushNegMiniScope,plain,
! [X1] :
( ( ( p1(X1)
| p2(X1) )
& ( ~ p2(X1)
| ~ p1(X1) ) )
| ren3(X1) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren3_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_6,plain,
( ~ p2(X0)
| ~ p1(X0)
| ren3(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren3_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_29,plain,
( ~ p2(X0)
| ren1(X0)
| ren2(X0)
| ren3(X0) ),
inference(resolution,[status(thm)],[c_1,c_4,c_6]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
( p1(X0)
| p2(X0)
| ren3(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren3_elimImpEquivPushNegMiniScope])]) ).
% FOF SIMPLE INFERENCE
fof(ren4_elimImpEquivPushNegMiniScope,plain,
! [X1] :
( ( ! [X2] :
( ~ r1(X1,X2)
| ! [X3] :
( ~ r1(X2,X3)
| ~ ren2(X3) ) )
& ? [X4] :
( r1(X1,X4)
& ~ p3(X4) )
& ! [X5] :
( ~ r1(X1,X5)
| ! [X6] :
( ~ r1(X5,X6)
| ~ ren3(X6) ) ) )
| ren4(X1) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren4_defn]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(ren4_skol,plain,
! [X1] :
( ( ! [X2] :
( ~ r1(X1,X2)
| ! [X3] :
( ~ r1(X2,X3)
| ~ ren2(X3) ) )
& r1(X1,skf1(X1))
& ~ p3(skf1(X1))
& ! [X5] :
( ~ r1(X1,X5)
| ! [X6] :
( ~ r1(X5,X6)
| ~ ren3(X6) ) ) )
| ren4(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skf1]),skolemize(X4,skf1(X1))],[ren4_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_7,plain,
( ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ ren2(X2)
| ren4(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren4_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_10,plain,
( ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ ren3(X2)
| ren4(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren4_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_2,plain,
( ~ p1(X0)
| ~ p3(X0)
| ren1(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_3,plain,
( p2(X0)
| p3(X0)
| ren2(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_30,plain,
( ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(skc3,X0)
| ~ p1(X3)
| ~ r1(X4,X5)
| ~ r1(X5,X3)
| ren3(X3)
| ren4(X4) ),
inference(resolution,[status(thm)],[c_11,c_2,c_22,c_3,c_6,c_7]) ).
% CNF SPASS RESOLUTION.
cnf(c_31,plain,
( ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(skc3,X0)
| ~ p1(X3)
| ~ r1(X4,X5)
| ~ r1(X5,X3)
| ren4(X4) ),
inference(resolution,[status(thm)],[c_10,c_30]) ).
% CNF SPASS RESOLUTION.
cnf(c_32,plain,
( ~ r1(skc4,X0)
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ p1(X2)
| ~ r1(X3,X4)
| ~ r1(X4,X2)
| ren4(X3) ),
inference(resolution,[status(thm)],[c_31,c_15]) ).
% CNF SPASS RESOLUTION.
cnf(c_33,plain,
( ~ r1(skc4,X0)
| ~ r1(X0,X1)
| ~ r1(X1,X2)
| ~ r1(X3,X4)
| ~ r1(X4,X2)
| ren4(X3) ),
inference(resolution,[status(thm)],[c_11,c_29,c_22,c_5,c_7,c_10,c_15,c_32]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_16,plain,
r1(skc4,skc5),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_17,plain,
r1(skc5,skc6),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_18,plain,
r1(skc6,skc7),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[main_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_34,plain,
$false,
inference(resolution,[status(thm)],[c_28,c_15,c_33,c_16,c_17,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL650+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.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 5 19:57:54 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.38
% 0.10/0.38 % Input Clauses:
% 0.10/0.38 % 1:3:1:INP:Top: -> p3(x0),p1(x0),ren1(x0)
% 0.10/0.38 % 2:3:1:INP:Top: p1(x0),p3(x0) -> ren1(x0)
% 0.10/0.38 % 3:3:1:INP:Top: -> p2(x0),p3(x0),ren2(x0)
% 0.10/0.38 % 4:3:1:INP:Top: p3(x0),p2(x0) -> ren2(x0)
% 0.10/0.38 % 5:3:1:INP:Top: -> p1(x0),p2(x0),ren3(x0)
% 0.10/0.38 % 6:3:1:INP:Top: p2(x0),p1(x0) -> ren3(x0)
% 0.10/0.38 % 7:4:3:INP:TopTopTop: r1(x0,x1),r1(x1,x2),ren2(x2) -> ren4(x0)
% 0.10/0.38 % 8:2:1:INP:Top: -> r1(x0,skf1(x0)),ren4(x0)
% 0.10/0.38 % 9:2:1:INP:Top: p3(skf1(x0)) -> ren4(x0)
% 0.10/0.38 % 10:4:3:INP:TopTopTop: r1(x0,x1),r1(x1,x2),ren3(x2) -> ren4(x0)
% 0.10/0.38 % 11:5:4:INP:TopTopTopTop: r1(x0,x1),r1(x1,x2),r1(x2,x3),ren1(x3) -> ren5(x0)
% 0.10/0.38 % 12:2:1:INP:Top: -> r1(x0,skf2(x0)),ren5(x0)
% 0.10/0.38 % 13:2:1:INP:Top: p4(skf2(x0)) -> ren5(x0)
% 0.10/0.38 % 14:3:2:INP:TopTop: r1(x0,x1),ren4(x1) -> ren5(x0)
% 0.10/0.38 % 15:1:0:INP:: -> r1(skc3,skc4)
% 0.10/0.38 % 16:1:0:INP:: -> r1(skc4,skc5)
% 0.10/0.38 % 17:1:0:INP:: -> r1(skc5,skc6)
% 0.10/0.38 % 18:1:0:INP:: -> r1(skc6,skc7)
% 0.10/0.38 % 19:4:0:INP:: -> p8(skc7),p6(skc7),p4(skc7),p2(skc7)
% 0.10/0.38 % 20:1:0:INP:: -> r1(skc3,skc8)
% 0.10/0.38 % 21:1:0:INP:: p5(skc8) ->
% 0.10/0.38 % 22:2:1:INP:Top: r1(skc3,x0),ren5(x0) ->
% 0.10/0.38 % 23:1:0:INP:: -> r1(skc3,skc9)
% 0.10/0.38 % 24:1:0:INP:: -> r1(skc9,skc10)
% 0.10/0.38 % 25:1:0:INP:: -> r1(skc10,skc11)
% 0.10/0.38 % 26:1:0:INP:: -> r1(skc11,skc12)
% 0.10/0.38 % 27:4:0:INP:: p4(skc12),p3(skc12),p2(skc12),p1(skc12) ->
% 0.10/0.38
% 0.10/0.38 % Predicates: r1 p8 p6 p4 p2 p5 p3 p1 ren1 ren2 ren3 ren4 ren5
% 0.10/0.38 % Fol Constants: skc3 skc4 skc5 skc6 skc7 skc8 skc9 skc10 skc11 skc12
% 0.10/0.38 % Fol Functions: skf1 skf2
% 0.10/0.38 % Problem Properties:
% 0.10/0.38 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.10/0.38
% 0.10/0.38
% 0.10/0.38 % Reduced Input Axiom Clauses:
% 0.10/0.38 % 1:3:1:INP:Top: -> p3(x0),p1(x0),ren1(x0)
% 0.10/0.38 % 2:3:1:INP:Top: p1(x0),p3(x0) -> ren1(x0)
% 0.10/0.38 % 3:3:1:INP:Top: -> p2(x0),p3(x0),ren2(x0)
% 0.10/0.38 % 4:3:1:INP:Top: p3(x0),p2(x0) -> ren2(x0)
% 0.10/0.38 % 5:3:1:INP:Top: -> p1(x0),p2(x0),ren3(x0)
% 0.10/0.38 % 6:3:1:INP:Top: p2(x0),p1(x0) -> ren3(x0)
% 0.10/0.38 % 7:4:3:INP:TopTopTop: r1(x0,x1),r1(x1,x2),ren2(x2) -> ren4(x0)
% 0.10/0.38 % 8:2:1:INP:Top: -> r1(x0,skf1(x0)),ren4(x0)
% 0.10/0.38 % 9:2:1:INP:Top: p3(skf1(x0)) -> ren4(x0)
% 0.10/0.38 % 10:4:3:INP:TopTopTop: r1(x0,x1),r1(x1,x2),ren3(x2) -> ren4(x0)
% 0.10/0.38 % 11:5:4:INP:TopTopTopTop: r1(x0,x1),r1(x1,x2),r1(x2,x3),ren1(x3) -> ren5(x0)
% 0.10/0.38 % 12:2:1:INP:Top: -> r1(x0,skf2(x0)),ren5(x0)
% 0.10/0.38 % 13:2:1:INP:Top: p4(skf2(x0)) -> ren5(x0)
% 0.10/0.38 % 14:3:2:INP:TopTop: r1(x0,x1),ren4(x1) -> ren5(x0)
% 0.10/0.38
% 0.10/0.38 % Reduced Input Conjecture Clauses:
% 0.10/0.38 % 15:1:0:INP:: -> r1(skc3,skc4)
% 0.10/0.38 % 16:1:0:INP:: -> r1(skc4,skc5)
% 0.10/0.38 % 17:1:0:INP:: -> r1(skc5,skc6)
% 0.10/0.38 % 18:1:0:INP:: -> r1(skc6,skc7)
% 0.10/0.38 % 19:4:0:INP:: -> p8(skc7),p6(skc7),p4(skc7),p2(skc7)
% 0.10/0.38 % 20:1:0:INP:: -> r1(skc3,skc8)
% 0.10/0.38 % 21:1:0:INP:: p5(skc8) ->
% 0.10/0.38 % 22:2:1:INP:Top: r1(skc3,x0),ren5(x0) ->
% 0.10/0.38 % 23:1:0:INP:: -> r1(skc3,skc9)
% 0.10/0.38 % 24:1:0:INP:: -> r1(skc9,skc10)
% 0.10/0.38 % 25:1:0:INP:: -> r1(skc10,skc11)
% 0.10/0.38 % 26:1:0:INP:: -> r1(skc11,skc12)
% 0.10/0.38 % 27:4:0:INP:: p4(skc12),p3(skc12),p2(skc12),p1(skc12) ->
% 0.10/0.38
% 0.10/0.38
% 0.10/0.38 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 63 atoms initially. Used heuristic: lmodel_grow ===
% 0.10/0.38
% 0.10/0.38
% 0.10/0.38
% 0.10/0.38 % SZS status Theorem
% 0.10/0.38 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.38
% 0.10/0.38 % SPASS-SCL-FOL Statistics:
% 0.10/0.38 % Number of learned clauses: 5
% 0.10/0.38 % Number of propagations: 68
% 0.10/0.38 % Number of decisions: 39
% 0.10/0.38 % Number of resolutions: 21
% 0.10/0.38 % Number of condensations: 1
% 0.10/0.38 % Number of sub resolutions: 1
% 0.10/0.38
% 0.10/0.38 % Solver is done. Empty clause found
% 0.10/0.38
% 0.10/0.38 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.10/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.39 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.10/0.39
% 0.10/0.39
% 0.10/0.39 % Needed: 0:00:00.01
% 0.10/0.39
% 0.10/0.39 % ###
% 0.10/0.39 % ### Pagesize: 8192
% 0.10/0.39 % ### Marksize: 0
% 0.10/0.39 % ### Memory demanded: 759 KBytes
% 0.10/0.39 % ### Memory freed: 759 KBytes
% 0.10/0.39 % ### Memory remaining: 0 Bytes
% 0.10/0.39 % ### Pages allocated: 207 Pages
% 0.10/0.39 % ###
%------------------------------------------------------------------------------