%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC391-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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:57:41 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.48s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 15 unt; 0 def)
% Number of atoms : 15 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1_5,axiom,
sk2 = sk4,
file('theBenchmark.p',co1_5) ).
cnf(c_202,plain,
sk2 = sk4,
inference(clausify,[status(thm)],[co1_5]) ).
fof(co1_6,axiom,
sk1 = sk3,
file('theBenchmark.p',co1_6) ).
cnf(c_203,plain,
sk1 = sk3,
inference(clausify,[status(thm)],[co1_6]) ).
cnf(c_204,plain,
sk3 = sk1,
inference(copy,[status(thm)],[c_203]) ).
fof(co1_7,axiom,
sk4 = sk3,
file('theBenchmark.p',co1_7) ).
cnf(c_205,plain,
sk4 = sk3,
inference(clausify,[status(thm)],[co1_7]) ).
cnf(c_206,plain,
sk4 = sk1,
inference(paramod,[status(thm)],[c_204,c_205]) ).
fof(co1_9,axiom,
memberP(sk1,sk5),
file('theBenchmark.p',co1_9) ).
cnf(c_208,plain,
memberP(sk1,sk5),
inference(clausify,[status(thm)],[co1_9]) ).
fof(co1_10,axiom,
~ memberP(sk2,sk5),
file('theBenchmark.p',co1_10) ).
cnf(c_209,plain,
~ memberP(sk2,sk5),
inference(clausify,[status(thm)],[co1_10]) ).
cnf(c_211,plain,
~ memberP(sk4,sk5),
inference(paramod,[status(thm)],[c_202,c_209]) ).
cnf(c_212,plain,
~ memberP(sk1,sk5),
inference(paramod,[status(thm)],[c_206,c_211]) ).
cnf(c_210,plain,
$false,
inference(resolve,[status(thm)],[c_208,c_212]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC391-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 % Computer : n005.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Sat Sep 26 12:56:31 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.41 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.14/0.41 % Process 2195172 was started by sandbox on n005,
% 0.14/0.41 % Sat Sep 26 12:56:31 2026
% 0.14/0.41 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/0.42
% 0.14/0.42 % From the command line: assign(max_seconds, 300).
% 0.14/0.48
% 0.14/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.48
% 0.14/0.48 % Proof 1 at 0.03 (+ 0.01) seconds.
% 0.14/0.48 % Length of proof is 8.
% 0.14/0.48 % Level of proof is 3.
% 0.14/0.48 % Maximum clause weight is 3.000.
% 0.14/0.48 % Given clauses 0.
% 0.14/0.48
% 0.14/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------