%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYO612-1 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n001.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 09:51:06 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.39s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 13 ( 5 avg)
% Number of connectives : 194 ( 104 ~; 90 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 87 ( 19 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_01,axiom,
! [VAR_0] : le(VAR_0,VAR_0),
file('theBenchmark.p',sos_01) ).
cnf(c_1,plain,
le(A,A),
inference(clausify,[status(thm)],[sos_01]) ).
fof(sos_04,axiom,
! [VAR_0] : eq(f(VAR_0),a0),
file('theBenchmark.p',sos_04) ).
cnf(c_4,plain,
eq(f(A),a0),
inference(clausify,[status(thm)],[sos_04]) ).
fof(sos_05,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5,VAR_6] :
( ~ le(s(VAR_5),VAR_6)
| ~ le(s(VAR_4),VAR_5)
| ~ le(s(VAR_3),VAR_4)
| ~ le(s(VAR_2),VAR_3)
| ~ le(s(VAR_1),VAR_2)
| ~ le(s(VAR_0),VAR_1)
| ~ eq(f(VAR_6),a0)
| ~ eq(f(VAR_5),a0)
| ~ eq(f(VAR_4),a0)
| ~ eq(f(VAR_3),a0)
| ~ eq(f(VAR_2),a0)
| ~ eq(f(VAR_1),a0)
| ~ eq(f(VAR_0),a0) ),
file('theBenchmark.p',sos_05) ).
cnf(c_5,plain,
( ~ le(s(F),V6)
| ~ le(s(E),F)
| ~ le(s(D),E)
| ~ le(s(C),D)
| ~ le(s(B),C)
| ~ le(s(A),B)
| ~ eq(f(V6),a0)
| ~ eq(f(F),a0)
| ~ eq(f(E),a0)
| ~ eq(f(D),a0)
| ~ eq(f(C),a0)
| ~ eq(f(B),a0)
| ~ eq(f(A),a0) ),
inference(clausify,[status(thm)],[sos_05]) ).
cnf(c_10,plain,
( ~ le(s(E),F)
| ~ le(s(D),E)
| ~ le(s(C),D)
| ~ le(s(B),C)
| ~ le(s(A),B)
| ~ le(s(V6),A)
| ~ eq(f(F),a0)
| ~ eq(f(E),a0)
| ~ eq(f(D),a0)
| ~ eq(f(C),a0)
| ~ eq(f(B),a0)
| ~ eq(f(A),a0) ),
inference(resolve,[status(thm)],[c_4,c_5]) ).
cnf(c_11,plain,
( ~ le(s(D),E)
| ~ le(s(C),D)
| ~ le(s(B),C)
| ~ le(s(A),B)
| ~ le(s(V6),A)
| ~ le(s(F),V6)
| ~ eq(f(E),a0)
| ~ eq(f(D),a0)
| ~ eq(f(C),a0)
| ~ eq(f(B),a0)
| ~ eq(f(A),a0) ),
inference(resolve,[status(thm)],[c_4,c_10]) ).
cnf(c_12,plain,
( ~ le(s(C),D)
| ~ le(s(B),C)
| ~ le(s(A),B)
| ~ le(s(V6),A)
| ~ le(s(F),V6)
| ~ le(s(E),F)
| ~ eq(f(D),a0)
| ~ eq(f(C),a0)
| ~ eq(f(B),a0)
| ~ eq(f(A),a0) ),
inference(resolve,[status(thm)],[c_4,c_11]) ).
cnf(c_13,plain,
( ~ le(s(B),C)
| ~ le(s(A),B)
| ~ le(s(V6),A)
| ~ le(s(F),V6)
| ~ le(s(E),F)
| ~ le(s(D),E)
| ~ eq(f(C),a0)
| ~ eq(f(B),a0)
| ~ eq(f(A),a0) ),
inference(resolve,[status(thm)],[c_4,c_12]) ).
cnf(c_14,plain,
( ~ le(s(A),B)
| ~ le(s(V6),A)
| ~ le(s(F),V6)
| ~ le(s(E),F)
| ~ le(s(D),E)
| ~ le(s(C),D)
| ~ eq(f(B),a0)
| ~ eq(f(A),a0) ),
inference(resolve,[status(thm)],[c_4,c_13]) ).
cnf(c_15,plain,
( ~ le(s(V6),A)
| ~ le(s(F),V6)
| ~ le(s(E),F)
| ~ le(s(D),E)
| ~ le(s(C),D)
| ~ le(s(B),C)
| ~ eq(f(A),a0) ),
inference(resolve,[status(thm)],[c_4,c_14]) ).
cnf(c_6,plain,
( ~ le(s(F),V6)
| ~ le(s(E),F)
| ~ le(s(D),E)
| ~ le(s(C),D)
| ~ le(s(B),C)
| ~ le(s(A),B) ),
inference(resolve,[status(thm)],[c_4,c_15]) ).
cnf(c_16,plain,
( ~ le(s(E),F)
| ~ le(s(D),E)
| ~ le(s(C),D)
| ~ le(s(B),C)
| ~ le(s(s(A)),B) ),
inference(resolve,[status(thm)],[c_6,c_1]) ).
cnf(c_17,plain,
( ~ le(s(D),E)
| ~ le(s(C),D)
| ~ le(s(B),C)
| ~ le(s(s(s(A))),B) ),
inference(resolve,[status(thm)],[c_16,c_1]) ).
cnf(c_18,plain,
( ~ le(s(C),D)
| ~ le(s(B),C)
| ~ le(s(s(s(s(A)))),B) ),
inference(resolve,[status(thm)],[c_17,c_1]) ).
cnf(c_19,plain,
( ~ le(s(B),C)
| ~ le(s(s(s(s(s(A))))),B) ),
inference(resolve,[status(thm)],[c_18,c_1]) ).
cnf(c_20,plain,
~ le(s(s(s(s(s(s(A)))))),B),
inference(resolve,[status(thm)],[c_19,c_1]) ).
cnf(c_9,plain,
$false,
inference(resolve,[status(thm)],[c_20,c_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO612-1 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n001.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 26 19:43:45 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38 % Process 2533663 was started by sandbox on n001,
% 0.10/0.38 % Sat Sep 26 19:43:45 2026
% 0.10/0.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 0.10/0.39
% 0.10/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.39
% 0.10/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.39 % Length of proof is 5.
% 0.10/0.39 % Level of proof is 2.
% 0.10/0.39 % Maximum clause weight is 24.000.
% 0.10/0.39 % Given clauses 5.
% 0.10/0.39
% 0.10/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------