%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MSC019+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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:04:29 AM UTC 2026
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 9 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 5 ~; 3 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom1,axiom,
! [X,Y,Z] :
( ( s_contains(Y,Z)
& s_contains(X,Y) )
=> s_contains(X,Z) ),
file('theBenchmark.p',axiom1) ).
fof(mexico_in_america_1,conjecture,
s_contains(s_g019,s_MX),
file('theBenchmark.p',mexico_in_america_1) ).
fof(mexico_in_america_1_neg,negated_conjecture,
~ s_contains(s_g019,s_MX),
inference(assume_negation,[status(cth)],[mexico_in_america_1]) ).
fof(kb18,axiom,
s_contains(s_g019,s_g013),
file('theBenchmark.p',kb18) ).
cnf(c_551,plain,
s_contains(s_g019,s_g013),
inference(clausify,[status(thm)],[kb18]) ).
fof(kb74,axiom,
s_contains(s_g013,s_MX),
file('theBenchmark.p',kb74) ).
cnf(c_568,plain,
s_contains(s_g013,s_MX),
inference(clausify,[status(thm)],[kb74]) ).
cnf(c_605,plain,
( s_contains(A,C)
| ~ s_contains(B,C)
| ~ s_contains(A,B) ),
inference(clausify,[status(thm)],[axiom1]) ).
cnf(c_608,negated_conjecture,
~ s_contains(s_g019,s_MX),
inference(clausify,[status(thm)],[mexico_in_america_1_neg]) ).
cnf(c_644,plain,
( s_contains(s_g019,A)
| ~ s_contains(s_g013,A) ),
inference(resolve,[status(thm)],[c_605,c_551]) ).
cnf(c_642,plain,
s_contains(s_g019,s_MX),
inference(resolve,[status(thm)],[c_644,c_568]) ).
cnf(c_643,plain,
$false,
inference(resolve,[status(thm)],[c_642,c_608]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC019+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n014.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 26 00:16:47 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35 % Process 1490668 was started by sandbox2 on n014,
% 0.09/0.35 % Sat Sep 26 00:16:47 2026
% 0.09/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.36
% 0.13/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.36
% 0.13/0.36 % SInE: 75 to sos, 528 to usable, of 603 axioms (tolerance 2.00, depth 0 fixpoint).
% 0.13/0.40
% 0.13/0.40 % SZS status Theorem for theBenchmark
% 0.13/0.40
% 0.13/0.40 % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.13/0.40 % Length of proof is 8.
% 0.13/0.40 % Level of proof is 3.
% 0.13/0.40 % Maximum clause weight is 9.000.
% 0.13/0.40 % Given clauses 25.
% 0.13/0.40
% 0.13/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------