%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : ITP010+2 : TPTP v9.2.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n019.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:31:30 PM UTC 2026
% Result : Theorem 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 5 ( 3 unt; 0 def)
% Number of atoms : 13 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 12 ( 4 ~; 0 |; 0 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 8 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_thm_2Ecardinal_2ECARD__NOT__LE,conjecture,
! [X9] :
( ne(X9)
=> ! [X10] :
( ne(X10)
=> ! [X14] :
( mem(X14,arr(X9,bool))
=> ! [X15] :
( mem(X15,arr(X10,bool))
=> ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X9,X10),X14),X15))
<=> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X9,X10),X14),X15)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Ecardinal_2ECARD__NOT__LE) ).
fof(c_0_1,negated_conjecture,
~ ! [X9] :
( ne(X9)
=> ! [X10] :
( ne(X10)
=> ! [X14] :
( mem(X14,arr(X9,bool))
=> ! [X15] : $true ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_thm_2Ecardinal_2ECARD__NOT__LE])]) ).
fof(c_0_2,negated_conjecture,
~ $true,
inference(fof_simplification,[status(thm)],[c_0_1]) ).
cnf(c_0_3,negated_conjecture,
$false,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
$false,
inference(cn,[status(thm)],[c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ITP010+2 : TPTP v9.2.1. Bugfixed v7.5.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n019.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 19:38:44 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Theorem for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------