%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : COL001-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n019.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 06:57:19 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 18 unt; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s_definition,axiom,
! [VAR_0,VAR_1,VAR_2] : apply(apply(apply(s,VAR_0),VAR_1),VAR_2) = apply(apply(VAR_0,VAR_2),apply(VAR_1,VAR_2)),
file('theBenchmark.p',s_definition) ).
cnf(c_1,plain,
apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)),
inference(clausify,[status(thm)],[s_definition]) ).
fof(b_definition,axiom,
! [VAR_0,VAR_1,VAR_2] : apply(apply(apply(b,VAR_0),VAR_1),VAR_2) = apply(VAR_0,apply(VAR_1,VAR_2)),
file('theBenchmark.p',b_definition) ).
cnf(c_3,plain,
apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)),
inference(clausify,[status(thm)],[b_definition]) ).
fof(i_definition,axiom,
! [VAR_0] : apply(i,VAR_0) = VAR_0,
file('theBenchmark.p',i_definition) ).
cnf(c_4,plain,
apply(i,A) = A,
inference(clausify,[status(thm)],[i_definition]) ).
fof(sb_property,axiom,
! [VAR_0] : apply(apply(apply(s,apply(b,VAR_0)),i),apply(apply(s,apply(b,VAR_0)),i)) = apply(x,apply(apply(apply(s,apply(b,VAR_0)),i),apply(apply(s,apply(b,VAR_0)),i))),
file('theBenchmark.p',sb_property) ).
cnf(c_5,plain,
apply(apply(apply(s,apply(b,A)),i),apply(apply(s,apply(b,A)),i)) = apply(x,apply(apply(apply(s,apply(b,A)),i),apply(apply(s,apply(b,A)),i))),
inference(clausify,[status(thm)],[sb_property]) ).
cnf(c_6,plain,
apply(x,apply(apply(apply(s,apply(b,A)),i),apply(apply(s,apply(b,A)),i))) = apply(apply(apply(s,apply(b,A)),i),apply(apply(s,apply(b,A)),i)),
inference(copy,[status(thm)],[c_5]) ).
fof(prove_fixed_point,axiom,
! [VAR_0] : VAR_0 != apply(combinator,VAR_0),
file('theBenchmark.p',prove_fixed_point) ).
cnf(c_7,plain,
A != apply(combinator,A),
inference(clausify,[status(thm)],[prove_fixed_point]) ).
cnf(c_8,plain,
apply(combinator,A) != A,
inference(copy,[status(thm)],[c_7]) ).
cnf(c_30,plain,
apply(x,apply(apply(apply(s,apply(b,A)),i),apply(apply(s,apply(b,A)),i))) = apply(apply(apply(b,A),apply(apply(s,apply(b,A)),i)),apply(i,apply(apply(s,apply(b,A)),i))),
inference(paramod,[status(thm)],[c_1,c_6]) ).
cnf(c_31,plain,
apply(apply(apply(s,apply(b,A)),i),apply(apply(s,apply(b,A)),i)) = apply(apply(apply(b,A),apply(apply(s,apply(b,A)),i)),apply(i,apply(apply(s,apply(b,A)),i))),
inference(paramod,[status(thm)],[c_6,c_30]) ).
cnf(c_32,plain,
apply(apply(apply(s,apply(b,A)),i),apply(apply(s,apply(b,A)),i)) = apply(apply(apply(b,A),apply(apply(s,apply(b,A)),i)),apply(apply(s,apply(b,A)),i)),
inference(paramod,[status(thm)],[c_4,c_31]) ).
cnf(c_33,plain,
apply(apply(apply(s,apply(b,A)),i),apply(apply(s,apply(b,A)),i)) = apply(A,apply(apply(apply(s,apply(b,A)),i),apply(apply(s,apply(b,A)),i))),
inference(paramod,[status(thm)],[c_3,c_32]) ).
cnf(c_28,plain,
apply(A,apply(apply(apply(s,apply(b,A)),i),apply(apply(s,apply(b,A)),i))) = apply(apply(apply(s,apply(b,A)),i),apply(apply(s,apply(b,A)),i)),
inference(copy,[status(thm)],[c_33]) ).
cnf(c_29,plain,
$false,
inference(resolve,[status(thm)],[c_28,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL001-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 23:02:33 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 2432057 was started by sandbox2 on n019,
% 0.09/0.37 % Sat Sep 26 23:02:33 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.38
% 0.09/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.38
% 0.09/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.38 % Length of proof is 9.
% 0.09/0.38 % Level of proof is 3.
% 0.09/0.38 % Maximum clause weight is 33.000.
% 0.09/0.38 % Given clauses 5.
% 0.09/0.38
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------