TSTP Solution File: SEU149+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU149+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n031.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:46 EDT 2023
% Result : Theorem 4.06s 2.02s
% Output : CNFRefutation 4.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 38
% Syntax : Number of formulae : 45 ( 6 unt; 35 typ; 0 def)
% Number of atoms : 17 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 10 ( 3 ~; 2 |; 0 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 62 ( 29 >; 33 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 30 ( 30 usr; 6 con; 0-3 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > proper_subset > in > disjoint > empty > unordered_pair > set_union2 > set_intersection2 > set_difference > #nlpp > singleton > powerset > empty_set > #skF_13 > #skF_6 > #skF_15 > #skF_17 > #skF_20 > #skF_12 > #skF_16 > #skF_18 > #skF_19 > #skF_10 > #skF_21 > #skF_11 > #skF_7 > #skF_9 > #skF_14 > #skF_3 > #skF_22 > #skF_2 > #skF_23 > #skF_8 > #skF_1 > #skF_5 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_13',type,
'#skF_13': ( $i * $i * $i ) > $i ).
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(proper_subset,type,
proper_subset: ( $i * $i ) > $o ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i ) > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_21',type,
'#skF_21': $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_23',type,
'#skF_23': $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_329,negated_conjecture,
~ ! [A,B,C] :
( ( singleton(A) = unordered_pair(B,C) )
=> ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
tff(f_77,axiom,
! [A,B,C] :
( ( C = unordered_pair(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( ( D = A )
| ( D = B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
tff(f_55,axiom,
! [A,B] :
( ( B = singleton(A) )
<=> ! [C] :
( in(C,B)
<=> ( C = A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
tff(c_268,plain,
'#skF_21' != '#skF_22',
inference(cnfTransformation,[status(thm)],[f_329]) ).
tff(c_270,plain,
unordered_pair('#skF_22','#skF_23') = singleton('#skF_21'),
inference(cnfTransformation,[status(thm)],[f_329]) ).
tff(c_493,plain,
! [D_182,B_183] : in(D_182,unordered_pair(D_182,B_183)),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_499,plain,
in('#skF_22',singleton('#skF_21')),
inference(superposition,[status(thm),theory(equality)],[c_270,c_493]) ).
tff(c_662,plain,
! [C_194,A_195] :
( ( C_194 = A_195 )
| ~ in(C_194,singleton(A_195)) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_665,plain,
'#skF_21' = '#skF_22',
inference(resolution,[status(thm)],[c_499,c_662]) ).
tff(c_678,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_268,c_665]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU149+2 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n031.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 12:03:44 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.06/2.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.06/2.02
% 4.06/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.06/2.04
% 4.06/2.04 Inference rules
% 4.06/2.04 ----------------------
% 4.06/2.04 #Ref : 0
% 4.06/2.04 #Sup : 97
% 4.06/2.04 #Fact : 0
% 4.06/2.04 #Define : 0
% 4.06/2.04 #Split : 0
% 4.06/2.04 #Chain : 0
% 4.06/2.04 #Close : 0
% 4.06/2.04
% 4.06/2.04 Ordering : KBO
% 4.06/2.04
% 4.06/2.04 Simplification rules
% 4.06/2.04 ----------------------
% 4.06/2.04 #Subsume : 15
% 4.06/2.04 #Demod : 45
% 4.06/2.04 #Tautology : 84
% 4.06/2.04 #SimpNegUnit : 1
% 4.06/2.04 #BackRed : 9
% 4.06/2.04
% 4.06/2.04 #Partial instantiations: 0
% 4.06/2.04 #Strategies tried : 1
% 4.06/2.04
% 4.06/2.04 Timing (in seconds)
% 4.06/2.04 ----------------------
% 4.06/2.05 Preprocessing : 0.64
% 4.06/2.05 Parsing : 0.30
% 4.06/2.05 CNF conversion : 0.06
% 4.06/2.05 Main loop : 0.36
% 4.06/2.05 Inferencing : 0.08
% 4.06/2.05 Reduction : 0.14
% 4.06/2.05 Demodulation : 0.10
% 4.06/2.05 BG Simplification : 0.04
% 4.06/2.05 Subsumption : 0.09
% 4.06/2.05 Abstraction : 0.02
% 4.06/2.05 MUC search : 0.00
% 4.06/2.05 Cooper : 0.00
% 4.06/2.05 Total : 1.04
% 4.06/2.05 Index Insertion : 0.00
% 4.06/2.05 Index Deletion : 0.00
% 4.06/2.05 Index Matching : 0.00
% 4.06/2.05 BG Taut test : 0.00
%------------------------------------------------------------------------------