%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MSC019+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:49:57 PM UTC 2026
% Result : Theorem 1.34s 1.74s
% Output : CNFRefutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 8 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 5 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 10 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom1,axiom,
! [X1,X2,X3] :
( ( s_contains(X1,X2)
& s_contains(X2,X3) )
=> s_contains(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1) ).
fof(mexico_in_america_1,conjecture,
s_contains(s_g019,s_MX),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mexico_in_america_1) ).
fof(kb74,axiom,
s_contains(s_g013,s_MX),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kb74) ).
fof(kb18,axiom,
s_contains(s_g019,s_g013),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kb18) ).
fof(c_0_4,plain,
! [X11,X12,X13] :
( ~ s_contains(X11,X12)
| ~ s_contains(X12,X13)
| s_contains(X11,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom1])]) ).
fof(c_0_5,negated_conjecture,
~ s_contains(s_g019,s_MX),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[mexico_in_america_1])]) ).
cnf(c_0_6,plain,
( s_contains(X1,X3)
| ~ s_contains(X1,X2)
| ~ s_contains(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
s_contains(s_g013,s_MX),
inference(split_conjunct,[status(thm)],[kb74]) ).
cnf(c_0_8,negated_conjecture,
~ s_contains(s_g019,s_MX),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( s_contains(X1,s_MX)
| ~ s_contains(X1,s_g013) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
s_contains(s_g019,s_g013),
inference(split_conjunct,[status(thm)],[kb18]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC019+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n004.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 23:36:47 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.34/1.74 % Version : CSE_E---1.7
% 1.34/1.74 % Problem : theBenchmark.p
% 1.34/1.74 % SZS status Theorem for theBenchmark.p
% 1.34/1.74 % SZS output start CNFRefutation
% See solution above
% 1.34/1.74 % Total time : 1.374s
%------------------------------------------------------------------------------