TSTP Solution File: SEU117+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU117+1 : TPTP v8.1.2. 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 : n013.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 Aug 22 10:57:38 EDT 2023
% Result : Theorem 4.16s 2.10s
% Output : CNFRefutation 4.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 38
% Syntax : Number of formulae : 51 ( 7 unt; 33 typ; 0 def)
% Number of atoms : 38 ( 1 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 32 ( 12 ~; 10 |; 4 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 31 ( 26 >; 5 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-2 aty)
% Number of variables : 24 (; 24 !; 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_13 > #skF_10 > #skF_14 > #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_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $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_198,axiom,
! [A,B] :
( element(A,powerset(B))
<=> subset(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
tff(f_214,negated_conjecture,
~ ! [A,B] :
( element(B,finite_subsets(A))
=> element(B,powerset(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t32_finsub_1) ).
tff(f_92,axiom,
! [A] :
( ~ empty(finite_subsets(A))
& cup_closed(finite_subsets(A))
& diff_closed(finite_subsets(A))
& preboolean(finite_subsets(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_finsub_1) ).
tff(f_43,axiom,
! [A,B] :
( element(A,B)
=> ( empty(B)
| in(A,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
tff(f_225,axiom,
! [A,B] :
( preboolean(B)
=> ( ( B = finite_subsets(A) )
<=> ! [C] :
( in(C,B)
<=> ( subset(C,A)
& finite(C) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).
tff(c_325,plain,
! [A_110,B_111] :
( element(A_110,powerset(B_111))
| ~ subset(A_110,B_111) ),
inference(cnfTransformation,[status(thm)],[f_198]) ).
tff(c_118,plain,
~ element('#skF_12',powerset('#skF_11')),
inference(cnfTransformation,[status(thm)],[f_214]) ).
tff(c_333,plain,
~ subset('#skF_12','#skF_11'),
inference(resolution,[status(thm)],[c_325,c_118]) ).
tff(c_120,plain,
element('#skF_12',finite_subsets('#skF_11')),
inference(cnfTransformation,[status(thm)],[f_214]) ).
tff(c_32,plain,
! [A_19] : ~ empty(finite_subsets(A_19)),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_334,plain,
! [A_112,B_113] :
( in(A_112,B_113)
| empty(B_113)
| ~ element(A_112,B_113) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_38,plain,
! [A_19] : preboolean(finite_subsets(A_19)),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_138,plain,
! [C_50,A_46] :
( subset(C_50,A_46)
| ~ in(C_50,finite_subsets(A_46))
| ~ preboolean(finite_subsets(A_46)) ),
inference(cnfTransformation,[status(thm)],[f_225]) ).
tff(c_144,plain,
! [C_50,A_46] :
( subset(C_50,A_46)
| ~ in(C_50,finite_subsets(A_46)) ),
inference(demodulation,[status(thm),theory(equality)],[c_38,c_138]) ).
tff(c_338,plain,
! [A_112,A_46] :
( subset(A_112,A_46)
| empty(finite_subsets(A_46))
| ~ element(A_112,finite_subsets(A_46)) ),
inference(resolution,[status(thm)],[c_334,c_144]) ).
tff(c_359,plain,
! [A_114,A_115] :
( subset(A_114,A_115)
| ~ element(A_114,finite_subsets(A_115)) ),
inference(negUnitSimplification,[status(thm)],[c_32,c_338]) ).
tff(c_366,plain,
subset('#skF_12','#skF_11'),
inference(resolution,[status(thm)],[c_120,c_359]) ).
tff(c_371,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_333,c_366]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU117+1 : TPTP v8.1.2. Released v3.2.0.
% 0.15/0.15 % 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.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 11:29:17 EDT 2023
% 0.15/0.37 % CPUTime :
% 4.16/2.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.16/2.10
% 4.16/2.10 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.16/2.13
% 4.16/2.13 Inference rules
% 4.16/2.13 ----------------------
% 4.16/2.13 #Ref : 0
% 4.16/2.13 #Sup : 36
% 4.16/2.13 #Fact : 0
% 4.16/2.13 #Define : 0
% 4.16/2.13 #Split : 0
% 4.16/2.13 #Chain : 0
% 4.16/2.13 #Close : 0
% 4.16/2.13
% 4.16/2.13 Ordering : KBO
% 4.16/2.13
% 4.16/2.13 Simplification rules
% 4.16/2.13 ----------------------
% 4.16/2.13 #Subsume : 3
% 4.16/2.13 #Demod : 30
% 4.16/2.13 #Tautology : 24
% 4.16/2.13 #SimpNegUnit : 3
% 4.16/2.13 #BackRed : 12
% 4.16/2.13
% 4.16/2.13 #Partial instantiations: 0
% 4.16/2.13 #Strategies tried : 1
% 4.16/2.13
% 4.16/2.13 Timing (in seconds)
% 4.16/2.13 ----------------------
% 4.16/2.13 Preprocessing : 0.58
% 4.16/2.13 Parsing : 0.30
% 4.16/2.13 CNF conversion : 0.05
% 4.16/2.13 Main loop : 0.38
% 4.16/2.13 Inferencing : 0.13
% 4.16/2.13 Reduction : 0.12
% 4.16/2.13 Demodulation : 0.08
% 4.16/2.13 BG Simplification : 0.03
% 4.16/2.13 Subsumption : 0.07
% 4.16/2.13 Abstraction : 0.01
% 4.16/2.13 MUC search : 0.00
% 4.16/2.13 Cooper : 0.00
% 4.16/2.13 Total : 1.01
% 4.16/2.13 Index Insertion : 0.00
% 4.16/2.13 Index Deletion : 0.00
% 4.16/2.13 Index Matching : 0.00
% 4.16/2.13 BG Taut test : 0.00
%------------------------------------------------------------------------------