%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC129-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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 : Sun Sep 27 08:56:55 AM UTC 2026
% Result : Unsatisfiable 47.63s 7.31s
% Output : CNFRefutation 47.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 17 unt; 0 def)
% Number of atoms : 35 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause7,axiom,
cyclefreeP(nil),
file('theBenchmark.p',clause7) ).
cnf(c_39,plain,
cyclefreeP(nil),
inference(clausify,[status(thm)],[clause7]) ).
fof(clause8,axiom,
ssList(nil),
file('theBenchmark.p',clause8) ).
cnf(c_40,plain,
ssList(nil),
inference(clausify,[status(thm)],[clause8]) ).
fof(clause100,axiom,
! [VAR_0,VAR_1] :
( VAR_1 = VAR_0
| neq(VAR_1,VAR_0)
| ~ ssList(VAR_1)
| ~ ssList(VAR_0) ),
file('theBenchmark.p',clause100) ).
cnf(c_120,plain,
( B = A
| neq(B,A)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[clause100]) ).
fof(co1_2,axiom,
ssList(sk2),
file('theBenchmark.p',co1_2) ).
cnf(c_199,plain,
ssList(sk2),
inference(clausify,[status(thm)],[co1_2]) ).
fof(co1_5,axiom,
sk2 = sk4,
file('theBenchmark.p',co1_5) ).
cnf(c_202,plain,
sk2 = sk4,
inference(clausify,[status(thm)],[co1_5]) ).
cnf(c_203,plain,
sk4 = sk2,
inference(copy,[status(thm)],[c_202]) ).
fof(co1_7,axiom,
~ neq(sk4,nil),
file('theBenchmark.p',co1_7) ).
cnf(c_206,plain,
~ neq(sk4,nil),
inference(clausify,[status(thm)],[co1_7]) ).
cnf(c_207,plain,
~ neq(sk2,nil),
inference(paramod,[status(thm)],[c_203,c_206]) ).
fof(co1_8,axiom,
~ cyclefreeP(sk2),
file('theBenchmark.p',co1_8) ).
cnf(c_208,plain,
~ cyclefreeP(sk2),
inference(clausify,[status(thm)],[co1_8]) ).
cnf(c_12828,plain,
( A = nil
| neq(A,nil)
| ~ ssList(A) ),
inference(resolve,[status(thm)],[c_120,c_40]) ).
cnf(c_1671,plain,
( nil = A
| neq(A,nil)
| ~ ssList(A) ),
inference(copy,[status(thm)],[c_12828]) ).
cnf(c_12829,plain,
( nil = sk2
| neq(sk2,nil) ),
inference(resolve,[status(thm)],[c_1671,c_199]) ).
cnf(c_12830,plain,
( sk2 = nil
| neq(sk2,nil) ),
inference(copy,[status(thm)],[c_12829]) ).
cnf(c_12793,plain,
sk2 = nil,
inference(resolve,[status(thm)],[c_207,c_12830]) ).
cnf(c_12831,plain,
~ cyclefreeP(nil),
inference(paramod,[status(thm)],[c_12793,c_208]) ).
cnf(c_12827,plain,
$false,
inference(resolve,[status(thm)],[c_39,c_12831]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC129-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n018.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 26 12:20:37 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.37 % Process 423346 was started by sandbox2 on n018,
% 0.08/0.37 % Sat Sep 26 12:20:37 2026
% 0.08/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.38
% 0.08/0.38 % From the command line: assign(max_seconds, 300).
% 47.63/7.31
% 47.63/7.31 % given #500 (I,wt=55): 543 app(app(A,cons(B,C)),cons(D,A)) != A | -ssList(A) | -ssList(C) | -ssItem(D) | -ssItem(B) | lt(B,D) | lt(D,B) | app(app(skaf61(A),cons(skaf59(A),skaf62(A))),cons(skaf60(A),skaf63(A))) = A. [factor(372,b,f)].
% 47.63/7.31
% 47.63/7.31 % given #1000 (T,wt=9): 878 frontsegP(skaf76(A),skaf76(A)). [resolve(93,a,51,a)].
% 47.63/7.31
% 47.63/7.31 % SZS status Unsatisfiable for theBenchmark
% 47.63/7.31
% 47.63/7.31 % Proof 1 at 5.25 (+ 1.56) seconds.
% 47.63/7.31 % Length of proof is 12.
% 47.63/7.31 % Level of proof is 4.
% 47.63/7.31 % Maximum clause weight is 12.000.
% 47.63/7.31 % Given clauses 1155.
% 47.63/7.31
% 47.63/7.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------