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