%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : COL116-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n004.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:46 AM UTC 2026
% Result : Unsatisfiable 0.15s 0.38s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 5 unt; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 4 ( 1 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_Comb_Oparcontract_Ointros__1_0,axiom,
! [VAR_0] : c_in(c_Pair(VAR_0,VAR_0,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('theBenchmark.p',cls_Comb_Oparcontract_Ointros__1_0) ).
cnf(c_1,plain,
c_in(c_Pair(A,A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(clausify,[status(thm)],[cls_Comb_Oparcontract_Ointros__1_0]) ).
fof(cls_conjecture_0,axiom,
! [VAR_0] : ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(v_xb,v_z),c_Comb_Ocomb_Oop_A_D_D(v_yb,v_z)),VAR_0,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_2,plain,
~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(v_xb,v_z),c_Comb_Ocomb_Oop_A_D_D(v_yb,v_z)),A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
cnf(c_3,plain,
$false,
inference(resolve,[status(thm)],[c_1,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL116-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 23:16:36 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.15/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/0.36 % Process 2872963 was started by sandbox on n004,
% 0.15/0.36 % Sat Sep 26 23:16:36 2026
% 0.15/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/0.36
% 0.15/0.36 % From the command line: assign(max_seconds, 300).
% 0.15/0.38
% 0.15/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.38
% 0.15/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/0.38 % Length of proof is 3.
% 0.15/0.38 % Level of proof is 1.
% 0.15/0.38 % Maximum clause weight is 0.000.
% 0.15/0.38 % Given clauses 0.
% 0.15/0.38
% 0.15/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------