%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO086+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 : n011.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 07:17:01 AM UTC 2026
% Result : Theorem 0.15s 5.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 28 ( 5 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 21 ( 7 ~; 4 |; 7 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(c1,axiom,
! [C,C1] :
( ( C1 != C
& part_of(C1,C) )
=> open(C1) ),
file('theBenchmark.p',c1) ).
fof(theorem_2_7_2,conjecture,
! [C,Cpp] :
( ( part_of(Cpp,C)
& open(C) )
=> open(Cpp) ),
file('theBenchmark.p',theorem_2_7_2) ).
fof(theorem_2_7_2_neg,negated_conjecture,
~ ! [C,Cpp] :
( ( part_of(Cpp,C)
& open(C) )
=> open(Cpp) ),
inference(assume_negation,[status(cth)],[theorem_2_7_2]) ).
cnf(c_55,plain,
( open(A)
| B = A
| ~ part_of(A,B) ),
inference(clausify,[status(thm)],[c1]) ).
fof(nnf_17,plain,
? [C,Cpp] :
( ~ open(Cpp)
& part_of(Cpp,C)
& open(C) ),
inference(fof_nnf,[status(thm)],[theorem_2_7_2_neg]) ).
fof(sk_theorem_2_7_2_neg,plain,
( ~ open(sK1)
& part_of(sK1,sK0)
& open(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(C,sK0),skolemize(Cpp,sK1)],[nnf_17]) ).
cnf(c_64,negated_conjecture,
open(sK0),
inference(split_conjunct,[status(thm)],[sk_theorem_2_7_2_neg]) ).
cnf(c_65,negated_conjecture,
part_of(sK1,sK0),
inference(split_conjunct,[status(thm)],[sk_theorem_2_7_2_neg]) ).
cnf(c_66,negated_conjecture,
~ open(sK1),
inference(split_conjunct,[status(thm)],[sk_theorem_2_7_2_neg]) ).
cnf(c_393,negated_conjecture,
( open(sK1)
| sK0 = sK1 ),
inference(resolve,[status(thm)],[c_65,c_55]) ).
cnf(c_394,negated_conjecture,
( open(sK1)
| sK1 = sK0 ),
inference(copy,[status(thm)],[c_393]) ).
cnf(c_262,negated_conjecture,
sK1 = sK0,
inference(resolve,[status(thm)],[c_66,c_394]) ).
cnf(c_395,plain,
~ open(sK0),
inference(paramod,[status(thm)],[c_262,c_66]) ).
cnf(c_392,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_64,c_395]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO086+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/5.37 % Computer : n011.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Fri Sep 25 12:41:19 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/5.38 % Process 2031214 was started by sandbox2 on n011,
% 0.10/5.38 % Fri Sep 25 12:41:19 2026
% 0.10/5.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/5.39
% 0.10/5.39 % From the command line: assign(max_seconds, 300).
% 0.15/5.42
% 0.15/5.42 % SZS status Theorem for theBenchmark
% 0.15/5.42
% 0.15/5.42 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.15/5.42 % Length of proof is 8.
% 0.15/5.42 % Level of proof is 3.
% 0.15/5.42 % Maximum clause weight is 13.000.
% 0.15/5.42 % Given clauses 58.
% 0.15/5.42
% 0.15/5.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------