%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWX233-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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 09:16:25 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.35s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 15 unt; 0 def)
% Number of atoms : 15 ( 14 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 7 ( 2 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_006,axiom,
f(nil) = btrue,
file('theBenchmark.p',axiom_006) ).
cnf(c_7,plain,
f(nil) = btrue,
inference(clausify,[status(thm)],[axiom_006]) ).
fof(axiom_008,axiom,
! [VAR_0] : prop1(VAR_0) = eq(f(VAR_0),bfalse),
file('theBenchmark.p',axiom_008) ).
cnf(c_9,plain,
prop1(A) = eq(f(A),bfalse),
inference(clausify,[status(thm)],[axiom_008]) ).
fof(axiom_010,axiom,
eq(btrue,bfalse) = bfalse,
file('theBenchmark.p',axiom_010) ).
cnf(c_11,plain,
eq(btrue,bfalse) = bfalse,
inference(clausify,[status(thm)],[axiom_010]) ).
fof(axiom_011,axiom,
! [VAR_0] : eq(VAR_0,VAR_0) = btrue,
file('theBenchmark.p',axiom_011) ).
cnf(c_12,plain,
eq(A,A) = btrue,
inference(clausify,[status(thm)],[axiom_011]) ).
fof(goal,axiom,
! [VAR_0] : eq(prop1(VAR_0),bfalse) != btrue,
file('theBenchmark.p',goal) ).
cnf(c_13,plain,
eq(prop1(A),bfalse) != btrue,
inference(clausify,[status(thm)],[goal]) ).
cnf(c_14,plain,
eq(eq(f(A),bfalse),bfalse) != btrue,
inference(paramod,[status(thm)],[c_9,c_13]) ).
cnf(c_16,plain,
eq(eq(btrue,bfalse),bfalse) != btrue,
inference(paramod,[status(thm)],[c_7,c_14]) ).
cnf(c_17,plain,
eq(bfalse,bfalse) != btrue,
inference(paramod,[status(thm)],[c_11,c_16]) ).
cnf(c_18,plain,
btrue != btrue,
inference(paramod,[status(thm)],[c_12,c_17]) ).
cnf(c_15,plain,
$false,
inference(copy,[status(thm)],[c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX233-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.33 % Computer : n007.cluster.edu
% 0.09/0.33 % Model : x86_64 x86_64
% 0.09/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.33 % Memory : 8046.5625MB
% 0.09/0.33 % OS : Linux 6.8.0-71-generic
% 0.09/0.33 % CPULimit : 300
% 0.09/0.33 % WCLimit : 300
% 0.09/0.33 % DateTime : Sat Sep 26 16:58:53 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.34 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.34 % Process 26950 was started by sandbox on n007,
% 0.09/0.34 % Sat Sep 26 16:58:53 2026
% 0.09/0.34 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.34
% 0.09/0.34 % From the command line: assign(max_seconds, 300).
% 0.09/0.35
% 0.09/0.35 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.35
% 0.09/0.35 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.35 % Length of proof is 7.
% 0.09/0.35 % Level of proof is 2.
% 0.09/0.35 % Maximum clause weight is 8.000.
% 0.09/0.35 % Given clauses 13.
% 0.09/0.35
% 0.09/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------