%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU116+1 : TPTP v9.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n026.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 : Wed Apr 9 08:52:48 PM UTC 2025
% Result : Theorem 4.01s 1.97s
% Output : CNFRefutation 4.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-1 aty)
% Number of variables : 6 ( 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation > preboolean > ordinal > one_to_one > natural > function > finite > epsilon_transitive > epsilon_connected > empty > diff_closed > cup_closed > cap_closed > #nlpp > powerset > finite_subsets > empty_set > #skF_7 > #skF_5 > #skF_4 > #skF_11 > #skF_1 > #skF_8 > #skF_10 > #skF_2 > #skF_3 > #skF_9 > #skF_6 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(epsilon_connected,type,
epsilon_connected: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff(cup_closed,type,
cup_closed: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(finite_subsets,type,
finite_subsets: $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(epsilon_transitive,type,
epsilon_transitive: $i > $o ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(finite,type,
finite: $i > $o ).
tff(one_to_one,type,
one_to_one: $i > $o ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff(function,type,
function: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(ordinal,type,
ordinal: $i > $o ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(preboolean,type,
preboolean: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(diff_closed,type,
diff_closed: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(cap_closed,type,
cap_closed: $i > $o ).
tff(natural,type,
natural: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_214,negated_conjecture,
~ ! [A,B] :
( element(B,finite_subsets(A))
=> finite(B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t30_finsub_1) ).
tff(f_131,axiom,
! [A,B] :
( element(B,finite_subsets(A))
=> finite(B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc3_finsub_1) ).
tff(c_118,plain,
~ finite('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_214]) ).
tff(c_120,plain,
element('#skF_12',finite_subsets('#skF_11')),
inference(cnfTransformation,[status(thm)],[f_214]) ).
tff(c_247,plain,
! [B_81,A_82] :
( finite(B_81)
| ~ element(B_81,finite_subsets(A_82)) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_254,plain,
finite('#skF_12'),
inference(resolution,[status(thm)],[c_120,c_247]) ).
tff(c_259,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU116+1 : TPTP v9.0.0. Released v3.2.0.
% 0.10/0.12 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Apr 8 22:04:23 EDT 2025
% 0.11/0.33 % CPUTime :
% 4.01/1.97 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.27/1.98
% 4.27/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------