%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC203-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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:08 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.39s
% Output : CNFRefutation 0.11s
% 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_9,axiom,
~ neq(sk1,nil),
file('theBenchmark.p',co1_9) ).
cnf(c_51,plain,
~ neq(sk1,nil),
inference(clausify,[status(thm)],[co1_9]) ).
fof(co1_8,axiom,
neq(sk2,nil),
file('theBenchmark.p',co1_8) ).
cnf(c_52,plain,
neq(sk2,nil),
inference(clausify,[status(thm)],[co1_8]) ).
fof(co1_7,axiom,
sk4 = sk3,
file('theBenchmark.p',co1_7) ).
cnf(c_53,plain,
sk4 = sk3,
inference(clausify,[status(thm)],[co1_7]) ).
fof(co1_6,axiom,
sk1 = sk3,
file('theBenchmark.p',co1_6) ).
cnf(c_54,plain,
sk1 = sk3,
inference(clausify,[status(thm)],[co1_6]) ).
fof(co1_5,axiom,
sk2 = sk4,
file('theBenchmark.p',co1_5) ).
cnf(c_55,plain,
sk2 = sk4,
inference(clausify,[status(thm)],[co1_5]) ).
cnf(c_318,plain,
sk2 = sk3,
inference(paramod,[status(thm)],[c_53,c_55]) ).
cnf(c_56,plain,
sk3 = sk2,
inference(copy,[status(thm)],[c_318]) ).
cnf(c_319,plain,
~ neq(sk3,nil),
inference(paramod,[status(thm)],[c_54,c_51]) ).
cnf(c_320,plain,
~ neq(sk2,nil),
inference(paramod,[status(thm)],[c_56,c_319]) ).
cnf(c_317,plain,
$false,
inference(resolve,[status(thm)],[c_52,c_320]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC203-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n018.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sat Sep 26 12:33:07 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.35 % Process 448234 was started by sandbox2 on n018,
% 0.07/0.35 % Sat Sep 26 12:33:07 2026
% 0.07/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/0.36
% 0.11/0.36 % From the command line: assign(max_seconds, 300).
% 0.11/0.39
% 0.11/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.39
% 0.11/0.39 % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.11/0.39 % Length of proof is 7.
% 0.11/0.39 % Level of proof is 2.
% 0.11/0.39 % Maximum clause weight is 3.000.
% 0.11/0.39 % Given clauses 0.
% 0.11/0.39
% 0.11/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------